Travelled to:1 × Austria
1 × Finland
1 × Hungary
1 × Japan
1 × Korea
2 × Italy
3 × France
3 × United Kingdom
6 × USA
Collaborated with:A.Bouajjani T.Vojnar R.Iosif B.Bollig R.Echahed D.Kuske A.Rogalewicz P.Moro L.Holík M.Bozga R.Meyer H.Wimmel M.Grindei M.F.Atig M.Leucker B.Monmege H.Seidl T.Schwentick A.Muscholl J.Simácek F.Konecný T.Touili P.A.Abdulla A.Annichini S.Bensalem Y.Lakhnech
Talks about:automata (6) program (5) verif (5) tree (4) nonregular (3) abstract (3) regular (3) model (3) check (3) structur (2)
Person: Peter Habermehl
DBLP: Habermehl:Peter
Contributed to:
2015
2013
2011
201020092009
2008200820082006
2006
200620052004200419991997
1995
1995Wrote 19 papers:
- FoSSaCS-2015-HabermehlK #on the #quantifier
- On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.
- DLT-2013-BolligHLM #approach #automaton #learning
- A Fresh Approach to Learning Register Automata (BB, PH, ML, BM), pp. 118–130.
- CAV-2011-HabermehlHRSV #automaton #verification
- Forest Automata for Verification of Heap Manipulation (PH, LH, AR, JS, TV), pp. 424–440.
- ICALP-v2-2010-HabermehlMW #petri net
- The Downward-Closure of Petri Net Languages (PH, RM, HW), pp. 466–477.
- CAV-2009-BozgaHIKV #array #automation #integer #source code #verification
- Automatic Verification of Integer Array Programs (MB, PH, RI, FK, TV), pp. 157–172.
- FoSSaCS-2009-BolligGH #concurrent #recursion #source code
- Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
- CIAA-2008-BouajjaniHHTV #automaton #finite #nondeterminism #testing
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.
- DLT-2008-AtigBH #automaton #multi
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete (MFA, BB, PH), pp. 121–133.
- FoSSaCS-2008-HabermehlIV #array #decidability #integer #question #what
- What Else Is Decidable about Integer Arrays? (PH, RI, TV), pp. 474–489.
- CAV-2006-BouajjaniBHIMV #automaton #source code
- Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.
- SAS-2006-BouajjaniHRV #data type #model checking
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (AB, PH, AR, TV), pp. 52–70.
- TACAS-2006-HabermehlIV #source code #verification
- Automata-Based Verification of Programs with Tree Updates (PH, RI, TV), pp. 350–364.
- TACAS-2005-BouajjaniHMV #model checking #source code #verification
- Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking (AB, PH, PM, TV), pp. 13–29.
- CAV-2004-BouajjaniHV #model checking
- Abstract Regular Model Checking (AB, PH, TV), pp. 372–386.
- ICALP-2004-SeidlSMH #for free
- Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.
- CAV-1999-AbdullaABBHL #abstraction #analysis #infinity #reachability #verification
- Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis (PAA, AA, SB, AB, PH, YL), pp. 146–159.
- ICALP-1997-BouajjaniH #analysis #reachability #set
- Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (AB, PH), pp. 560–570.
- LICS-1995-BouajjaniEH #on the #problem #process #verification
- On the Verification Problem of Nonregular Properties for Nonregular Processes (AB, RE, PH), pp. 123–133.
- POPL-1995-BouajjaniEH #composition #infinity #parallel #process #verification
- Verifying Infinite State Processes with Sequential and Parallel Composition (AB, RE, PH), pp. 95–106.