Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Podelski
Person information
- affiliation: University of Freiburg
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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)- [c162]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 - [c161]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 - [c160]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) - [c159]Dirk Beyer, Andreas Podelski:
Software Model Checking: 20 Years and Beyond. Principles of Systems Design 2022: 554-582 - [c158]Azadeh Farzan, Dominik Klumpp, Andreas Podelski:
Sound sequentialization for concurrent program verification. PLDI 2022: 506-521 - [c157]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) - [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?