Andreas Podelski

231 papers A* 27A 31B 46C 6Journal 50Unranked 65

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	A Practical and Complete Method for Detecting rt-Inconsistencies in Real-Time Requirements. REFSQ Nico Hauff, Elisabeth Henkel, Elisabeth Fünfgeld, Vincent Langenfeld, Andreas Podelski
2026	B	`conf`	Automata-Represented Requirements in HanforPL - A Visual Approach for Requirements Engineering Practice and Formal Reasoning. REFSQ Tobias Kolzer, Vincent Langenfeld, Nico Hauff, Elisabeth Henkel, Andreas Podelski
2026	B	`conf`	Provably Relevant HAL Interface Requirements for Embedded Systems. REFSQ Manuel Bentele, Andreas Podelski, Axel Sikora, Bernd Westphal
2026	—	`conf`	Ultimate Automizer with a One-Dimensional Memory Model - (Competition Contribution). TACAS (2) Manuel Bentele, Max Barth, Marcel Ebbinghaus, Jan Körner, Daniel Dietsch, Matthias Heizmann, Dominik Klumpp, Frank Schüssele, Andreas Podelski
2025	J	`jnl`	Checking the HAL Interface Specification Continuously, Right from the Start. CoRR Manuel Bentele, Onur Altinordu, Jan Körner, Andreas Podelski, Axel Sikora
2025	—	`conf`	Counterexample-Guided Commutativity. CAV (3) Marcel Ebbinghaus, Dominik Klumpp, Andreas Podelski
2025	—	`conf`	Hanfor: Requirements Formalisation and Beyond. REFSQ Workshops Nico Hauff, Elisabeth Henkel, Tobias Kolzer, Vincent Langenfeld, Andreas Podelski
2025	J	`jnl`	Relevant HAL Interface Requirements for Embedded Systems. CoRR Manuel Bentele, Andreas Podelski, Axel Sikora, Bernd Westphal
2025	J	`jnl`	Temporal HAL-API Dependencies as a Gateway to Formal Embedded Software Development. CoRR Manuel Bentele, Andreas Podelski, Axel Sikora, Bernd Westphal
2024	J	`jnl`	Commutativity Simplifies Proofs of Parameterized Programs. Proc. ACM Program. Lang. Azadeh Farzan, Dominik Klumpp, Andreas Podelski
2024	A	`conf`	Scalable Redundancy Detection for Real-Time Requirements. RE Elisabeth Henkel, Nico Hauff, Lena Funk, Vincent Langenfeld, Andreas Podelski
2024	J	`jnl`	Systematic adaptation and investigation of the understandability of a formal pattern language. Requir. Eng. Elisabeth Henkel, Nico Hauff, Vincent Langenfeld, Lukas Eber, Andreas Podelski
2024	—	`conf`	Ultimate Automizer and the Abstraction of Bitwise Operations - (Competition Contribution). TACAS (3) Frank Schüssele, Manuel Bentele, Daniel Dietsch, Matthias Heizmann, Xinyu Jiang, Dominik Klumpp, Andreas Podelski
2023	B	`conf`	An Empirical Study of the Intuitive Understanding of a Formal Pattern Language. REFSQ Elisabeth Henkel, Nico Hauff, Lukas Eber, Vincent Langenfeld, Andreas Podelski
2023	J	`jnl`	Commutativity Simplifies Proofs of Parameterized Programs. CoRR Azadeh Farzan, Dominik Klumpp, Andreas Podelski
2023	J	`jnl`	Stratified Commutativity in Verification Algorithms for Concurrent Programs. Proc. ACM Program. Lang. Azadeh Farzan, Dominik Klumpp, Andreas Podelski
2023	—	`conf`	Ultimate Automizer and the CommuHash Normal Form - (Competition Contribution). TACAS (2) Matthias Heizmann, Max Barth, Daniel Dietsch, Leonard Fichtner, Jochen Hoenicke, Dominik Klumpp, Mehdi Naouar, Tanja Schindler, Frank Schüssele, Andreas Podelski
2023	—	`conf`	Ultimate Taipan and Race Detection in Ultimate - (Competition Contribution). TACAS (2) Daniel Dietsch, Matthias Heizmann, Dominik Klumpp, Frank Schüssele, Andreas Podelski
2022	J	`jnl`	Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version). Inf. Comput. Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Andreas Podelski, Christian Schilling
2022	—	`conf`	Software Model Checking: 20 Years and Beyond. Principles of Systems Design Dirk Beyer, Andreas Podelski
2022	A*	`conf`	Sound sequentialization for concurrent program verification. PLDI Azadeh Farzan, Dominik Klumpp, Andreas Podelski
2022	—	`conf`	Ultimate GemCutter and the Axes of Generalization - (Competition Contribution). TACAS (2) Dominik Klumpp, Daniel Dietsch, Matthias Heizmann, Frank Schüssele, Marcel Ebbinghaus, Azadeh Farzan, Andreas Podelski
2021	B	`conf`	A Formal Operational Model of ACT-R: Structure and Behaviour. CogSci Vincent Langenfeld, Bernd Westphal, Andreas Podelski
2021	—	`conf`	Hanfor: Semantic Requirements Review at Scale. REFSQ Workshops Samuel Becker, Daniel Dietsch, Nico Hauff, Elisabeth Henkel, Vincent Langenfeld, Andreas Podelski, Bernd Westphal
2021	—	`conf`	Separating Map Variables in a Logic-Based Intermediate Verification Language. NETYS Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski
2021	J	`jnl`	Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems. CoRR Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham
2021	J	`jnl`	Temporal prophecy for proving temporal properties of infinite-state systems. Formal Methods Syst. Des. Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham
2021	B	`conf`	Verification of Concurrent Programs Using Petri Net Unfoldings. VMCAI Daniel Dietsch, Matthias Heizmann, Dominik Klumpp, Mehdi Naouar, Andreas Podelski, Claus Schätzle
2019	J	`jnl`	Different Maps for Different Uses. A Program Transformation for Intermediate Verification Languages. CoRR Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski
2019	—	`ed.`	Networked Systems - 6th International Conference, NETYS 2018, Essaouira, Morocco, May 9-11, 2018, Revised Selected Papers NETYS Andreas Podelski, François Taïani
2019	B	`conf`	On Formal Verification of ACT-R Architectures and Models. CogSci Vincent Langenfeld, Bernd Westphal, Andreas Podelski
2019	A*	`conf`	Temporal Planning as Refinement-Based Model Checking. ICAPS Alexander Heinz, Martin Wehrle, Sergiy Bogomolov, Daniele Magazzeni, Marius Greitschus, Andreas Podelski
2019	—	`conf`	Ultimate TreeAutomizer (CHC-COMP Tool Description). HCVS/PERR@ETAPS Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski
2018	—	`conf`	A Tree-Based Approach to Data Flow Proofs. VSTTE Jochen Hoenicke, Alexander Nutz, Andreas Podelski
2018	B	`conf`	But does it really do that? Using formal analysis to ensure desirable ACT-R model behaviour. CogSci Vincent Langenfeld, Bernd Westphal, Rebecca Albrecht, Andreas Podelski
2018	—	`ch.`	Predicate Abstraction for Program Verification. Handbook of Model Checking Ranjit Jhala, Andreas Podelski, Andrey Rybalchenko
2018	—	`conf`	Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices. HSCC Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Frédéric Viry, Andreas Podelski, Christian Schilling
2018	J	`jnl`	Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices. CoRR Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Andreas Podelski, Christian Schilling, Frédéric Viry
2018	J	`jnl`	Reducing liveness to safety in first-order logic. Proc. ACM Program. Lang. Oded Padon, Jochen Hoenicke, Giuliano Losa, Andreas Podelski, Mooly Sagiv, Sharon Shoham
2018	B	`ed.`	Static Analysis - 25th International Symposium, SAS 2018, Freiburg, Germany, August 29-31, 2018, Proceedings SAS Andreas Podelski
2018	B	`conf`	Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems. FMCAD Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham
2018	—	`conf`	The Map Equality Domain. VSTTE Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski
2018	—	`conf`	Ultimate Automizer and the Search for Perfect Interpolants - (Competition Contribution). TACAS (2) Matthias Heizmann, Yu-Fang Chen, Daniel Dietsch, Marius Greitschus, Jochen Hoenicke, Yong Li, Alexander Nutz, Betim Musa, Christian Schilling, Tanja Schindler, Andreas Podelski
2018	—	`conf`	Ultimate Taipan with Dynamic Block Encoding - (Competition Contribution). TACAS (2) Daniel Dietsch, Marius Greitschus, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski, Christian Schilling, Tanja Schindler
2017	—	`conf`	Craig vs. Newton in software model checking. ESEC/SIGSOFT FSE Daniel Dietsch, Matthias Heizmann, Betim Musa, Alexander Nutz, Andreas Podelski
2017	B	`conf`	Loop Invariants from Counterexamples. SAS Marius Greitschus, Daniel Dietsch, Andreas Podelski
2017	J	`jnl`	Refining Trace Abstraction using Abstract Interpretation. CoRR Marius Greitschus, Daniel Dietsch, Andreas Podelski
2017	A*	`conf`	Thread modularity at many levels: a pearl in compositional verification. POPL Jochen Hoenicke, Rupak Majumdar, Andreas Podelski
2017	—	`conf`	Ultimate Automizer with an On-Demand Construction of Floyd-Hoare Automata - (Competition Contribution). TACAS (2) Matthias Heizmann, Yu-Wen Chen, Daniel Dietsch, Marius Greitschus, Alexander Nutz, Betim Musa, Claus Schätzle, Christian Schilling, Frank Schüssele, Andreas Podelski
2017	—	`conf`	Ultimate Taipan: Trace Abstraction and Abstract Interpretation - (Competition Contribution). TACAS (2) Marius Greitschus, Daniel Dietsch, Matthias Heizmann, Alexander Nutz, Claus Schätzle, Christian Schilling, Frank Schüssele, Andreas Podelski
2016	J	`jnl`	A Logical Approach to Generating Test Plans. CoRR Tobias Morciniec, Andreas Podelski
2016	J	`jnl`	Adaptive moment closure for parameter inference of biochemical reaction networks. Biosyst. Christian Schilling, Sergiy Bogomolov, Thomas A. Henzinger, Andreas Podelski, Jakob Ruess
2016	—	`conf`	Classifying Bugs with Interpolants. TAP@STAF Andreas Podelski, Martin Schäf, Thomas Wies
2016	J	`jnl`	Guided search for hybrid systems based on coarse-grained space abstractions. Int. J. Softw. Tools Technol. Transf. Sergiy Bogomolov, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor T. Johnson, Hamed Ladan, Andreas Podelski, Martin Wehrle
2016	A*	`conf`	Proving Liveness of Parameterized Programs. LICS Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2016	J	`jnl`	Proving Liveness of Parameterized Programs. CoRR Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2016	J	`jnl`	Ready for testing: ensuring conformance to industrial standards through formal verification. Formal Aspects Comput. Sergio Feo-Arenis, Bernd Westphal, Daniel Dietsch, Marco Muñiz, Ahmad Siyar Andisha, Andreas Podelski
2016	B	`conf`	Requirements Defects over a Project Lifetime: An Empirical Analysis of Defect Data from a 5-Year Automotive Project at Bosch. REFSQ Vincent Langenfeld, Amalinda Post, Andreas Podelski
2016	A	`conf`	Ultimate Automizer with Two-track Proofs - (Competition Contribution). TACAS Matthias Heizmann, Daniel Dietsch, Marius Greitschus, Jan Leike, Betim Musa, Claus Schätzle, Andreas Podelski
2015	—	`conf`	Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks. CMSB Sergiy Bogomolov, Thomas A. Henzinger, Andreas Podelski, Jakob Ruess, Christian Schilling
2015	C	`conf`	Automated Program Verification. LATA Azadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski
2015	—	`conf`	Eliminating spurious transitions in reachability with support functions. HSCC Goran Frehse, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, Andreas Podelski
2015	—	`conf`	Fairness Modulo Theory: A New Approach to LTL Software Model Checking. CAV (1) Daniel Dietsch, Matthias Heizmann, Vincent Langenfeld, Andreas Podelski
2015	—	`conf`	Fairness for Infinitary Control. Correct System Design Jochen Hoenicke, Andreas Podelski
2015	A	`conf`	If A Fails, Can B Still Succeed? Inferring Dependencies between Test Results in Automotive System Testing. ICST Stephan Arlt, Tobias Morciniec, Andreas Podelski, Silke Wagner
2015	A*	`conf`	Proof Spaces for Unbounded Parallelism. POPL Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2015	—	`conf`	System Testing and Program Verification. Software Engineering & Management Stephan Arlt, Sergio Feo-Arenis, Andreas Podelski, Martin Wehrle
2015	A	`conf`	ULTIMATE KOJAK with Memory Safety Checks - (Competition Contribution). TACAS Alexander Nutz, Daniel Dietsch, Mostafa Mahmoud Mohamed, Andreas Podelski
2015	A	`conf`	Ultimate Automizer with Array Interpolation - (Competition Contribution). TACAS Matthias Heizmann, Daniel Dietsch, Jan Leike, Betim Musa, Andreas Podelski
2015	A	`conf`	Using the requirements specification to infer the implicit test status of requirements. RE Tobias Morciniec, Andreas Podelski
2014	—	`conf`	Assume-Guarantee Abstraction Refinement Meets Hybrid Systems. Haifa Verification Conference Sergiy Bogomolov, Goran Frehse, Marius Greitschus, Radu Grosu, Corina S. Pasareanu, Andreas Podelski, Thomas Strump
2014	J	`jnl`	Linear Ranking for Linear Lasso Programs. CoRR Matthias Heizmann, Jochen Hoenicke, Jan Leike, Andreas Podelski
2014	A*	`conf`	Planning as Model Checking in Hybrid Domains. AAAI Sergiy Bogomolov, Daniele Magazzeni, Andreas Podelski, Martin Wehrle
2014	A*	`conf`	Proofs that count. POPL Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2014	A	`conf`	Quasi-Equal Clock Reduction: More Networks, More Queries. TACAS Christian Herrera, Bernd Westphal, Andreas Podelski
2014	—	`conf`	Quasi-dependent variables in hybrid automata. HSCC Sergiy Bogomolov, Christian Herrera, Marco Muñiz, Bernd Westphal, Andreas Podelski
2014	A	`conf`	Reducing GUI test suites via program slicing. ISSTA Stephan Arlt, Andreas Podelski, Martin Wehrle
2014	A*	`conf`	Termination Analysis by Learning Terminating Programs. CAV Matthias Heizmann, Jochen Hoenicke, Andreas Podelski
2014	J	`jnl`	Termination Analysis by Learning Terminating Programs. CoRR Matthias Heizmann, Jochen Hoenicke, Andreas Podelski
2014	A	`conf`	Ultimate Automizer with Unsatisfiable Cores - (Competition Contribution). TACAS Matthias Heizmann, Jürgen Christ, Daniel Dietsch, Jochen Hoenicke, Markus Lindenmann, Betim Musa, Christian Schilling, Stefan Wissert, Andreas Podelski
2014	A	`conf`	Ultimate Kojak - (Competition Contribution). TACAS Evren Ermis, Alexander Nutz, Daniel Dietsch, Jochen Hoenicke, Andreas Podelski
2014	—	`conf`	Verification of GUI Applications: A Black-Box Approach. ISoLA (1) Stephan Arlt, Evren Ermis, Sergio Feo-Arenis, Andreas Podelski
2013	—	`conf`	Abstraction-Based Guided Search for Hybrid Systems. SPIN Sergiy Bogomolov, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor T. Johnson, Hamed Ladan, Andreas Podelski, Martin Wehrle
2013	B	`conf`	Automata as Proofs. VMCAI Andreas Podelski
2013	—	`conf`	Detecting Quasi-equal Clocks in Timed Automata. FORMATS Marco Muñiz, Bernd Westphal, Andreas Podelski
2013	A*	`conf`	Inductive data flow graphs. POPL Azadeh Farzan, Zachary Kincaid, Andreas Podelski
2013	B	`conf`	Linear Ranking for Linear Lasso Programs. ATVA Matthias Heizmann, Jochen Hoenicke, Jan Leike, Andreas Podelski
2013	J	`jnl`	Monitoring Student Activity in Collaborative Software Development CoRR Daniel Dietsch, Andreas Podelski, Jaechang Nam, Pantelis M. Papadopoulos, Martin Schäf
2013	—	`conf`	Push-Down Automata with Gap-Order Constraints. FSEN Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Andreas Podelski
2013	A*	`conf`	Software Model Checking for People Who Love Automata. CAV Matthias Heizmann, Jochen Hoenicke, Andreas Podelski
2013	A	`conf`	Ultimate Automizer with SMTInterpol - (Competition Contribution). TACAS Matthias Heizmann, Jürgen Christ, Daniel Dietsch, Evren Ermis, Jochen Hoenicke, Markus Lindenmann, Alexander Nutz, Christian Schilling, Andreas Podelski
2012	A*	`conf`	A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx. CAV Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski, Martin Wehrle
2012	J	`jnl`	Automotive behavioral requirements expressed in a specification pattern system: a case study at BOSCH. Requir. Eng. Amalinda Post, Igor Menzel, Jochen Hoenicke, Andreas Podelski
2012	J	`jnl`	Black-Box Verification for GUI Applications CoRR Stephan Arlt, Evren Ermis, Sergio Feo-Arenis, Andreas Podelski
2012	B	`conf`	Interpolant Automata - (Invited Talk). ATVA Andreas Podelski
2012	A	`conf`	Lightweight Static Analysis for GUI Testing. ISSRE Stephan Arlt, Andreas Podelski, Cristiano Bertolini, Martin Schäf, Ishan Banerjee, Atif M. Memon
2012	C	`conf`	Parameterized GUI Tests. ICTSS Stephan Arlt, Pedro Borromeo, Martin Schäf, Andreas Podelski
2012	—	`conf`	Reducing Quasi-Equal Clocks in Networks of Timed Automata. FORMATS Christian Herrera, Bernd Westphal, Sergio Feo-Arenis, Marco Muñiz, Andreas Podelski
2012	B	`conf`	Splitting via Interpolants. VMCAI Evren Ermis, Jochen Hoenicke, Andreas Podelski
2012	—	`conf`	Timed Automata with Disjoint Activity. FORMATS Marco Muñiz, Bernd Westphal, Andreas Podelski
2012	—	`conf`	Towards successful subcontracting for software in small to medium-sized enterprises. RELAW Bernd Westphal, Daniel Dietsch, Sergio Feo-Arenis, Andreas Podelski, Louis Pahlow, Jochen Morsbach, Barbara Sommer, Anke Fuchs, Christine Meierhöfer
2012	—	`ed.`	Verified Software: Theories, Tools, Experiments - 4th International Conference, VSTTE 2012, Philadelphia, PA, USA, January 28-29, 2012. Proceedings VSTTE Rajeev Joshi, Peter Müller, Andreas Podelski
2011	B	`conf`	Applying Restricted English Grammar on Automotive Requirements - Does it Work? A Case Study. REFSQ Amalinda Post, Igor Menzel, Andreas Podelski
2011	J	`jnl`	Automatische Validierung von Anforderungen. Softwaretechnik-Trends Amalinda Post, Andreas Podelski
2011	—	`conf`	Composing Stability Proofs for Hybrid Systems. FORMATS Corina Mitrohin, Andreas Podelski
2011	A	`conf`	Disambiguation of industrial standards through formalization and graphical languages. RE Daniel Dietsch, Sergio Feo-Arenis, Bernd Westphal, Andreas Podelski
2011	J	`jnl`	Proving program termination. Commun. ACM Byron Cook, Andreas Podelski, Andrey Rybalchenko
2011	B	`conf`	System Verification through Program Verification. FM Daniel Dietsch, Bernd Westphal, Andreas Podelski
2011	A	`conf`	Transition Invariants and Transition Predicate Abstraction for Program Termination. TACAS Andreas Podelski, Andrey Rybalchenko
2011	A	`conf`	Vacuous real-time requirements. RE Amalinda Post, Jochen Hoenicke, Andreas Podelski
2011	B	`conf`	rt-Inconsistency: A New Property for Real-Time Requirements. FASE Amalinda Post, Jochen Hoenicke, Andreas Podelski
2010	B	`conf`	Composing Reachability Analyses of Hybrid Systems for Safety and Stability. ATVA Sergiy Bogomolov, Corina Mitrohin, Andreas Podelski
2010	A*	`conf`	Counterexample-guided focus. POPL Andreas Podelski, Thomas Wies
2010	J	`jnl`	Doomed program points. Formal Methods Syst. Des. Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies
2010	—	`conf`	Explicit Fair Scheduling for Dynamic Control. Concurrency, Compositionality, and Correctness Ernst-Rüdiger Olderog, Andreas Podelski
2010	A	`conf`	Fairness for Dynamic Control. TACAS Jochen Hoenicke, Ernst-Rüdiger Olderog, Andreas Podelski
2010	A*	`conf`	Nested interpolants. POPL Matthias Heizmann, Jochen Hoenicke, Andreas Podelski
2010	—	`conf`	Shape-based Barrier Estimation for RNAs. GCB Sergiy Bogomolov, Martin Mann, Björn Voß, Andreas Podelski, Rolf Backofen
2010	B	`conf`	Size-Change Termination and Transition Invariants. SAS Matthias Heizmann, Neil D. Jones, Andreas Podelski
2010	B	`conf`	Thread-Modular Counterexample-Guided Abstraction Refinement. SAS Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
2009	B	`conf`	Abstraction Refinement for Quantified Array Assertions. SAS Mohamed Nassim Seghir, Andreas Podelski, Thomas Wies
2009	J	`jnl`	Directed model checking with distance-preserving abstractions. Int. J. Softw. Tools Technol. Transf. Klaus Dräger, Bernd Finkbeiner, Andreas Podelski
2009	B	`conf`	It's Doomed; We Can Prove It. FM Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies
2009	B	`conf`	Refinement of Trace Abstraction. SAS Matthias Heizmann, Jochen Hoenicke, Andreas Podelski
2009	J	`jnl`	Summarization for termination: no return! Formal Methods Syst. Des. Byron Cook, Andreas Podelski, Andrey Rybalchenko
2009	A	`conf`	Transition-Based Directed Model Checking. TACAS Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski
2008	A*	`conf`	Faster Than Uppaal? CAV Sebastian Kupferschmid, Martin Wehrle, Bernhard Nebel, Andreas Podelski
2008	A*	`conf`	Heap Assumptions on Demand. CAV Andreas Podelski, Andrey Rybalchenko, Thomas Wies
2008	B	`conf`	Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? VMCAI Rayna Dimitrova, Andreas Podelski
2008	A*	`conf`	Useless Actions Are Useful. ICAPS Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski
2008	—	`conf`	Verification, Least-Fixpoint Checking, Abstraction. VSTTE Andreas Podelski
2007	—	`conf`	A Sound and Complete Proof Rule for Region Stability of Hybrid Systems. HSCC Andreas Podelski, Silke Wagner
2007	—	`conf`	ACSAR: Software Model Checking with Transfinite Refinement. SPIN Mohamed Nassim Seghir, Andreas Podelski
2007	C	`conf`	ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. PADL Andreas Podelski, Andrey Rybalchenko
2007	B	`conf`	Precise Thread-Modular Verification. SAS Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
2007	C	`ed.`	Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 14-16, 2007, Wroclaw, Poland PPDP Michael Leuschel, Andreas Podelski
2007	A*	`conf`	Proving that programs eventually do something good. POPL Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Y. Vardi
2007	A*	`conf`	Proving thread termination. PLDI Byron Cook, Andreas Podelski, Andrey Rybalchenko
2007	—	`conf`	Region Stability Proofs for Hybrid Systems. FORMATS Andreas Podelski, Silke Wagner
2007	J	`jnl`	SFB/TR 14 AVACS - Automatic Verification and Analysis of Complex Systems (Der Sonderforschungsbereich/Transregio 14 AVACS - Automatische Verifikation und Analyse komplexer Systeme). it Inf. Technol. Bernd Becker, Andreas Podelski, Werner Damm, Martin Fränzle, Ernst-Rüdiger Olderog, Reinhard Wilhelm
2007	J	`jnl`	Transition predicate abstraction and fair termination. ACM Trans. Program. Lang. Syst. Andreas Podelski, Andrey Rybalchenko
2007	A	`conf`	Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking. TACAS Sebastian Kupferschmid, Klaus Dräger, Jörg Hoffmann, Bernd Finkbeiner, Henning Dierks, Andreas Podelski, Gerd Behrmann
2007	B	`ed.`	Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings VMCAI Byron Cook, Andreas Podelski
2006	—	`conf`	Directed Model Checking with Distance-Preserving Abstractions. SPIN Klaus Dräger, Bernd Finkbeiner, Andreas Podelski
2006	B	`conf`	Field Constraint Analysis. VMCAI Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin C. Rinard
2006	—	`conf`	Model Checking of Hybrid Systems: From Reachability Towards Stability. HSCC Andreas Podelski, Silke Wagner
2006	J	`jnl`	On Verifying Complex Properties using Symbolic Shape Analysis CoRR Thomas Wies, Viktor Kuncak, Karen Zee, Andreas Podelski, Martin C. Rinard
2006	A*	`conf`	Termination proofs for systems code. PLDI Byron Cook, Andreas Podelski, Andrey Rybalchenko
2006	A*	`conf`	Terminator: Beyond Safety. CAV Byron Cook, Andreas Podelski, Andrey Rybalchenko
2006	C	`conf`	Thread-Modular Verification Is Cartesian Abstract Interpretation. ICTAC Alexander Malkis, Andreas Podelski, Andrey Rybalchenko
2006	J	`jnl`	Tools and algorithms for the construction and analysis of systems. Int. J. Softw. Tools Technol. Transf. Kurt Jensen, Andreas Podelski
2006	—	`conf`	Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL. MoChArt Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski
2005	B	`conf`	Abstraction Refinement for Termination. SAS Byron Cook, Andreas Podelski, Andrey Rybalchenko
2005	B	`conf`	Boolean Heaps. SAS Andreas Podelski, Thomas Wies
2005	A	`conf`	Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems. TACAS Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
2005	J	`jnl`	Special issue. Theor. Comput. Sci. Kurt Jensen, Andreas Podelski
2005	A	`conf`	Summaries for While Programs with Recursion. ESOP Andreas Podelski, Ina Schaefer, Silke Wagner
2005	A*	`conf`	Transition predicate abstraction and fair termination. POPL Andreas Podelski, Andrey Rybalchenko
2005	J	`jnl`	Verification of cryptographic protocols: tagging enforces termination. Theor. Comput. Sci. Bruno Blanchet, Andreas Podelski
2004	B	`conf`	A Complete Method for the Synthesis of Linear Ranking Functions. VMCAI Andreas Podelski, Andrey Rybalchenko
2004	A	`conf`	Constraints in Program Analysis and Verification. CP Andreas Podelski
2004	J	`jnl`	Introduction to the Special Issue on Verification and Computational Logic. Theory Pract. Log. Program. Michael Leuschel, Andreas Podelski, C. R. Ramakrishnan, Ulrich Ultes-Nitsche
2004	A	`ed.`	Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings TACAS Kurt Jensen, Andreas Podelski
2004	A*	`conf`	Transition Invariants. LICS Andreas Podelski, Andrey Rybalchenko
2003	J	`jnl`	Boolean and Cartesian abstraction for model checking C programs. Int. J. Softw. Tools Technol. Transf. Thomas Ball, Andreas Podelski, Sriram K. Rajamani
2003	B	`conf`	Software Model Checking with Abstraction Refinement. VMCAI Andreas Podelski
2003	B	`conf`	Verification of Cryptographic Protocols: Tagging Enforces Termination. FoSSaCS Bruno Blanchet, Andreas Podelski
2002	—	`conf`	An Algebraic Framework for Abstract Model Checking. SARA Supratik Mukhopadhyay, Andreas Podelski
2002	B	`conf`	Compositional Termination Analysis of Symbolic Forward Analysis. VMCAI Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski
2002	B	`conf`	Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP. ICLP Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski
2002	A	`conf`	Relative Completeness of Abstraction Refinement for Software Model Checking. TACAS Thomas Ball, Andreas Podelski, Sriram K. Rajamani
2002	J	`jnl`	Set Constraints with Intersection. Inf. Comput. Witold Charatonik, Andreas Podelski
2001	—	`conf`	Accurate Widenings and Boundedness Properties of Timed Systems. Ershov Memorial Conference Supratik Mukhopadhyay, Andreas Podelski
2001	A	`conf`	Boolean and Cartesian Abstraction for Model Checking C Programs. TACAS Thomas Ball, Andreas Podelski, Sriram K. Rajamani
2001	C	`conf`	Constraint Database Models Characterizing Timed Bisimilarity. PADL Supratik Mukhopadhyay, Andreas Podelski
2001	J	`jnl`	Constraint-based deductive model checking. Int. J. Softw. Tools Technol. Transf. Giorgio Delzanno, Andreas Podelski
2001	B	`conf`	Model Checking Communication Protocols. SOFSEM Pablo Argón, Giorgio Delzanno, Supratik Mukhopadhyay, Andreas Podelski
2000	A*	`conf`	Efficient Algorithms for pre POPL Javier Esparza, Andreas Podelski
2000	B	`conf`	Model Checking as Constraint Solving. SAS Andreas Podelski
2000	—	`conf`	Model Checking for Timed Logic Processes. Computational Logic Supratik Mukhopadhyay, Andreas Podelski
2000	J	`jnl`	Ordering Constraints over Feature Trees. Constraints An Int. J. Martin Müller, Joachim Niehren, Andreas Podelski
2000	A*	`conf`	Paths vs. Trees in Set-Based Program Analysis. POPL Witold Charatonik, Andreas Podelski, Jean-Marc Talbot
1999	—	`conf`	Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. FSTTCS Supratik Mukhopadhyay, Andreas Podelski
1999	B	`conf`	Constraint-Based Analysis of Broadcast Protocols. CSL Giorgio Delzanno, Javier Esparza, Andreas Podelski
1999	A	`conf`	Model Checking in CLP. TACAS Giorgio Delzanno, Andreas Podelski
1999	A	`conf`	Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs. ESOP Andreas Podelski, Witold Charatonik, Martin Müller
1999	—	`conf`	Verification of Infinite-State Systems in Constraint Logic Programming. JFPLC Giorgio Delzanno, Andreas Podelski
1998	—	`conf`	Co-definite Set Constraints. RTA Witold Charatonik, Andreas Podelski
1998	B	`conf`	Directional Type Inference for Logic Programs. SAS Witold Charatonik, Andreas Podelski
1998	A	`conf`	Set-Based Analysis of Reactive Infinite-State Systems. TACAS Witold Charatonik, Andreas Podelski
1998	A*	`conf`	The Horn Mu-calculus. LICS Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz
1997	—	`conf`	Inclusion Constraints over Non-empty Sets of Trees. TAPSOFT Martin Müller, Joachim Niehren, Andreas Podelski
1997	B	`conf`	LISA: A Specification Language Based on WS2S. CSL Abdelwaheb Ayari, David A. Basin, Andreas Podelski
1997	J	`jnl`	Minimal Ascending and Descending Tree Automata. SIAM J. Comput. Maurice Nivat, Andreas Podelski
1997	J	`jnl`	Order Sorted Feature Theory Unification. J. Log. Program. Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein
1997	A	`conf`	Ordering Constraints over Feature Trees. CP Martin Müller, Joachim Niehren, Andreas Podelski
1997	A*	`conf`	Set Constraints with Intersection. LICS Witold Charatonik, Andreas Podelski
1997	A	`conf`	Set Constraints: A Pearl in Research on Constraints. CP Leszek Pacholski, Andreas Podelski
1997	—	`conf`	Set-Based Analysis of Logic Programs and Reactive Logic Programs (Abstract). ILPS Andreas Podelski
1997	J	`jnl`	Situated Simplification. Theor. Comput. Sci. Andreas Podelski, Gert Smolka
1996	A	`conf`	The Independence Property of a Class of Set Constraints. CP Witold Charatonik, Andreas Podelski
1995	—	`conf`	A Detailed Algorithm Testing Guards over Feature Trees. Constraint Processing, Selected Papers Andreas Podelski, Peter Van Roy
1995	—	`ed.`	Constraint Programming: Basics and Trends, Châtillon Spring School, Châtillon-sur-Seine, France, May 16 - 20, 1994, Selected Papers Constraint Programming Andreas Podelski
1995	B	`conf`	Operational Semantics of Constraint Logic Programs with Coroutining. ICLP Andreas Podelski, Gert Smolka
1995	A	`conf`	Situated Simplification. CP Andreas Podelski, Gert Smolka
1995	B	`conf`	Situated Simplification. ICLP Andreas Podelski, Gert Smolka
1994	J	`jnl`	A Feature Constraint System for Logic Programming with Entailment. Theor. Comput. Sci. Hassan Aït-Kaci, Andreas Podelski, Gert Smolka
1994	J	`jnl`	Functions as Passive Constraints in LIFE. ACM Trans. Program. Lang. Syst. Hassan Aït-Kaci, Andreas Podelski
1994	J	`jnl`	Rabin Tree Automata and Finite Monoids. Theor. Comput. Sci. Danièle Beauquier, Andreas Podelski
1994	—	`conf`	The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees. ILPS Andreas Podelski, Peter Van Roy
1993	—	`conf`	An Informal Introduction to LIFE. ICLP Workshop on Concurrent Constraint Programming Hassan Aït-Kaci, Andreas Podelski, Peter Van Roy
1993	J	`jnl`	Another variation on the common subexpression problem. Discret. Math. Maurice Nivat, Andreas Podelski
1993	B	`conf`	Entailment and Disentailment of Order-Sorted Feature Constraints. LPAR Hassan Aït-Kaci, Andreas Podelski
1993	—	`conf`	Entailment and Disentailment of Order-Sorted Feature Constraints. PPCP Hassan Aït-Kaci, Andreas Podelski
1993	—	`conf`	Equational and Membership Constraints for Finite Trees. RTA Joachim Niehren, Andreas Podelski, Ralf Treinen
1993	—	`conf`	Feature Automata and Recognizable Sets of Feature Trees. TAPSOFT Joachim Niehren, Andreas Podelski
1993	—	`conf`	Order-Sorted Feature Theory Unification. ICLP Workshop on Concurrent Constraint Programming Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein
1993	—	`conf`	Order-Sorted Feature Theory Unification. ILPS Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein
1993	B	`conf`	Rabin Tree Automata and Finite Monoids. MFCS Danièle Beauquier, Andreas Podelski
1993	—	`conf`	The Beauty and the Beast Algorithm. ILPS Andreas Podelski, Peter Van Roy
1993	—	`conf`	The Beauty and the Beast Algorithm: Testing Entailment and Disentailment Incrementally. ICLP Workshop on Concurrent Constraint Programming Andreas Podelski, Peter Van Roy
1993	J	`jnl`	Towards a Meaning of LIFE. J. Log. Program. Hassan Aït-Kaci, Andreas Podelski
1993	B	`conf`	Ultimately Periodic Words of Rational MFPS Hugues Calbrix, Maurice Nivat, Andreas Podelski
1992	—	`conf`	A Feature-Based Constraint System for Logic Programming with Entailment. FGCS Hassan Aït-Kaci, Andreas Podelski, Gert Smolka
1992	—	`ch.`	A monoid approach to tree automata. Tree Automata and Languages Andreas Podelski
1992	—	`conf`	Logic Programming with Functions over Order-Sorted Feature Terms. ELP Hassan Aït-Kaci, Andreas Podelski
1992	A*	`conf`	On Reverse and General Definite Tree Languages (Extended Abstract). ICALP Pierre Péladeau, Andreas Podelski
1992	—	`book`	Tree Automata and Languages. Maurice Nivat, Andreas Podelski
1991	J	`jnl`	A Geometrical View of the Determinization and Minimization of Finite-State Automata. Math. Syst. Theory Bruno Courcelle, Damian Niwinski, Andreas Podelski
1991	—	`conf`	Towards a Meaning of LIFE. PLILP Hassan Aït-Kaci, Andreas Podelski
1989	J	`jnl`	Definite tree languages. Bull. EATCS Maurice Nivat, Andreas Podelski