Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andreas Podelski
2010 – today
- 2013
[c106]- [c105]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
- [c104]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
- [c103]
- [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)
- [c102]
- [c101]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
- [c100]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
- [c99]Marco Muñiz, Bernd Westphal, Andreas Podelski: Timed Automata with Disjoint Activity. FORMATS 2012: 188-203
- [c98]Stephan Arlt, Andreas Podelski, Cristiano Bertolini, Martin Schäf, Ishan Banerjee, Atif M. Memon: Lightweight Static Analysis for GUI Testing. ISSRE 2012: 301-310
- [c97]Stephan Arlt, Pedro Borromeo, Martin Schäf, Andreas Podelski: Parameterized GUI Tests. ICTSS 2012: 247-262
- [c96]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
- [c95]
- [e6]Rajeev Joshi, Peter Müller, Andreas Podelski (Eds.): 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
- [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)
- [c94]Amalinda Post, Jochen Hoenicke, Andreas Podelski: rt-Inconsistency: A New Property for Real-Time Requirements. FASE 2011: 34-49
- [c93]Daniel Dietsch, Bernd Westphal, Andreas Podelski: System Verification through Program Verification. FM 2011: 27-41
- [c92]Corina Mitrohin, Andreas Podelski: Composing Stability Proofs for Hybrid Systems. FORMATS 2011: 286-300
- [c91]
- [c90]Daniel Dietsch, Sergio Feo Arenis, Bernd Westphal, Andreas Podelski: Disambiguation of industrial standards through formalization and graphical languages. RE 2011: 265-270
- [c89]Amalinda Post, Igor Menzel, Andreas Podelski: Applying Restricted English Grammar on Automotive Requirements - Does it Work? A Case Study. REFSQ 2011: 166-180
- [c88]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 in System Design 37(2-3): 171-199 (2010)
- [c87]Sergiy Bogomolov, Corina Mitrohin, Andreas Podelski: Composing Reachability Analyses of Hybrid Systems for Safety and Stability. ATVA 2010: 67-81
- [c86]Ernst-Rüdiger Olderog, Andreas Podelski: Explicit Fair Scheduling for Dynamic Control. Concurrency, Compositionality, and Correctness 2010: 96-117
- [c85]Sergiy Bogomolov, Martin Mann, Björn Voß, Andreas Podelski, Rolf Backofen: Shape-based Barrier Estimation for RNAs. GCB 2010: 41-50
- [c84]
- [c83]
- [c82]Matthias Heizmann, Neil D. Jones, Andreas Podelski: Size-Change Termination and Transition Invariants. SAS 2010: 22-50
- [c81]Alexander Malkis, Andreas Podelski, Andrey Rybalchenko: Thread-Modular Counterexample-Guided Abstraction Refinement. SAS 2010: 356-372
- [c80]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 in System Design 35(3): 369-387 (2009)
- [j21]Klaus Dräger, Bernd Finkbeiner, Andreas Podelski: Directed model checking with distance-preserving abstractions. STTT 11(1): 27-37 (2009)
- [c79]Jochen Hoenicke, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, Thomas Wies: It's Doomed; We Can Prove It. FM 2009: 338-353
- [c78]Mohamed Nassim Seghir, Andreas Podelski, Thomas Wies: Abstraction Refinement for Quantified Array Assertions. SAS 2009: 3-18
- [c77]Matthias Heizmann, Jochen Hoenicke, Andreas Podelski: Refinement of Trace Abstraction. SAS 2009: 69-85
- [c76]Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski: Transition-Based Directed Model Checking. TACAS 2009: 186-200
- 2008
- [c75]Martin Wehrle, Sebastian Kupferschmid, Andreas Podelski: Useless Actions Are Useful. ICAPS 2008: 388-395
- [c74]
- [c73]Sebastian Kupferschmid, Martin Wehrle, Bernhard Nebel, Andreas Podelski: Faster Than Uppaal? CAV 2008: 552-555
- [c72]Rayna Dimitrova, Andreas Podelski: Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? VMCAI 2008: 98-111
- [c71]
- 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 - Information Technology 49(2): 118-126 (2007)
- [j19]Andreas Podelski, Andrey Rybalchenko: Transition predicate abstraction and fair termination. ACM Trans. Program. Lang. Syst. 29(3) (2007)
- [c70]
- [c69]Andreas Podelski, Silke Wagner: A Sound and Complete Proof Rule for Region Stability of Hybrid Systems. HSCC 2007: 750-753
- [c68]Andreas Podelski, Andrey Rybalchenko: ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement. PADL 2007: 245-259
- [c67]
- [c66]Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, Moshe Y. Vardi: Proving that programs eventually do something good. POPL 2007: 265-276
- [c65]Alexander Malkis, Andreas Podelski, Andrey Rybalchenko: Precise Thread-Modular Verification. SAS 2007: 218-232
- [c64]Mohamed Nassim Seghir, Andreas Podelski: ACSAR: Software Model Checking with Transfinite Refinement. SPIN 2007: 274-278
- [c63]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 (Eds.): 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
- [e4]Byron Cook, Andreas Podelski (Eds.): 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
- 2006
- [j18]Kurt Jensen, Andreas Podelski: Tools and algorithms for the construction and analysis of systems. STTT 8(3): 177-179 (2006)
- [c62]
- [c61]Andreas Podelski, Silke Wagner: Model Checking of Hybrid Systems: From Reachability Towards Stability. HSCC 2006: 507-521
- [c60]Alexander Malkis, Andreas Podelski, Andrey Rybalchenko: Thread-Modular Verification Is Cartesian Abstract Interpretation. ICTAC 2006: 183-197
- [c59]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
- [c58]Byron Cook, Andreas Podelski, Andrey Rybalchenko: Termination proofs for systems code. PLDI 2006: 415-426
- [c57]Klaus Dräger, Bernd Finkbeiner, Andreas Podelski: Directed Model Checking with Distance-Preserving Abstractions. SPIN 2006: 19-34
- [c56]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]
- [c55]Andreas Podelski, Ina Schaefer, Silke Wagner: Summaries for While Programs with Recursion. ESOP 2005: 94-107
- [c54]Andreas Podelski, Andrey Rybalchenko: Transition predicate abstraction and fair termination. POPL 2005: 132-144
- [c53]Byron Cook, Andreas Podelski, Andrey Rybalchenko: Abstraction Refinement for Termination. SAS 2005: 87-101
- [c52]
- [c51]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. TPLP 4(5-6): 543-544 (2004)
- [c50]
- [c49]
- [c48]Andreas Podelski, Andrey Rybalchenko: A Complete Method for the Synthesis of Linear Ranking Functions. VMCAI 2004: 239-251
- [e3]Kurt Jensen, Andreas Podelski (Eds.): 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
- 2003
- [j14]Thomas Ball, Andreas Podelski, Sriram K. Rajamani: Boolean and Cartesian abstraction for model checking C programs. STTT 5(1): 49-58 (2003)
- [c47]Bruno Blanchet, Andreas Podelski: Verification of Cryptographic Protocols: Tagging Enforces Termination. FoSSaCS 2003: 136-152
- [c46]
- 2002
- [j13]Witold Charatonik, Andreas Podelski: Set Constraints with Intersection. Inf. Comput. 179(2): 213-229 (2002)
- [c45]Witold Charatonik, Supratik Mukhopadhyay, Andreas Podelski: Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP. ICLP 2002: 115-129
- [c44]Supratik Mukhopadhyay, Andreas Podelski: An Algebraic Framework for Abstract Model Checking. SARA 2002: 152-169
- [c43]Thomas Ball, Andreas Podelski, Sriram K. Rajamani: Relative Completeness of Abstraction Refinement for Software Model Checking. TACAS 2002: 158-172
- [c42]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. STTT 3(3): 250-270 (2001)
- [c41]Supratik Mukhopadhyay, Andreas Podelski: Accurate Widenings and Boundedness Properties of Timed Systems. Ershov Memorial Conference 2001: 79-94
- [c40]Supratik Mukhopadhyay, Andreas Podelski: Constraint Database Models Characterizing Timed Bisimilarity. PADL 2001: 245-258
- [c39]Pablo Argón, Giorgio Delzanno, Supratik Mukhopadhyay, Andreas Podelski: Model Checking Communication Protocols. SOFSEM 2001: 160-170
- [c38]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 5(1/2): 7-41 (2000)
- [c37]Supratik Mukhopadhyay, Andreas Podelski: Model Checking for Timed Logic Processes. Computational Logic 2000: 598-612
- [c36]Javier Esparza, Andreas Podelski: Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. POPL 2000: 1-11
- [c35]Witold Charatonik, Andreas Podelski, Jean-Marc Talbot: Paths vs. Trees in Set-Based Program Analysis. POPL 2000: 330-337
- [c34]
1990 – 1999
- 1999
- [c33]Giorgio Delzanno, Javier Esparza, Andreas Podelski: Constraint-Based Analysis of Broadcast Protocols. CSL 1999: 50-66
- [c32]Andreas Podelski, Witold Charatonik, Martin Müller: Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs. ESOP 1999: 177-192
- [c31]Supratik Mukhopadhyay, Andreas Podelski: Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata. FSTTCS 1999: 232-244
- [c30]Giorgio Delzanno, Andreas Podelski: Verification of Infinite-State Systems in Constraint Logic Programming. JFPLC 1999: 13-22
- [c29]
- 1998
- [c28]Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz: The Horn Mu-calculus. LICS 1998: 58-69
- [c27]
- [c26]Witold Charatonik, Andreas Podelski: Directional Type Inference for Logic Programs. SAS 1998: 278-294
- [c25]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]
- [c24]Martin Müller, Joachim Niehren, Andreas Podelski: Ordering Constraints over Feature Trees. CP 1997: 297-311
- [c23]Leszek Pacholski, Andreas Podelski: Set Constraints: A Pearl in Research on Constraints. CP 1997: 549-562
- [c22]Abdelwaheb Ayari, David A. Basin, Andreas Podelski: LISA: A Specification Language Based on WS2S. CSL 1997: 18-34
- [c21]
- [c20]Andreas Podelski: Set-Based Analysis of Logic Programs and Reactive Logic Programs (Abstract). ILPS 1997: 35-36
- [c19]Martin Müller, Joachim Niehren, Andreas Podelski: Inclusion Constraints over Non-empty Sets of Trees. TAPSOFT 1997: 345-356
- 1996
- [c18]Witold Charatonik, Andreas Podelski: The Independence Property of a Class of Set Constraints. CP 1996: 76-90
- 1995
- [c17]Andreas Podelski, Peter Van Roy: A Detailed Algorithm Testing Guards over Feature Trees. Constraint Processing, Selected Papers 1995: 11-38
- [c16]
- [c15]Andreas Podelski, Gert Smolka: Operational Semantics of Constraint Logic Programs with Coroutining. ICLP 1995: 449-463
- [c14]
- [e2]Andreas Podelski (Ed.): 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
- 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)
- [c13]Andreas Podelski, Peter Van Roy: The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees. SLP 1994: 359-374
- 1993
- [j4]Maurice Nivat, Andreas Podelski: Another variation on the common subexpression problem. Discrete Mathematics 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)
- [c12]Hassan Aït-Kaci, Andreas Podelski: Entailment and Disentailment of Order-Sorted Feature Constraints. LPAR 1993: 1-18
- [c11]
- [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]
- [c5]Joachim Niehren, Andreas Podelski: Feature Automata and Recognizable Sets of Feature Trees. TAPSOFT 1993: 356-375
- 1992
- [e1]
- [p1]
- [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
- 1991
- [j2]Bruno Courcelle, Damian Niwinski, Andreas Podelski: A Geometrical View of the Determinization and Minimization of Finite-State Automata. Mathematical Systems Theory 24(2): 117-146 (1991)
- [c1]
1980 – 1989
- 1989
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:13 CEST by the dblp team