Author Info
Name
Affiliation
Papers
PETER HABERMEHL
LIAFA, University Paris Diderot--Paris 7, Paris Cedex 13, France 75251
22
Collaborators
Citations 
PageRank 
21
502
30.39
Referers 
Referees 
References 
562
366
369
Search Limit
100562
Title
Citations
PageRank
Year
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes00.342022
Forest automata for verification of heap manipulation140.972011
Programs with lists are counter automata421.862011
Automatic Verification of Integer Array Programs220.792009
What else is decidable about integer arrays?271.422008
Verification of parametric concurrent systems with prioritised FIFO resource management170.792008
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata140.762008
A Logic of Singly Indexed Arrays60.492008
Rewriting Systems with Data271.222007
Proving termination of tree manipulating programs60.572007
Automata-Based verification of programs with tree updates100.642006
Abstract Regular Tree Model Checking221.142006
Abstract regular tree model checking of complex dynamic data structures451.952006
Verifying programs with dynamic 1-selector-linked structures in regular model checking351.402005
Regular Model Checking Using Inference of Regular Languages341.422005
Automatic verification of recursive procedures with one integer parameter211.142003
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations462.121999
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis201.401999
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract)251.301997
Constrained Properties, Semilinear Systems, and Petri Nets211.361996
On the Verification Problem of Nonregular Properties for Nonregular Processes335.801995
Verifying infinite state processes with sequential and parallel composition151.521995