Peter Habermehl

Dietrich Kuske

Log. Methods Comput. Sci., 2023

2022

Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes.

[BibT_eX]

[DOI]

Wael-Amine Boutglay

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2018

Realizability of concurrent recursive programs.

[BibT_eX]

[DOI]

Benedikt Bollig

Manuela-Lidia Grindei

Formal Methods Syst. Des., 2018

Left-Eigenvectors Are Certificates of the Orbit Problem.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 12th International Conference, 2018

2017

Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete.

[BibT_eX]

[DOI]

Mohamed Faouzi Atig

Benedikt Bollig

Int. J. Found. Comput. Sci., 2017

Model-Checking Counting Temporal Logics on Flat Structures.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Regular Transformations of Data Words Through Origin Information.

[BibT_eX]

[DOI]

Antoine Durand-Gasselin

Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015

On Presburger Arithmetic Extended with Modulo Counting Quantifiers.

[BibT_eX]

[DOI]

Dietrich Kuske

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

On the Path-Width of Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

A Robust Class of Data Languages and an Application to Learning.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Ordered Navigation on Multi-attributed Data Words.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Learning Transparent Data Automata.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013

A Fresh Approach to Learning Register Automata.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Forest automata for verification of heap manipulation.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2012

Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree.

[BibT_eX]

[DOI]

Antoine Durand-Gasselin

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

On Yen's Path Logic for Petri Nets.

[BibT_eX]

[DOI]

Mohamed Faouzi Atig

Int. J. Found. Comput. Sci., 2011

Programs with lists are counter automata.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2011

2010

Automata-based verification of programs with tree updates.

[BibT_eX]

[DOI]

Radu Iosif

Acta Informatica, 2010

The Downward-Closure of Petri Net Languages.

[BibT_eX]

[DOI]

Roland Meyer

Harro Wimmel

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On the Use of Non-deterministic Automata for Presburger Arithmetic.

[BibT_eX]

[DOI]

Antoine Durand-Gasselin

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Preface.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the 8th, 2009

Angluin-Style Learning of NFA.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Automatic Verification of Integer Array Programs.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008

Verification of parametric concurrent systems with prioritised FIFO resource management.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2008

Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Applications of Automata, 2008

A Logic of Singly Indexed Arrays.

[BibT_eX]

[DOI]

Radu Iosif

Proceedings of the Logic for Programming, 2008

What Else Is Decidable about Integer Arrays?.

[BibT_eX]

[DOI]

Radu Iosif

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.

[BibT_eX]

[DOI]

Mohamed Faouzi Atig

Benedikt Bollig

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Rewriting Systems with Data.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Proving Termination of Tree Manipulating Programs.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2007

2006

Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 13th International Symposium, 2006

2005

Abstract Regular Tree Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, 2005

Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

2004

Regular Model Checking Using Inference of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, 2004

Counting in Trees for Free.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Abstract Regular Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003

Automatic verification of recursive procedures with one integer parameter.

[BibT_eX]

[DOI]

Richard Mayr

Theor. Comput. Sci., 2003

Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2003, 2003

1999

Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998

Sur la vérification de systèmes infinis. (On the verification of infinite-state systems).

[BibT_eX]

[DOI]

PhD thesis, 1998

1997

Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

On the Complexity of the Linear-Time mu -calculus for Petri-Nets.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1997, 1997

1996

Constrained Properties, Semilinear Systems, and Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '96, 1996

1995

Verifying Infinite State Processes with Sequential and Parallel Composition.

[BibT_eX]

[DOI]

Rachid Echahed

Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

On the Verification Problem of Nonregular Properties for Nonregular Processes

[BibT_eX]

[DOI]

Rachid Echahed