| 2009 |
|---|
| 103 | EE | Martin Wehrle,
Sebastian Kupferschmid,
Andreas Podelski:
Transition-Based Directed Model Checking.
TACAS 2009: 186-200 |
| 2008 |
|---|
| 102 | EE | Andreas Podelski,
Andrey Rybalchenko,
Thomas Wies:
Heap Assumptions on Demand.
CAV 2008: 314-327 |
| 101 | EE | Sebastian Kupferschmid,
Martin Wehrle,
Bernhard Nebel,
Andreas Podelski:
Faster Than Uppaal?
CAV 2008: 552-555 |
| 100 | | Martin Wehrle,
Sebastian Kupferschmid,
Andreas Podelski:
Useless Actions Are Useful.
ICAPS 2008: 388-395 |
| 99 | EE | Rayna Dimitrova,
Andreas Podelski:
Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?
VMCAI 2008: 98-111 |
| 98 | EE | Andreas Podelski:
Verification, Least-Fixpoint Checking, Abstraction.
VSTTE 2008: 3 |
| 2007 |
|---|
| 97 | | 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 |
| 96 | | Byron Cook,
Andreas Podelski:
Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings
Springer 2007 |
| 95 | EE | Andreas Podelski,
Silke Wagner:
Region Stability Proofs for Hybrid Systems.
FORMATS 2007: 320-335 |
| 94 | EE | Andreas Podelski,
Silke Wagner:
A Sound and Complete Proof Rule for Region Stability of Hybrid Systems.
HSCC 2007: 750-753 |
| 93 | EE | Andreas Podelski,
Andrey Rybalchenko:
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement.
PADL 2007: 245-259 |
| 92 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Proving thread termination.
PLDI 2007: 320-330 |
| 91 | EE | Byron Cook,
Alexey Gotsman,
Andreas Podelski,
Andrey Rybalchenko,
Moshe Y. Vardi:
Proving that programs eventually do something good.
POPL 2007: 265-276 |
| 90 | EE | Alexander Malkis,
Andreas Podelski,
Andrey Rybalchenko:
Precise Thread-Modular Verification.
SAS 2007: 218-232 |
| 89 | EE | Mohamed Nassim Seghir,
Andreas Podelski:
ACSAR: Software Model Checking with Transfinite Refinement.
SPIN 2007: 274-278 |
| 88 | EE | 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 |
| 87 | EE | Andreas Podelski,
Andrey Rybalchenko:
Transition predicate abstraction and fair termination.
ACM Trans. Program. Lang. Syst. 29(3): (2007) |
| 86 | EE | 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- (2007) |
| 2006 |
|---|
| 85 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Terminator: Beyond Safety.
CAV 2006: 415-418 |
| 84 | EE | Andreas Podelski,
Silke Wagner:
Model Checking of Hybrid Systems: From Reachability Towards Stability.
HSCC 2006: 507-521 |
| 83 | EE | Alexander Malkis,
Andreas Podelski,
Andrey Rybalchenko:
Thread-Modular Verification Is Cartesian Abstract Interpretation.
ICTAC 2006: 183-197 |
| 82 | EE | 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 |
| 81 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Termination proofs for systems code.
PLDI 2006: 415-426 |
| 80 | EE | Klaus Dräger,
Bernd Finkbeiner,
Andreas Podelski:
Directed Model Checking with Distance-Preserving Abstractions.
SPIN 2006: 19-34 |
| 79 | EE | Thomas Wies,
Viktor Kuncak,
Patrick Lam,
Andreas Podelski,
Martin C. Rinard:
Field Constraint Analysis.
VMCAI 2006: 157-173 |
| 78 | EE | Thomas Wies,
Viktor Kuncak,
Karen Zee,
Andreas Podelski,
Martin C. Rinard:
On Verifying Complex Properties using Symbolic Shape Analysis
CoRR abs/cs/0609104: (2006) |
| 77 | EE | Kurt Jensen,
Andreas Podelski:
Tools and algorithms for the construction and analysis of systems.
STTT 8(3): 177-179 (2006) |
| 2005 |
|---|
| 76 | EE | Andreas Podelski,
Ina Schaefer,
Silke Wagner:
Summaries for While Programs with Recursion.
ESOP 2005: 94-107 |
| 75 | EE | Andreas Podelski,
Andrey Rybalchenko:
Transition predicate abstraction and fair termination.
POPL 2005: 132-144 |
| 74 | EE | Andreas Podelski,
Thomas Wies:
Boolean Heaps.
SAS 2005: 268-283 |
| 73 | EE | Byron Cook,
Andreas Podelski,
Andrey Rybalchenko:
Abstraction Refinement for Termination.
SAS 2005: 87-101 |
| 72 | EE | Amir Pnueli,
Andreas Podelski,
Andrey Rybalchenko:
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems.
TACAS 2005: 124-139 |
| 71 | EE | Bruno Blanchet,
Andreas Podelski:
Verification of cryptographic protocols: tagging enforces termination.
Theor. Comput. Sci. 333(1-2): 67-90 (2005) |
| 70 | EE | Kurt Jensen,
Andreas Podelski:
Special issue.
Theor. Comput. Sci. 345(1): 1 (2005) |
| 2004 |
|---|
| 69 | | 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
Springer 2004 |
| 68 | EE | Andreas Podelski:
Constraints in Program Analysis and Verification.
CP 2004: 1-4 |
| 67 | EE | Andreas Podelski,
Andrey Rybalchenko:
Transition Invariants.
LICS 2004: 32-41 |
| 66 | EE | Andreas Podelski,
Andrey Rybalchenko:
A Complete Method for the Synthesis of Linear Ranking Functions.
VMCAI 2004: 239-251 |
| 65 | | 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) |
| 2003 |
|---|
| 64 | EE | Bruno Blanchet,
Andreas Podelski:
Verification of Cryptographic Protocols: Tagging Enforces Termination.
FoSSaCS 2003: 136-152 |
| 63 | EE | Andreas Podelski:
Software Model Checking with Abstraction Refinement.
VMCAI 2003: 1-3 |
| 62 | EE | Thomas Ball,
Andreas Podelski,
Sriram K. Rajamani:
Boolean and Cartesian abstraction for model checking C programs.
STTT 5(1): 49-58 (2003) |
| 2002 |
|---|
| 61 | EE | Witold Charatonik,
Supratik Mukhopadhyay,
Andreas Podelski:
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP.
ICLP 2002: 115-129 |
| 60 | EE | Supratik Mukhopadhyay,
Andreas Podelski:
An Algebraic Framework for Abstract Model Checking.
SARA 2002: 152-169 |
| 59 | EE | Thomas Ball,
Andreas Podelski,
Sriram K. Rajamani:
Relative Completeness of Abstraction Refinement for Software Model Checking.
TACAS 2002: 158-172 |
| 58 | EE | Witold Charatonik,
Supratik Mukhopadhyay,
Andreas Podelski:
Compositional Termination Analysis of Symbolic Forward Analysis.
VMCAI 2002: 109-125 |
| 57 | EE | Witold Charatonik,
Andreas Podelski:
Set Constraints with Intersection.
Inf. Comput. 179(2): 213-229 (2002) |
| 2001 |
|---|
| 56 | EE | Supratik Mukhopadhyay,
Andreas Podelski:
Accurate Widenings and Boundedness Properties of Timed Systems.
Ershov Memorial Conference 2001: 79-94 |
| 55 | EE | Supratik Mukhopadhyay,
Andreas Podelski:
Constraint Database Models Characterizing Timed Bisimilarity.
PADL 2001: 245-258 |
| 54 | EE | Pablo Argón,
Giorgio Delzanno,
Supratik Mukhopadhyay,
Andreas Podelski:
Model Checking Communication Protocols.
SOFSEM 2001: 160-170 |
| 53 | EE | Thomas Ball,
Andreas Podelski,
Sriram K. Rajamani:
Boolean and Cartesian Abstraction for Model Checking C Programs.
TACAS 2001: 268-283 |
| 52 | EE | Giorgio Delzanno,
Andreas Podelski:
Constraint-based deductive model checking.
STTT 3(3): 250-270 (2001) |
| 2000 |
|---|
| 51 | EE | Supratik Mukhopadhyay,
Andreas Podelski:
Model Checking for Timed Logic Processes.
Computational Logic 2000: 598-612 |
| 50 | EE | Javier Esparza,
Andreas Podelski:
Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs.
POPL 2000: 1-11 |
| 49 | EE | Witold Charatonik,
Andreas Podelski,
Jean-Marc Talbot:
Paths vs. Trees in Set-Based Program Analysis.
POPL 2000: 330-337 |
| 48 | | Andreas Podelski:
Model Checking as Constraint Solving.
SAS 2000: 22-37 |
| 47 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Ordering Constraints over Feature Trees.
Constraints 5(1/2): 7-41 (2000) |
| 1999 |
|---|
| 46 | | Giorgio Delzanno,
Javier Esparza,
Andreas Podelski:
Constraint-Based Analysis of Broadcast Protocols.
CSL 1999: 50-66 |
| 45 | EE | Andreas Podelski,
Witold Charatonik,
Martin Müller:
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs.
ESOP 1999: 177-192 |
| 44 | EE | Supratik Mukhopadhyay,
Andreas Podelski:
Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata.
FSTTCS 1999: 232-244 |
| 43 | | Giorgio Delzanno,
Andreas Podelski:
Verification of Infinite-State Systems in Constraint Logic Programming.
JFPLC 1999: 13-22 |
| 42 | EE | Giorgio Delzanno,
Andreas Podelski:
Model Checking in CLP.
TACAS 1999: 223-239 |
| 1998 |
|---|
| 41 | | Witold Charatonik,
David A. McAllester,
Damian Niwinski,
Andreas Podelski,
Igor Walukiewicz:
The Horn Mu-calculus.
LICS 1998: 58-69 |
| 40 | EE | Witold Charatonik,
Andreas Podelski:
Co-definite Set Constraints.
RTA 1998: 211-225 |
| 39 | EE | Witold Charatonik,
Andreas Podelski:
Directional Type Inference for Logic Programs.
SAS 1998: 278-294 |
| 38 | EE | Witold Charatonik,
Andreas Podelski:
Set-Based Analysis of Reactive Infinite-State Systems.
TACAS 1998: 358-375 |
| 1997 |
|---|
| 37 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Ordering Constraints over Feature Trees.
CP 1997: 297-311 |
| 36 | | Leszek Pacholski,
Andreas Podelski:
Set Constraints: A Pearl in Research on Constraints.
CP 1997: 549-562 |
| 35 | | Abdelwaheb Ayari,
David A. Basin,
Andreas Podelski:
LISA: A Specification Language Based on WS2S.
CSL 1997: 18-34 |
| 34 | | Andreas Podelski:
Set-Based Analysis of Logic Programs and Reactive Logic Programs (Abstract).
ILPS 1997: 35-36 |
| 33 | EE | Witold Charatonik,
Andreas Podelski:
Set Constraints with Intersection.
LICS 1997: 362-372 |
| 32 | | Martin Müller,
Joachim Niehren,
Andreas Podelski:
Inclusion Constraints over Non-empty Sets of Trees.
TAPSOFT 1997: 345-356 |
| 31 | | Hassan Aït-Kaci,
Andreas Podelski,
Seth Copen Goldstein:
Order Sorted Feature Theory Unification.
J. Log. Program. 30(2): 99-124 (1997) |
| 30 | | Maurice Nivat,
Andreas Podelski:
Minimal Ascending and Descending Tree Automata.
SIAM J. Comput. 26(1): 39-58 (1997) |
| 29 | EE | Andreas Podelski,
Gert Smolka:
Situated Simplification.
Theor. Comput. Sci. 173(1): 235-252 (1997) |
| 1996 |
|---|
| 28 | | Witold Charatonik,
Andreas Podelski:
The Independence Property of a Class of Set Constraints.
CP 1996: 76-90 |
| 1995 |
|---|
| 27 | | Andreas Podelski:
Constraint Programming: Basics and Trends, Châtillon Spring School, Châtillon-sur-Seine, France, May 16 - 20, 1994, Selected Papers
Springer 1995 |
| 26 | | Andreas Podelski,
Gert Smolka:
Situated Simplification.
CP 1995: 328-344 |
| 25 | | Andreas Podelski,
Peter Van Roy:
A Detailed Algorithm Testing Guards over Feature Trees.
Constraint Processing, Selected Papers 1995: 11-38 |
| 24 | | Andreas Podelski,
Gert Smolka:
Operational Semantics of Constraint Logic Programs with Coroutining.
ICLP 1995: 449-463 |
| 23 | | Andreas Podelski,
Gert Smolka:
Situated Simplification.
ICLP 1995: 826 |
| 1994 |
|---|
| 22 | | 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 |
| 21 | EE | Hassan Aït-Kaci,
Andreas Podelski:
Functions as Passive Constraints in LIFE.
ACM Trans. Program. Lang. Syst. 16(4): 1279-1318 (1994) |
| 20 | | 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) |
| 19 | | Danièle Beauquier,
Andreas Podelski:
Rabin Tree Automata and Finite Monoids.
Theor. Comput. Sci. 134(1): 13-25 (1994) |
| 1993 |
|---|
| 18 | | Hassan Aït-Kaci,
Andreas Podelski,
Seth Copen Goldstein:
Order-Sorted Feature Theory Unification.
ILPS 1993: 506-524 |
| 17 | | Andreas Podelski,
Peter Van Roy:
The Beauty and the Beast Algorithm.
ILPS 1993: 653 |
| 16 | | Hassan Aït-Kaci,
Andreas Podelski:
Entailment and Disentailment of Order-Sorted Feature Constraints.
LPAR 1993: 1-18 |
| 15 | | Danièle Beauquier,
Andreas Podelski:
Rabin Tree Automata and Finite Monoids.
MFCS 1993: 262-271 |
| 14 | | Hugues Calbrix,
Maurice Nivat,
Andreas Podelski:
Ultimately Periodic Words of Rational w-Languages.
MFPS 1993: 554-566 |
| 13 | | Hassan Aït-Kaci,
Andreas Podelski:
Entailment and Disentailment of Order-Sorted Feature Constraints.
PPCP 1993: 1-6 |
| 12 | | Joachim Niehren,
Andreas Podelski,
Ralf Treinen:
Equational and Membership Constraints for Finite Trees.
RTA 1993: 106-120 |
| 11 | | Joachim Niehren,
Andreas Podelski:
Feature Automata and Recognizable Sets of Feature Trees.
TAPSOFT 1993: 356-375 |
| 10 | EE | Maurice Nivat,
Andreas Podelski:
Another variation on the common subexpression problem.
Discrete Mathematics 114(1-3): 379-401 (1993) |
| 9 | | Hassan Aït-Kaci,
Andreas Podelski:
Towards a Meaning of LIFE.
J. Log. Program. 16(3): 195-234 (1993) |
| 1992 |
|---|
| 8 | | Maurice Nivat,
Andreas Podelski:
Tree Automata and Languages.
North-Holland 1992 |
| 7 | | Hassan Aït-Kaci,
Andreas Podelski:
Logic Programming with Functions over Order-Sorted Feature Terms.
ELP 1992: 100-119 |
| 6 | | Hassan Aït-Kaci,
Andreas Podelski,
Gert Smolka:
A Feature-Based Constraint System for Logic Programming with Entailment.
FGCS 1992: 1012-1021 |
| 5 | | Pierre Péladeau,
Andreas Podelski:
On Reverse and General Definite Tree Languages (Extended Abstract).
ICALP 1992: 150-161 |
| 4 | | Andreas Podelski:
A monoid approach to tree automata.
Tree Automata and Languages 1992: 41-56 |
| 1991 |
|---|
| 3 | | Hassan Aït-Kaci,
Andreas Podelski:
Towards a Meaning of LIFE.
PLILP 1991: 255-274 |
| 2 | | 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) |
| 1989 |
|---|
| 1 | | Maurice Nivat,
Andreas Podelski:
Definite tree languages.
Bulletin of the EATCS 38: 186-190 (1989) |
