The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Podelski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  92. Useless Actions Are Useful. [Citation Graph (, )][DBLP]


  93. Composing Reachability Analyses of Hybrid Systems for Safety and Stability. [Citation Graph (, )][DBLP]


  94. Explicit Fair Scheduling for Dynamic Control. [Citation Graph (, )][DBLP]


  95. Faster Than Uppaal? [Citation Graph (, )][DBLP]


  96. Heap Assumptions on Demand. [Citation Graph (, )][DBLP]


  97. It's Doomed; We Can Prove It. [Citation Graph (, )][DBLP]


  98. Counterexample-guided focus. [Citation Graph (, )][DBLP]


  99. Nested interpolants. [Citation Graph (, )][DBLP]


  100. Abstraction Refinement for Quantified Array Assertions. [Citation Graph (, )][DBLP]


  101. Refinement of Trace Abstraction. [Citation Graph (, )][DBLP]


  102. Thread-Modular Counterexample-Guided Abstraction Refinement. [Citation Graph (, )][DBLP]


  103. Size-Change Termination and Transition Invariants. [Citation Graph (, )][DBLP]


  104. Transition-Based Directed Model Checking. [Citation Graph (, )][DBLP]


  105. Fairness for Dynamic Control. [Citation Graph (, )][DBLP]


  106. Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? [Citation Graph (, )][DBLP]


  107. Verification, Least-Fixpoint Checking, Abstraction. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.028secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002