![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Andreas Podelski
Person information
- affiliation: University of Freiburg
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Azadeh Farzan
, Dominik Klumpp
, Andreas Podelski
:
Commutativity Simplifies Proofs of Parameterized Programs. Proc. ACM Program. Lang. 8(POPL): 2485-2513 (2024) - [j34]Elisabeth Henkel
, Nico Hauff
, Vincent Langenfeld, Lukas Eber, Andreas Podelski:
Systematic adaptation and investigation of the understandability of a formal pattern language. Requir. Eng. 29(1): 3-23 (2024) - [c164]Frank Schüssele
, Manuel Bentele
, Daniel Dietsch
, Matthias Heizmann
, Xinyu Jiang
, Dominik Klumpp
, Andreas Podelski
:
Ultimate Automizer and the Abstraction of Bitwise Operations - (Competition Contribution). TACAS (3) 2024: 418-423 - 2023
- [j33]Azadeh Farzan
, Dominik Klumpp
, Andreas Podelski
:
Stratified Commutativity in Verification Algorithms for Concurrent Programs. Proc. ACM Program. Lang. 7(POPL): 1426-1453 (2023) - [c163]Elisabeth Henkel
, Nico Hauff
, Lukas Eber, Vincent Langenfeld
, Andreas Podelski
:
An Empirical Study of the Intuitive Understanding of a Formal Pattern Language. REFSQ 2023: 21-38 - [c162]Matthias Heizmann
, Max Barth
, Daniel Dietsch
, Leonard Fichtner, Jochen Hoenicke
, Dominik Klumpp
, Mehdi Naouar
, Tanja Schindler
, Frank Schüssele
, Andreas Podelski
:
Ultimate Automizer and the CommuHash Normal Form - (Competition Contribution). TACAS (2) 2023: 577-581 - [c161]Daniel Dietsch
, Matthias Heizmann
, Dominik Klumpp
, Frank Schüssele
, Andreas Podelski
:
Ultimate Taipan and Race Detection in Ultimate - (Competition Contribution). TACAS (2) 2023: 582-587 - [i12]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Commutativity Simplifies Proofs of Parameterized Programs. CoRR abs/2311.02673 (2023) - 2022
- [j32]Sergiy Bogomolov, Marcelo Forets
, Goran Frehse
, Andreas Podelski, Christian Schilling
:
Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version). Inf. Comput. 289(Part): 104937 (2022) - [c160]Dirk Beyer
, Andreas Podelski
:
Software Model Checking: 20 Years and Beyond. Principles of Systems Design 2022: 554-582 - [c159]Azadeh Farzan, Dominik Klumpp
, Andreas Podelski:
Sound sequentialization for concurrent program verification. PLDI 2022: 506-521 - [c158]Dominik Klumpp
, Daniel Dietsch
, Matthias Heizmann
, Frank Schüssele
, Marcel Ebbinghaus, Azadeh Farzan, Andreas Podelski
:
Ultimate GemCutter and the Axes of Generalization - (Competition Contribution). TACAS (2) 2022: 479-483 - 2021
- [j31]Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Temporal prophecy for proving temporal properties of infinite-state systems. Formal Methods Syst. Des. 57(2): 246-269 (2021) - [c157]Vincent Langenfeld, Bernd Westphal, Andreas Podelski:
A Formal Operational Model of ACT-R: Structure and Behaviour. CogSci 2021 - [c156]Daniel Dietsch, Matthias Heizmann
, Jochen Hoenicke, Alexander Nutz, Andreas Podelski:
Separating Map Variables in a Logic-Based Intermediate Verification Language. NETYS 2021: 169-186 - [c155]Samuel Becker, Daniel Dietsch, Nico Hauff, Elisabeth Henkel, Vincent Langenfeld, Andreas Podelski, Bernd Westphal:
Hanfor: Semantic Requirements Review at Scale. REFSQ Workshops 2021 - [c154]Daniel Dietsch, Matthias Heizmann
, Dominik Klumpp
, Mehdi Naouar, Andreas Podelski, Claus Schätzle:
Verification of Concurrent Programs Using Petri Net Unfoldings. VMCAI 2021: 174-195 - [i11]Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems. CoRR abs/2106.00966 (2021)
2010 – 2019
- 2019
- [c153]Alexander Heinz, Martin Wehrle, Sergiy Bogomolov, Daniele Magazzeni, Marius Greitschus, Andreas Podelski:
Temporal Planning as Refinement-Based Model Checking. ICAPS 2019: 195-199 - [c152]Vincent Langenfeld, Bernd Westphal, Andreas Podelski:
On Formal Verification of ACT-R Architectures and Models. CogSci 2019: 618-624 - [c151]Daniel Dietsch, Matthias Heizmann
, Jochen Hoenicke
, Alexander Nutz, Andreas Podelski:
Ultimate TreeAutomizer (CHC-COMP Tool Description). HCVS/PERR@ETAPS 2019: 42-47 - [e8]Andreas Podelski, François Taïani
:
Networked Systems - 6th International Conference, NETYS 2018, Essaouira, Morocco, May 9-11, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11028, Springer 2019, ISBN 978-3-030-05528-8 [contents] - [i10]Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski:
Different Maps for Different Uses. A Program Transformation for Intermediate Verification Languages. CoRR abs/1901.01915 (2019) - 2018
- [j30]Oded Padon, Jochen Hoenicke
, Giuliano Losa, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Reducing liveness to safety in first-order logic. Proc. ACM Program. Lang. 2(POPL): 26:1-26:33 (2018) - [c150]Vincent Langenfeld, Bernd Westphal, Rebecca Albrecht, Andreas Podelski:
But does it really do that? Using formal analysis to ensure desirable ACT-R model behaviour. CogSci 2018 - [c149]Oded Padon, Jochen Hoenicke
, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, Sharon Shoham:
Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems. FMCAD 2018: 1-11 - [c148]Sergiy Bogomolov
, Marcelo Forets, Goran Frehse
, Frédéric Viry, Andreas Podelski, Christian Schilling
:
Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices. HSCC 2018: 41-50 - [c147]Matthias Heizmann
, Yu-Fang Chen
, Daniel Dietsch, Marius Greitschus, Jochen Hoenicke
, Yong Li
, Alexander Nutz, Betim Musa, Christian Schilling
, Tanja Schindler
, Andreas Podelski:
Ultimate Automizer and the Search for Perfect Interpolants - (Competition Contribution). TACAS (2) 2018: 447-451 - [c146]Daniel Dietsch, Marius Greitschus, Matthias Heizmann
, Jochen Hoenicke
, Alexander Nutz, Andreas Podelski, Christian Schilling
, Tanja Schindler
:
Ultimate Taipan with Dynamic Block Encoding - (Competition Contribution). TACAS (2) 2018: 452-456 - [c145]Jochen Hoenicke, Alexander Nutz, Andreas Podelski:
A Tree-Based Approach to Data Flow Proofs. VSTTE 2018: 1-16 - [c144]Daniel Dietsch, Matthias Heizmann
, Jochen Hoenicke, Alexander Nutz, Andreas Podelski:
The Map Equality Domain. VSTTE 2018: 291-308 - [p2]Ranjit Jhala, Andreas Podelski, Andrey Rybalchenko:
Predicate Abstraction for Program Verification. Handbook of Model Checking 2018: 447-491 - [e7]Andreas Podelski:
Static Analysis - 25th International Symposium, SAS 2018, Freiburg, Germany, August 29-31, 2018, Proceedings. Lecture Notes in Computer Science 11002, Springer 2018, ISBN 978-3-319-99724-7 [contents] - [i9]Sergiy Bogomolov, Marcelo Forets, Goran Frehse, Andreas Podelski, Christian Schilling, Frédéric Viry:
Reach Set Approximation through Decomposition with Low-dimensional Sets and High-dimensional Matrices. CoRR abs/1801.09526 (2018) - 2017
- [c143]Jochen Hoenicke
, Rupak Majumdar, Andreas Podelski:
Thread modularity at many levels: a pearl in compositional verification. POPL 2017: 473-485 - [c142]Marius Greitschus, Daniel Dietsch, Andreas Podelski:
Loop Invariants from Counterexamples. SAS 2017: 128-147 - [c141]Daniel Dietsch, Matthias Heizmann
, Betim Musa, Alexander Nutz, Andreas Podelski:
Craig vs. Newton in software model checking. ESEC/SIGSOFT FSE 2017: 487-497 - [c140]Matthias Heizmann
, Yu-Wen Chen, Daniel Dietsch, Marius Greitschus, Alexander Nutz, Betim Musa, Claus Schätzle, Christian Schilling
, Frank Schüssele, Andreas Podelski:
Ultimate Automizer with an On-Demand Construction of Floyd-Hoare Automata - (Competition Contribution). TACAS (2) 2017: 394-398 - [c139]Marius Greitschus, Daniel Dietsch, Matthias Heizmann
, Alexander Nutz, Claus Schätzle, Christian Schilling
, Frank Schüssele, Andreas Podelski:
Ultimate Taipan: Trace Abstraction and Abstract Interpretation - (Competition Contribution). TACAS (2) 2017: 399-403 - [i8]Marius Greitschus, Daniel Dietsch, Andreas Podelski:
Refining Trace Abstraction using Abstract Interpretation. CoRR abs/1702.02369 (2017) - 2016
- [j29]Christian Schilling
, Sergiy Bogomolov
, Thomas A. Henzinger, Andreas Podelski, Jakob Ruess:
Adaptive moment closure for parameter inference of biochemical reaction networks. Biosyst. 149: 15-25 (2016) - [j28]Sergio Feo-Arenis, Bernd Westphal, Daniel Dietsch, Marco Muñiz
, Ahmad Siyar Andisha, Andreas Podelski:
Ready for testing: ensuring conformance to industrial standards through formal verification. Formal Aspects Comput. 28(3): 499-527 (2016) - [j27]Sergiy Bogomolov
, Alexandre Donzé
, Goran Frehse
, Radu Grosu, Taylor T. Johnson
, Hamed Ladan, Andreas Podelski, Martin Wehrle:
Guided search for hybrid systems based on coarse-grained space abstractions. Int. J. Softw. Tools Technol. Transf. 18(4): 449-467 (2016) - [c138]Azadeh Farzan, Zachary Kincaid
, Andreas Podelski:
Proving Liveness of Parameterized Programs. LICS 2016: 185-196 - [c137]Vincent Langenfeld
, Amalinda Post, Andreas Podelski:
Requirements Defects over a Project Lifetime: An Empirical Analysis of Defect Data from a 5-Year Automotive Project at Bosch. REFSQ 2016: 145-160 - [c136]Matthias Heizmann
, Daniel Dietsch, Marius Greitschus, Jan Leike, Betim Musa, Claus Schätzle, Andreas Podelski:
Ultimate Automizer with Two-track Proofs - (Competition Contribution). TACAS 2016: 950-953 - [c135]Andreas Podelski, Martin Schäf, Thomas Wies
:
Classifying Bugs with Interpolants. TAP@STAF 2016: 151-168 - [i7]Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proving Liveness of Parameterized Programs. CoRR abs/1605.02350 (2016) - [i6]Tobias Morciniec, Andreas Podelski:
A Logical Approach to Generating Test Plans. CoRR abs/1612.04351 (2016) - 2015
- [c134]Jochen Hoenicke
, Andreas Podelski:
Fairness for Infinitary Control. Correct System Design 2015: 33-43 - [c133]Daniel Dietsch, Matthias Heizmann
, Vincent Langenfeld
, Andreas Podelski:
Fairness Modulo Theory: A New Approach to LTL Software Model Checking. CAV (1) 2015: 49-66 - [c132]Sergiy Bogomolov
, Thomas A. Henzinger, Andreas Podelski, Jakob Ruess
, Christian Schilling
:
Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks. CMSB 2015: 77-89 - [c131]Goran Frehse
, Sergiy Bogomolov
, Marius Greitschus, Thomas Strump, Andreas Podelski:
Eliminating spurious transitions in reachability with support functions. HSCC 2015: 149-158 - [c130]Stephan Arlt, Tobias Morciniec, Andreas Podelski, Silke Wagner:
If A Fails, Can B Still Succeed? Inferring Dependencies between Test Results in Automotive System Testing. ICST 2015: 1-10 - [c129]Azadeh Farzan, Matthias Heizmann
, Jochen Hoenicke
, Zachary Kincaid, Andreas Podelski:
Automated Program Verification. LATA 2015: 25-46 - [c128]Azadeh Farzan, Zachary Kincaid
, Andreas Podelski:
Proof Spaces for Unbounded Parallelism. POPL 2015: 407-420 - [c127]Tobias Morciniec, Andreas Podelski:
Using the requirements specification to infer the implicit test status of requirements. RE 2015: 362-371 - [c126]Stephan Arlt, Sergio Feo-Arenis, Andreas Podelski, Martin Wehrle:
System Testing and Program Verification. Software Engineering & Management 2015: 71-72 - [c125]Matthias Heizmann
, Daniel Dietsch, Jan Leike, Betim Musa, Andreas Podelski:
Ultimate Automizer with Array Interpolation - (Competition Contribution). TACAS 2015: 455-457 - [c124]Alexander Nutz, Daniel Dietsch, Mostafa Mahmoud Mohamed
, Andreas Podelski:
ULTIMATE KOJAK with Memory Safety Checks - (Competition Contribution). TACAS 2015: 458-460 - 2014
- [c123]Sergiy Bogomolov, Daniele Magazzeni, Andreas Podelski, Martin Wehrle:
Planning as Model Checking in Hybrid Domains. AAAI 2014: 2228-2234 - [c122]Matthias Heizmann
, Jochen Hoenicke
, Andreas Podelski:
Termination Analysis by Learning Terminating Programs. CAV 2014: 797-813 - [c121]Sergiy Bogomolov, Goran Frehse
, Marius Greitschus, Radu Grosu, Corina S. Pasareanu, Andreas Podelski, Thomas Strump:
Assume-Guarantee Abstraction Refinement Meets Hybrid Systems. Haifa Verification Conference 2014: 116-131 - [c120]Sergiy Bogomolov
, Christian Herrera, Marco Muñiz
, Bernd Westphal, Andreas Podelski:
Quasi-dependent variables in hybrid automata. HSCC 2014: 93-102 - [c119]Stephan Arlt, Evren Ermis, Sergio Feo-Arenis, Andreas Podelski:
Verification of GUI Applications: A Black-Box Approach. ISoLA (1) 2014: 236-252 - [c118]Stephan Arlt, Andreas Podelski, Martin Wehrle:
Reducing GUI test suites via program slicing. ISSTA 2014: 270-281 - [c117]Azadeh Farzan, Zachary Kincaid
, Andreas Podelski:
Proofs that count. POPL 2014: 151-164 - [c116]Christian Herrera, Bernd Westphal, Andreas Podelski:
Quasi-Equal Clock Reduction: More Networks, More Queries. TACAS 2014: 295-309 - [c115]Matthias Heizmann
, Jürgen Christ, Daniel Dietsch, Jochen Hoenicke
, Markus Lindenmann, Betim Musa, Christian Schilling
, Stefan Wissert, Andreas Podelski:
Ultimate Automizer with Unsatisfiable Cores - (Competition Contribution). TACAS 2014: 418-420 - [c114]Evren Ermis, Alexander Nutz, Daniel Dietsch, Jochen Hoenicke
, Andreas Podelski:
Ultimate Kojak - (Competition Contribution). TACAS 2014: 421-423 - [i5]Matthias Heizmann, Jochen Hoenicke, Jan Leike, Andreas Podelski:
Linear Ranking for Linear Lasso Programs. CoRR abs/1401.5347 (2014) - [i4]Matthias Heizmann, Jochen Hoenicke, Andreas Podelski:
Termination Analysis by Learning Terminating Programs. CoRR abs/1405.4189 (2014) - 2013
- [c113]Matthias Heizmann
, Jochen Hoenicke
, Jan Leike, Andreas Podelski:
Linear Ranking for Linear Lasso Programs. ATVA 2013: 365-380 - [c112]Matthias Heizmann
, Jochen Hoenicke
, Andreas Podelski:
Software Model Checking for People Who Love Automata. CAV 2013: 36-52 - [c111]Marco Muñiz
, Bernd Westphal, Andreas Podelski:
Detecting Quasi-equal Clocks in Timed Automata. FORMATS 2013: 198-212 - [c110]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Andreas Podelski:
Push-Down Automata with Gap-Order Constraints. FSEN 2013: 199-216 - [c109]Azadeh Farzan, Zachary Kincaid
, Andreas Podelski:
Inductive data flow graphs. POPL 2013: 129-142 - [c108]Sergiy Bogomolov, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor T. Johnson
, Hamed Ladan, Andreas Podelski, Martin Wehrle:
Abstraction-Based Guided Search for Hybrid Systems. SPIN 2013: 117-134 - [c107]Matthias Heizmann
, Jürgen Christ, Daniel Dietsch, Evren Ermis, Jochen Hoenicke
, Markus Lindenmann, Alexander Nutz, Christian Schilling
, Andreas Podelski:
Ultimate Automizer with SMTInterpol - (Competition Contribution). TACAS 2013: 641-643 - [c106]Andreas Podelski:
Automata as Proofs. VMCAI 2013: 13-14 - [i3]Daniel Dietsch, Andreas Podelski, Jaechang Nam, Pantelis M. Papadopoulos, Martin Schäf:
Monitoring Student Activity in Collaborative Software Development. CoRR abs/1305.0787 (2013) - 2012
- [j26]Amalinda Post, Igor Menzel, Jochen Hoenicke
, Andreas Podelski:
Automotive behavioral requirements expressed in a specification pattern system: a case study at BOSCH. Requir. Eng. 17(1): 19-33 (2012) - [c105]Andreas Podelski:
Interpolant Automata - (Invited Talk). ATVA 2012: 26 - [c104]Sergiy Bogomolov
, Goran Frehse
, Radu Grosu, Hamed Ladan, Andreas Podelski, Martin Wehrle:
A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx. CAV 2012: 479-494 - [c103]Christian Herrera, Bernd Westphal, Sergio Feo-Arenis, Marco Muñiz
, Andreas Podelski:
Reducing Quasi-Equal Clocks in Networks of Timed Automata. FORMATS 2012: 155-170 - [c102]Marco Muñiz
, Bernd Westphal, Andreas Podelski:
Timed Automata with Disjoint Activity. FORMATS 2012: 188-203 - [c101]Stephan Arlt, Andreas Podelski, Cristiano Bertolini, Martin Schäf
, Ishan Banerjee, Atif M. Memon:
Lightweight Static Analysis for GUI Testing. ISSRE 2012: 301-310 - [c100]Stephan Arlt, Pedro Borromeo, Martin Schäf, Andreas Podelski:
Parameterized GUI Tests. ICTSS 2012: 247-262 - [c99]Bernd Westphal, Daniel Dietsch, Sergio Feo-Arenis, Andreas Podelski, Louis Pahlow, Jochen Morsbach, Barbara Sommer, Anke Fuchs, Christine Meierhöfer:
Towards successful subcontracting for software in small to medium-sized enterprises. RELAW 2012: 42-51 - [c98]Evren Ermis, Jochen Hoenicke
, Andreas Podelski:
Splitting via Interpolants. VMCAI 2012: 186-201 - [e6]Rajeev Joshi, Peter Müller, Andreas Podelski:
Verified Software: Theories, Tools, Experiments - 4th International Conference, VSTTE 2012, Philadelphia, PA, USA, January 28-29, 2012. Proceedings. Lecture Notes in Computer Science 7152, Springer 2012, ISBN 978-3-642-27704-7 [contents] - [i2]Stephan Arlt, Evren Ermis, Sergio Feo-Arenis, Andreas Podelski:
Black-Box Verification for GUI Applications. CoRR abs/1210.4686 (2012) - 2011
- [j25]Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Proving program termination. Commun. ACM 54(5): 88-98 (2011) - [j24]Amalinda Post, Andreas Podelski:
Automatische Validierung von Anforderungen. Softwaretechnik-Trends 31(1) (2011) - [c97]Amalinda Post, Jochen Hoenicke
, Andreas Podelski:
rt-Inconsistency: A New Property for Real-Time Requirements. FASE 2011: 34-49 - [c96]Daniel Dietsch, Bernd Westphal, Andreas Podelski:
System Verification through Program Verification. FM 2011: 27-41 - [c95]Corina Mitrohin, Andreas Podelski:
Composing Stability Proofs for Hybrid Systems. FORMATS 2011: 286-300 - [c94]Amalinda Post, Jochen Hoenicke
, Andreas Podelski:
Vacuous real-time requirements. RE 2011: 153-162 - [c93]Daniel Dietsch, Sergio Feo-Arenis, Bernd Westphal, Andreas Podelski:
Disambiguation of industrial standards through formalization and graphical languages. RE 2011: 265-270 - [c92]Amalinda Post, Igor Menzel, Andreas Podelski:
Applying Restricted English Grammar on Automotive Requirements - Does it Work? A Case Study. REFSQ 2011: 166-180 - [c91]Andreas Podelski, Andrey Rybalchenko:
Transition Invariants and Transition Predicate Abstraction for Program Termination. TACAS 2011: 3-10 - 2010
- [j23]Jochen Hoenicke
, K. Rustan M. Leino, Andreas Podelski, Martin Schäf
, Thomas Wies:
Doomed program points. Formal Methods Syst. Des. 37(2-3): 171-199 (2010) - [c90]Sergiy Bogomolov
, Corina Mitrohin, Andreas Podelski:
Composing Reachability Analyses of Hybrid Systems for Safety and Stability. ATVA 2010: 67-81 - [c89]Ernst-Rüdiger Olderog, Andreas Podelski:
Explicit Fair Scheduling for Dynamic Control. Concurrency, Compositionality, and Correctness 2010: 96-117 - [c88]Sergiy Bogomolov, Martin Mann, Björn Voß, Andreas Podelski, Rolf Backofen:
Shape-based Barrier Estimation for RNAs. GCB 2010: 41-50 - [c87]Andreas Podelski, Thomas Wies
:
Counterexample-guided focus. POPL 2010: 249-260 - [c86]Matthias Heizmann
, Jochen Hoenicke
, Andreas Podelski:
Nested interpolants. POPL 2010: 471-482 - [c85]Matthias Heizmann
, Neil D. Jones, Andreas Podelski:
Size-Change Termination and Transition Invariants. SAS 2010: 22-50 - [c84]Alexander Malkis
, Andreas Podelski, Andrey Rybalchenko:
Thread-Modular Counterexample-Guided Abstraction Refinement. SAS 2010: 356-372 - [c83]Jochen Hoenicke
, Ernst-Rüdiger Olderog, Andreas Podelski:
Fairness for Dynamic Control. TACAS 2010: 251-265
2000 – 2009
- 2009
- [j22]Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Summarization for termination: no return! Formal Methods Syst. Des. 35(3): 369-387 (2009) - [j21]Klaus Dräger, Bernd Finkbeiner, Andreas Podelski:
Directed model checking with distance-preserving abstractions. Int. J. Softw. Tools Technol. Transf. 11(1): 27-37 (2009) - [c82]Jochen Hoenicke
, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies:
It's Doomed; We Can Prove It. FM 2009: 338-353 - [c81]Mohamed Nassim Seghir, Andreas Podelski, Thomas Wies
:
Abstraction Refinement for Quantified Array Assertions. SAS 2009: 3-18 - [c80]Matthias Heizmann
, Jochen Hoenicke
, Andreas Podelski:
Refinement of Trace Abstraction. SAS 2009: 69-85 - [c79]Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski:
Transition-Based Directed Model Checking. TACAS 2009: 186-200 - 2008
- [c78]Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski:
Useless Actions Are Useful. ICAPS 2008: 388-395 - [c77]Andreas Podelski, Andrey Rybalchenko, Thomas Wies
:
Heap Assumptions on Demand. CAV 2008: 314-327 - [c76]Sebastian Kupferschmid, Martin Wehrle, Bernhard Nebel
, Andreas Podelski:
Faster Than Uppaal? CAV 2008: 552-555 - [c75]Rayna Dimitrova, Andreas Podelski:
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? VMCAI 2008: 98-111 - [c74]Andreas Podelski:
Verification, Least-Fixpoint Checking, Abstraction. VSTTE 2008: 3 - 2007
- [j20]Bernd Becker
, Andreas Podelski, Werner Damm, Martin Fränzle
, Ernst-Rüdiger Olderog, Reinhard Wilhelm:
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. 49(2): 118-126 (2007) - [j19]Andreas Podelski, Andrey Rybalchenko:
Transition predicate abstraction and fair termination. ACM Trans. Program. Lang. Syst. 29(3): 15 (2007) - [c73]Andreas Podelski, Silke Wagner:
Region Stability Proofs for Hybrid Systems. FORMATS 2007: 320-335 - [c72]Andreas Podelski, Silke Wagner:
A Sound and Complete Proof Rule for Region Stability of Hybrid Systems. HSCC 2007: 750-753 - [c71]Andreas Podelski, Andrey Rybalchenko:
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. PADL 2007: 245-259 - [c70]Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Proving thread termination. PLDI 2007: 320-330 - [c69]Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Y. Vardi:
Proving that programs eventually do something good. POPL 2007: 265-276 - [c68]Alexander Malkis
, Andreas Podelski, Andrey Rybalchenko:
Precise Thread-Modular Verification. SAS 2007: 218-232 - [c67]Mohamed Nassim Seghir, Andreas Podelski:
ACSAR: Software Model Checking with Transfinite Refinement. SPIN 2007: 274-278 - [c66]Sebastian Kupferschmid, Klaus Dräger, Jörg Hoffmann, Bernd Finkbeiner, Henning Dierks, Andreas Podelski, Gerd Behrmann:
Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking. TACAS 2007: 679-682 - [e5]Michael Leuschel, Andreas Podelski:
Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 14-16, 2007, Wroclaw, Poland. ACM 2007, ISBN 978-1-59593-769-8 [contents] - [e4]Byron Cook, Andreas Podelski:
Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings. Lecture Notes in Computer Science 4349, Springer 2007, ISBN 978-3-540-69735-0 [contents] - 2006
- [j18]Kurt Jensen, Andreas Podelski:
Tools and algorithms for the construction and analysis of systems. Int. J. Softw. Tools Technol. Transf. 8(3): 177-179 (2006) - [c65]Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Terminator: Beyond Safety. CAV 2006: 415-418 - [c64]Andreas Podelski, Silke Wagner:
Model Checking of Hybrid Systems: From Reachability Towards Stability. HSCC 2006: 507-521 - [c63]Alexander Malkis
, Andreas Podelski, Andrey Rybalchenko:
Thread-Modular Verification Is Cartesian Abstract Interpretation. ICTAC 2006: 183-197 - [c62]Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski:
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL. MoChArt 2006: 51-66 - [c61]Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Termination proofs for systems code. PLDI 2006: 415-426 - [c60]Klaus Dräger, Bernd Finkbeiner, Andreas Podelski:
Directed Model Checking with Distance-Preserving Abstractions. SPIN 2006: 19-34 - [c59]Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, Martin C. Rinard:
Field Constraint Analysis. VMCAI 2006: 157-173 - [i1]Thomas Wies, Viktor Kuncak, Karen Zee, Andreas Podelski, Martin C. Rinard:
On Verifying Complex Properties using Symbolic Shape Analysis. CoRR abs/cs/0609104 (2006) - 2005
- [j17]Bruno Blanchet, Andreas Podelski:
Verification of cryptographic protocols: tagging enforces termination. Theor. Comput. Sci. 333(1-2): 67-90 (2005) - [j16]Kurt Jensen, Andreas Podelski:
Special issue. Theor. Comput. Sci. 345(1): 1 (2005) - [c58]Andreas Podelski, Ina Schaefer, Silke Wagner:
Summaries for While Programs with Recursion. ESOP 2005: 94-107 - [c57]Andreas Podelski, Andrey Rybalchenko:
Transition predicate abstraction and fair termination. POPL 2005: 132-144 - [c56]Byron Cook, Andreas Podelski, Andrey Rybalchenko:
Abstraction Refinement for Termination. SAS 2005: 87-101 - [c55]Andreas Podelski, Thomas Wies
:
Boolean Heaps. SAS 2005: 268-283 - [c54]Amir Pnueli, Andreas Podelski, Andrey Rybalchenko:
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems. TACAS 2005: 124-139 - 2004
- [j15]Michael Leuschel, Andreas Podelski, C. R. Ramakrishnan, Ulrich Ultes-Nitsche
:
Introduction to the Special Issue on Verification and Computational Logic. Theory Pract. Log. Program. 4(5-6): 543-544 (2004) - [c53]Andreas Podelski:
Constraints in Program Analysis and Verification. CP 2004: 1-4 - [c52]Andreas Podelski, Andrey Rybalchenko:
Transition Invariants. LICS 2004: 32-41 - [c51]Andreas Podelski, Andrey Rybalchenko:
A Complete Method for the Synthesis of Linear Ranking Functions. VMCAI 2004: 239-251 - [e3]Kurt Jensen, Andreas Podelski:
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. Lecture Notes in Computer Science 2988, Springer 2004, ISBN 3-540-21299-X [contents] - 2003
- [j14]Thomas Ball, Andreas Podelski, Sriram K. Rajamani:
Boolean and Cartesian abstraction for model checking C programs. Int. J. Softw. Tools Technol. Transf. 5(1): 49-58 (2003) - [c50]Bruno Blanchet, Andreas Podelski:
Verification of Cryptographic Protocols: Tagging Enforces Termination. FoSSaCS 2003: 136-152 - [c49]Andreas Podelski:
Software Model Checking with Abstraction Refinement. VMCAI 2003: 1-3 - 2002
- [j13]Witold Charatonik, Andreas Podelski:
Set Constraints with Intersection. Inf. Comput. 179(2): 213-229 (2002) - [c48]Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski:
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP. ICLP 2002: 115-129 - [c47]Supratik Mukhopadhyay, Andreas Podelski:
An Algebraic Framework for Abstract Model Checking. SARA 2002: 152-169 - [c46]Thomas Ball, Andreas Podelski, Sriram K. Rajamani:
Relative Completeness of Abstraction Refinement for Software Model Checking. TACAS 2002: 158-172 - [c45]Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski:
Compositional Termination Analysis of Symbolic Forward Analysis. VMCAI 2002: 109-125 - 2001
- [j12]Giorgio Delzanno, Andreas Podelski:
Constraint-based deductive model checking. Int. J. Softw. Tools Technol. Transf. 3(3): 250-270 (2001) - [c44]Supratik Mukhopadhyay, Andreas Podelski:
Accurate Widenings and Boundedness Properties of Timed Systems. Ershov Memorial Conference 2001: 79-94 - [c43]Supratik Mukhopadhyay, Andreas Podelski:
Constraint Database Models Characterizing Timed Bisimilarity. PADL 2001: 245-258 - [c42]Pablo Argón, Giorgio Delzanno, Supratik Mukhopadhyay, Andreas Podelski:
Model Checking Communication Protocols. SOFSEM 2001: 160-170 - [c41]Thomas Ball, Andreas Podelski, Sriram K. Rajamani:
Boolean and Cartesian Abstraction for Model Checking C Programs. TACAS 2001: 268-283 - 2000
- [j11]Martin Müller, Joachim Niehren, Andreas Podelski:
Ordering Constraints over Feature Trees. Constraints An Int. J. 5(1/2): 7-41 (2000) - [c40]Supratik Mukhopadhyay, Andreas Podelski:
Model Checking for Timed Logic Processes. Computational Logic 2000: 598-612 - [c39]Javier Esparza
, Andreas Podelski:
Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. POPL 2000: 1-11 - [c38]Witold Charatonik, Andreas Podelski, Jean-Marc Talbot:
Paths vs. Trees in Set-Based Program Analysis. POPL 2000: 330-337 - [c37]Andreas Podelski:
Model Checking as Constraint Solving. SAS 2000: 22-37
1990 – 1999
- 1999
- [c36]Giorgio Delzanno, Javier Esparza
, Andreas Podelski:
Constraint-Based Analysis of Broadcast Protocols. CSL 1999: 50-66 - [c35]Andreas Podelski, Witold Charatonik, Martin Müller:
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs. ESOP 1999: 177-192 - [c34]Supratik Mukhopadhyay, Andreas Podelski:
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. FSTTCS 1999: 232-244 - [c33]Giorgio Delzanno, Andreas Podelski:
Verification of Infinite-State Systems in Constraint Logic Programming. JFPLC 1999: 13-22 - [c32]Giorgio Delzanno, Andreas Podelski:
Model Checking in CLP. TACAS 1999: 223-239 - 1998
- [c31]Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz:
The Horn Mu-calculus. LICS 1998: 58-69 - [c30]Witold Charatonik, Andreas Podelski:
Co-definite Set Constraints. RTA 1998: 211-225 - [c29]Witold Charatonik, Andreas Podelski:
Directional Type Inference for Logic Programs. SAS 1998: 278-294 - [c28]Witold Charatonik, Andreas Podelski:
Set-Based Analysis of Reactive Infinite-State Systems. TACAS 1998: 358-375 - 1997
- [j10]Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein:
Order Sorted Feature Theory Unification. J. Log. Program. 30(2): 99-124 (1997) - [j9]Maurice Nivat, Andreas Podelski:
Minimal Ascending and Descending Tree Automata. SIAM J. Comput. 26(1): 39-58 (1997) - [j8]Andreas Podelski, Gert Smolka:
Situated Simplification. Theor. Comput. Sci. 173(1): 235-252 (1997) - [c27]Martin Müller, Joachim Niehren, Andreas Podelski:
Ordering Constraints over Feature Trees. CP 1997: 297-311 - [c26]Leszek Pacholski, Andreas Podelski:
Set Constraints: A Pearl in Research on Constraints. CP 1997: 549-562 - [c25]Abdelwaheb Ayari, David A. Basin, Andreas Podelski:
LISA: A Specification Language Based on WS2S. CSL 1997: 18-34 - [c24]Witold Charatonik, Andreas Podelski:
Set Constraints with Intersection. LICS 1997: 362-372 - [c23]Andreas Podelski:
Set-Based Analysis of Logic Programs and Reactive Logic Programs (Abstract). ILPS 1997: 35-36 - [c22]Martin Müller, Joachim Niehren, Andreas Podelski:
Inclusion Constraints over Non-empty Sets of Trees. TAPSOFT 1997: 345-356 - 1996
- [c21]Witold Charatonik, Andreas Podelski:
The Independence Property of a Class of Set Constraints. CP 1996: 76-90 - 1995
- [c20]Andreas Podelski, Peter Van Roy:
A Detailed Algorithm Testing Guards over Feature Trees. Constraint Processing, Selected Papers 1995: 11-38 - [c19]Andreas Podelski, Gert Smolka:
Situated Simplification. CP 1995: 328-344 - [c18]Andreas Podelski, Gert Smolka:
Operational Semantics of Constraint Logic Programs with Coroutining. ICLP 1995: 449-463 - [c17]Andreas Podelski, Gert Smolka:
Situated Simplification. ICLP 1995: 826 - [e2]Andreas Podelski:
Constraint Programming: Basics and Trends, Châtillon Spring School, Châtillon-sur-Seine, France, May 16 - 20, 1994, Selected Papers. Lecture Notes in Computer Science 910, Springer 1995, ISBN 3-540-59155-9 [contents] - 1994
- [j7]Hassan Aït-Kaci, Andreas Podelski, Gert Smolka:
A Feature Constraint System for Logic Programming with Entailment. Theor. Comput. Sci. 122(1&2): 263-283 (1994) - [j6]Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids. Theor. Comput. Sci. 134(1): 13-25 (1994) - [j5]Hassan Aït-Kaci, Andreas Podelski:
Functions as Passive Constraints in LIFE. ACM Trans. Program. Lang. Syst. 16(4): 1279-1318 (1994) - [c16]Andreas Podelski, Peter Van Roy:
The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees. ILPS 1994: 359-374 - 1993
- [j4]Maurice Nivat, Andreas Podelski:
Another variation on the common subexpression problem. Discret. Math. 114(1-3): 379-401 (1993) - [j3]Hassan Aït-Kaci, Andreas Podelski:
Towards a Meaning of LIFE. J. Log. Program. 16(3): 195-234 (1993) - [c15]Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein:
Order-Sorted Feature Theory Unification. ICLP Workshop on Concurrent Constraint Programming 1993 - [c14]Hassan Aït-Kaci, Andreas Podelski, Peter Van Roy:
An Informal Introduction to LIFE. ICLP Workshop on Concurrent Constraint Programming 1993 - [c13]Andreas Podelski, Peter Van Roy:
The Beauty and the Beast Algorithm: Testing Entailment and Disentailment Incrementally. ICLP Workshop on Concurrent Constraint Programming 1993 - [c12]Hassan Aït-Kaci, Andreas Podelski:
Entailment and Disentailment of Order-Sorted Feature Constraints. LPAR 1993: 1-18 - [c11]Danièle Beauquier, Andreas Podelski:
Rabin Tree Automata and Finite Monoids. MFCS 1993: 262-271 - [c10]Hugues Calbrix, Maurice Nivat, Andreas Podelski:
Ultimately Periodic Words of Rational w-Languages. MFPS 1993: 554-566 - [c9]Hassan Aït-Kaci, Andreas Podelski:
Entailment and Disentailment of Order-Sorted Feature Constraints. PPCP 1993: 1-6 - [c8]Joachim Niehren, Andreas Podelski, Ralf Treinen:
Equational and Membership Constraints for Finite Trees. RTA 1993: 106-120 - [c7]Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein:
Order-Sorted Feature Theory Unification. ILPS 1993: 506-524 - [c6]Andreas Podelski, Peter Van Roy:
The Beauty and the Beast Algorithm. ILPS 1993: 653 - [c5]Joachim Niehren, Andreas Podelski:
Feature Automata and Recognizable Sets of Feature Trees. TAPSOFT 1993: 356-375 - 1992
- [c4]Hassan Aït-Kaci, Andreas Podelski:
Logic Programming with Functions over Order-Sorted Feature Terms. ELP 1992: 100-119 - [c3]Hassan Aït-Kaci, Andreas Podelski, Gert Smolka:
A Feature-Based Constraint System for Logic Programming with Entailment. FGCS 1992: 1012-1021 - [c2]Pierre Péladeau, Andreas Podelski:
On Reverse and General Definite Tree Languages (Extended Abstract). ICALP 1992: 150-161 - [p1]Andreas Podelski:
A monoid approach to tree automata. Tree Automata and Languages 1992: 41-56 - [e1]Maurice Nivat, Andreas Podelski:
Tree Automata and Languages. North-Holland 1992 [contents] - 1991
- [j2]Bruno Courcelle, Damian Niwinski, Andreas Podelski:
A Geometrical View of the Determinization and Minimization of Finite-State Automata. Math. Syst. Theory 24(2): 117-146 (1991) - [c1]Hassan Aït-Kaci, Andreas Podelski:
Towards a Meaning of LIFE. PLILP 1991: 255-274
1980 – 1989
- 1989
- [j1]Maurice Nivat, Andreas Podelski:
Definite tree languages. Bull. EATCS 38: 186-190 (1989)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint