Peter Habermehl

66 papers A* 10A 3B 15C 3Journal 20Unranked 13

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Data-Driven Verification of Procedural Programs with Integer Arrays. CAV (4) Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
2025	J	`jnl`	Data-driven Verification of Procedural Programs with Integer Arrays. CoRR Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
2025	—	`conf`	Enhancing Numerical Invariants Learning with Bounded Reachability Analysis. NETYS Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
2025	—	`conf`	Robust Identification of Hybrid Automata from Noisy Data. HSCC Niklas Kochdumper, Mohammed Aristide Foughali, Peter Habermehl, Eugene Asarin
2024	—	`conf`	Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) Peter Habermehl, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
2024	J	`jnl`	Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál
2023	J	`jnl`	On Presburger arithmetic extended with non-unary counting quantifiers. Log. Methods Comput. Sci. Peter Habermehl, Dietrich Kuske
2022	—	`conf`	Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CAV (1) Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
2022	J	`jnl`	Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CoRR Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
2022	J	`jnl`	On Presburger arithmetic extended with non-unary counting quantifiers. CoRR Peter Habermehl, Dietrich Kuske
2018	—	`conf`	Left-Eigenvectors Are Certificates of the Orbit Problem. RP Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem
2018	J	`jnl`	Left-eigenvectors are certificates of the Orbit Problem. CoRR Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem
2018	J	`jnl`	Realizability of concurrent recursive programs. Formal Methods Syst. Des. Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
2017	J	`jnl`	Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Int. J. Found. Comput. Sci. Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
2017	B	`conf`	Model-Checking Counting Temporal Logics on Flat Structures. CONCUR Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma
2017	J	`jnl`	Model-checking Counting Temporal Logics on Flat Structures. CoRR Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma
2017	J	`jnl`	On the path-width of integer linear programming. Inf. Comput. Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato
2016	B	`conf`	Regular Transformations of Data Words Through Origin Information. FoSSaCS Antoine Durand-Gasselin, Peter Habermehl
2015	B	`conf`	On Presburger Arithmetic Extended with Modulo Counting Quantifiers. FoSSaCS Peter Habermehl, Dietrich Kuske
2014	J	`jnl`	A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
2014	B	`conf`	Learning Transparent Data Automata. Petri Nets Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
2014	—	`conf`	On the Path-Width of Integer Linear Programming. GandALF Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato
2014	B	`conf`	Ordered Navigation on Multi-attributed Data Words. CONCUR Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
2014	J	`jnl`	Ordered Navigation on Multi-attributed Data Words. CoRR Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
2013	C	`conf`	A Fresh Approach to Learning Register Automata. Developments in Language Theory Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
2012	J	`jnl`	Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transf. Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
2012	A	`conf`	Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS Antoine Durand-Gasselin, Peter Habermehl
2012	J	`jnl`	Forest automata for verification of heap manipulation. Formal Methods Syst. Des. Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2011	A*	`conf`	Forest Automata for Verification of Heap Manipulation. CAV Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
2011	J	`jnl`	On Yen's Path Logic for Petri Nets. Int. J. Found. Comput. Sci. Mohamed Faouzi Atig, Peter Habermehl
2011	J	`jnl`	Programs with lists are counter automata. Formal Methods Syst. Des. Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar
2010	J	`jnl`	Automata-based verification of programs with tree updates. Acta Informatica Peter Habermehl, Radu Iosif, Tomás Vojnar
2010	B	`conf`	On the Use of Non-deterministic Automata for Presburger Arithmetic. CONCUR Antoine Durand-Gasselin, Peter Habermehl
2010	—	`conf`	The Downward-Closure of Petri Net Languages. ICALP (2) Peter Habermehl, Roland Meyer, Harro Wimmel
2009	A*	`conf`	Angluin-Style Learning of NFA. IJCAI Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker
2009	A*	`conf`	Automatic Verification of Integer Array Programs. CAV Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar
2009	—	`ed.`	Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems, INFINITY 2006 / 2007 / 2008, Bonn, Germany, August 26, 2006 / Lisbon, Portugal, September 8, 2007 / Toronto, Canada, August 23, 2008 INFINITY Peter Habermehl, Tomás Vojnar
2009	—	`conf`	On Yen's Path Logic for Petri Nets. RP Mohamed Faouzi Atig, Peter Habermehl
2009	—	`conf`	Preface. INFINITY Peter Habermehl, Tomás Vojnar
2009	B	`conf`	Realizability of Concurrent Recursive Programs. FoSSaCS Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
2008	B	`conf`	A Logic of Singly Indexed Arrays. LPAR Peter Habermehl, Radu Iosif, Tomás Vojnar
2008	C	`conf`	Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. CIAA Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar
2008	C	`conf`	Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
2008	J	`jnl`	Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods Syst. Des. Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
2008	B	`conf`	What Else Is Decidable about Integer Arrays?. FoSSaCS Peter Habermehl, Radu Iosif, Tomás Vojnar
2007	B	`conf`	Proving Termination of Tree Manipulating Programs. ATVA Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
2007	B	`conf`	Rewriting Systems with Data. FCT Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu
2006	B	`conf`	Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. SAS Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
2006	A	`conf`	Automata-Based Verification of Programs with Tree Updates. TACAS Peter Habermehl, Radu Iosif, Tomás Vojnar
2006	A*	`conf`	Programs with Lists Are Counter Automata. CAV Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar
2005	—	`conf`	Abstract Regular Tree Model Checking. INFINITY Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
2005	A	`conf`	Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. TACAS Ahmed Bouajjani, Peter Habermehl, Pierre Moro, Tomás Vojnar
2004	A*	`conf`	Abstract Regular Model Checking. CAV Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
2004	A*	`conf`	Counting in Trees for Free. ICALP Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
2004	—	`conf`	Regular Model Checking Using Inference of Regular Languages. INFINITY Peter Habermehl, Tomás Vojnar
2003	J	`jnl`	Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. Ahmed Bouajjani, Peter Habermehl, Richard Mayr
2003	B	`conf`	Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. CONCUR Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
2001	B	`conf`	Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS Ahmed Bouajjani, Peter Habermehl, Richard Mayr
1999	J	`jnl`	Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Theor. Comput. Sci. Ahmed Bouajjani, Peter Habermehl
1999	A*	`conf`	Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. CAV Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, Yassine Lakhnech
1998	—	`—`	Sur la vérification de systèmes infinis. (On the verification of infinite-state systems). Peter Habermehl
1997	—	`conf`	On the Complexity of the Linear-Time mu -calculus for Petri-Nets. ICATPN Peter Habermehl
1997	A*	`conf`	Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). ICALP Ahmed Bouajjani, Peter Habermehl
1996	B	`conf`	Constrained Properties, Semilinear Systems, and Petri Nets. CONCUR Ahmed Bouajjani, Peter Habermehl
1995	A*	`conf`	On the Verification Problem of Nonregular Properties for Nonregular Processes LICS Ahmed Bouajjani, Rachid Echahed, Peter Habermehl
1995	A*	`conf`	Verifying Infinite State Processes with Sequential and Parallel Composition. POPL Ahmed Bouajjani, Rachid Echahed, Peter Habermehl