Peter Habermehl

According to our database1, Peter Habermehl
  • authored at least 50 papers between 1995 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
On the path-width of integer linear programming.
Inf. Comput., 2017

Model-checking Counting Temporal Logics on Flat Structures.
CoRR, 2017

2016
Regular Transformations of Data Words Through Origin Information.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

2015
On Presburger Arithmetic Extended with Modulo Counting Quantifiers.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014
On the Path-Width of Integer Linear Programming.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Ordered Navigation on Multi-attributed Data Words.
CoRR, 2014

A Robust Class of Data Languages and an Application to Learning.
Logical Methods in Computer Science, 2014

Ordered Navigation on Multi-attributed Data Words.
Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

Learning Transparent Data Automata.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013
A Fresh Approach to Learning Register Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Abstract regular (tree) model checking.
STTT, 2012

Forest automata for verification of heap manipulation.
Formal Methods in System Design, 2012

Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011
On Yen's Path Logic for Petri Nets.
Int. J. Found. Comput. Sci., 2011

Programs with lists are counter automata.
Formal Methods in System Design, 2011

Forest Automata for Verification of Heap Manipulation.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Automata-based verification of programs with tree updates.
Acta Inf., 2010

The Downward-Closure of Petri Net Languages.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On the Use of Non-deterministic Automata for Presburger Arithmetic.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Preface.
Electr. Notes Theor. Comput. Sci., 2009

On Yen's Path Logic for Petri Nets.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Angluin-Style Learning of NFA.
Proceedings of the IJCAI 2009, 2009

Realizability of Concurrent Recursive Programs.
Proceedings of the Foundations of Software Science and Computational Structures, 2009

Automatic Verification of Integer Array Programs.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Verification of parametric concurrent systems with prioritised FIFO resource management.
Formal Methods in System Design, 2008

Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
Proceedings of the Implementation and Applications of Automata, 2008

A Logic of Singly Indexed Arrays.
Proceedings of the Logic for Programming, 2008

What Else Is Decidable about Integer Arrays?.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007
Rewriting Systems with Data.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Proving Termination of Tree Manipulating Programs.
Proceedings of the Automated Technology for Verification and Analysis, 2007

2006
Abstract Regular Tree Model Checking.
Electr. Notes Theor. Comput. Sci., 2006

Automata-Based Verification of Programs with Tree Updates.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2006

Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.
Proceedings of the Static Analysis, 13th International Symposium, 2006

Programs with Lists Are Counter Automata.
Proceedings of the Computer Aided Verification, 18th International Conference, 2006

2005
Regular Model Checking Using Inference of Regular Languages.
Electr. Notes Theor. Comput. Sci., 2005

Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2005

2004
Counting in Trees for Free.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Abstract Regular Model Checking.
Proceedings of the Computer Aided Verification, 16th International Conference, 2004

2003
Automatic verification of recursive procedures with one integer parameter.
Theor. Comput. Sci., 2003

Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.
Proceedings of the CONCUR 2003, 2003

2001
Automatic Verification of Recursive Procedures with One Integer Parameter.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

1999
Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations.
Theor. Comput. Sci., 1999

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.
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).
PhD thesis, 1998

1997
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

On the Complexity of the Linear-Time mu -calculus for Petri-Nets.
Proceedings of the Application and Theory of Petri Nets 1997, 1997

1996
Constrained Properties, Semilinear Systems, and Petri Nets.
Proceedings of the CONCUR '96, 1996

1995
Verifying Infinite State Processes with Sequential and Parallel Composition.
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
Proceedings of the Proceedings, 1995


  Loading...