Database Entry Point
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

Publications Master Template, generated: 14:41, 22 September 2019

Search the publication database

  . Return

Your search returned the following 65 documents:

  1. Andreas Podelski and Silke Wagner
    A Method and a Tool for Automatic Verification of Region Stability for Hybrid Systems
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2007-2-001, Research Report
    [PDF: Download: MPI-I-2007-2-001.pdf]
  2. Andreas Podelski and Silke Wagner
    A Sound and Complete Proof Rule for Region Stability of Hybrid Systems
    In: Hybrid systems: computation and control : 10th International Conference, HSCC 2007, Pisa, Italy, 2007, 750-753

  3. Andreas Podelski and Andrey Rybalchenko
    ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
    In: Practical aspects of declarative languages : 9th International Symposium, PADL 2007, Nice, France, 2007, 245-259

  4. Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, and Moshe Vardi
    Proving that programs eventually do something good
    In: 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007), Nice, France, 2007, 265-276
  5. Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    Proving Thread Termination
    In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, CA, USA, 2007, 320-330

  6. Silke Wagner and Andreas Podelski
    Region Stability Proofs for Hybrid Systems
    In: Formal Modelling and Analysis of Timed Systems: 5th International Conference, FORMATS 2007, Salzburg, Austria, 2007, 16 p.
  7. Andreas Podelski and Andrey Rybalchenko
    Transition Predicate Abstraction and Fair Termination
    ACM Transactions on Programming Languages and Systems 29 (3): 30 p., 2007
  8. Klaus Dräge, Bernd Finkbeiner, and Andreas Podelski
    Directed Model Checking with Distance-Preserving Abstractions
    In: Model checking software : 13th International SPIN Workshop, Vienna, Austria, 2006, 19-34
  9. Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin C. Rinard
    Field Constraint Analysis
    In: Verification, Model Checking, and Abstract Interpretation : 7th International Conference, VMCAI 2006, Charleston, SC, USA, 2006, 157-173
    [PDF: Download: field-constraint-analysis.pdf]
  10. Andreas Podelski and Silke Wagner
    Model Checking of Hybrid Systems: From Reachability towards Stability
    In: Hybrid Systems: Computation and Control : 9th International Workshop, HSCC 2006 , Santa Barbara, CA, USA, 2006, 507-521
  11. Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    Termination Proofs for Systems Code
    In: PLDI 2006 : Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Ontario, Canada, 2006, 415-426
  12. Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    Terminator: Beyond Safety
    In: Computer aided verification : 18th International Conference, CAV 2006, Seattle, WA, USA, 2006, 415-418
  13. Ganesh Gopalakrishnan and John O'Leary(Ed.)
    Alexander Malkis, Andreas Podelski, and Andrey Rybalchenko
    Thread-Modular Verification and Cartesian Abstraction


  14. Alexander Malkis, Andreas Podelski, and Andrey Rybalchenko
    Thread-Modular Verification is Cartesian Abstract Interpretation
    In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, Tunis, Tunisia, 2006, 183-197
  15. Kurt Jensen and Andreas Podelski
    Tools and algorithms for the construction and analysis of systems
    International Journal on Software Tools for Technology Transfer 8 (3): 177-179, 2006
  16. Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    Abstraction-refinement for Termination
    In: Static analysis : 12th International Symposium, SAS 2005, London, UK, 2005, 87-101
  17. Andreas Podelski and Thomas Wies
    Boolean Heaps
    In: Static analysis : 12th International Symposium, SAS 2005, London, UK, 2005, 268-283
  18. Andreas Podelski, Andrey Rybalchenko, and Byron Cook
    Counterexample-Guided Abstraction Refinement for Termination

  19. Amir Pnueli, Andreas Podelski, and Andrey Rybalchenko
    Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
    In: Tools and Algorithms for the Construction and Analysis of Systems: 11th International Conference, TACAS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, 2005, 124-139
  20. Andreas Podelski, Ina Schaefer, and Silke Wagner
    Summaries for While Programs with Recursion
    In: Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, 2005, 94-107

  21. Andreas Podelski and Andrey Rybalchenko
    Transition predicate abstraction and fair termination
    In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, CA, USA, 2005, 124-139
  22. Bruno Blanchet and Andreas Podelski
    Verification of Cryptographic Protocols: Tagging Enforces Termination
    Theoretical Computer Science 333 (1-2): 67-90, 2005
  23. Andreas Podelski and Andrey Rybalchenko
    A Complete Method for the Synthesis of Linear Ranking Functions
    In: Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, Venice, Italy, 2004, 239-251
  24. Andreas Podelski
    Introduction to the Special Issue on Verification and Computational Logic
    Theory and Practice of Logic Programming (TPLP) 4 (5-6): 541-751, 2004
  25. Andreas Podelski, Ina Schaefer, and Silke Wagner
    Summaries for While Programs with Recursion
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-2-007, Research Report
    [PS: Download: 85998158.ps]
  26. Andreas Podelski and Andrey Rybalchenko
    Transition Invariants
    In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, Turku, Finland, 2004, 32-41
  27. Andreas Podelski, Tom Ball, and Sriram K. Rajamani
    Boolean and Cartesian Abstraction for Model Checking C Programs
    International Journal on Software Tools for Technology Transfer (STTT) 5 (3): 1-15, 2003
  28. Andreas Podelski
    Software Model Checking with Abstraction Refinement
    In: Verification, model checking, and abstract interpretation : 4th International Conference, VMCAI 2003, New York, NY (USA), Januray, 2003, 1-13
  29. Bruno Blanchet and Andreas Podelski
    Verification of Cryptographic Protocols: Tagging Enforces Termination
    In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, Warsaw, Poland, April, 2003, 136-152
  30. Supratik Mukhopadhyay and Andreas Podelski
    An Algebraic Framework for Abstract Model Checking
    In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, Montreal, 2002, 152-169
  31. Witold Charatonik, Supratik Mukhopadhyay, and Andreas Podelski
    Compositional Termination Analysis of Symbolic Forward Analysis
    In: Verification, Model Checking, and Abstract Interpretation. Third International Workshop, VMCAI 2002, Venice, Italy, 2002, 109-125
  32. Witold Charatonik, Supratik Mukhopadhyay, and Andreas Podelski
    Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
    In: Logic Programming. 18th International Conference, ICLP 2002, Copenhagen, Denmark, 2002, 115-129
  33. Thomas Hillenbrand, Andreas Podelski, and Dalibor Topić
    Is Logic Effective for Analyzing C Programs?
    In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, Saarbrücken, 2002, 27-30
    [PS: Download: analysis.ps]
  34. Andreas Podelski, Tom Ball, and Sriram K. Rajamani
    Relative Completeness of Abstraction Refinement for Software Model Checking
    In: Tools and algorithms for the construction and analysis of systems : 8th International Conference, TACAS 2002, Grenoble, France, 2002, 158-172
  35. Witold Charatonik and Andreas Podelski
    Set Constraints with Intersection
    Information and Computation 179 (2): 213-229, 2002
  36. Supratik Mukhopadhyay and Andreas Podelski
    Accurate Widenings and Boundedness Properties of Timed Systems
    In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, Novosibirsk, Russia, 1st-6th July, 2001, 2001, 79-94
  37. Thomas Ball, Andreas Podelski, and Sriram K. Rajamani
    Boolean and Cartesian Abstraction for Model Checking C Programs
    In: Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS-2001), Genova, Italy, April 2-6, 2001, 2001, 268-283
  38. Giorgio Delzanno and Andreas Podelski
    Constraint-based Deductive Model Checking
    International Journal on Software Tools for Technology Transfer (STTT) 3 (3): 250-270, 2001
  39. Supratik Mukhopadhyay and Andreas Podelski
    Constraint Database Models Characterizing Timed Bisimilarity
    In: Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages, Las Vegas, USA, March, 8 - March, 11, 2001, 245-258
    [PS: Download: mainsub.ps]
  40. Pablo Argon, Giorgio Delzanno, Supratik Mukhopadhyay, and Andreas Podelski
    Model Checking for Communication Protocols
    In: Proceedings of the 28th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM-2001), Piestany, Slovak Republic, November 24 -- December 1, 2001, 2001, 160-170. Note: To appear.
  41. Javier Esparza and Andreas Podelski
    Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs
    In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), Boston, Massachusetts, USA, 19-21 January 2000, 2000, 1-11
  42. Andreas Podelski
    Model Checking as Constraint Solving
    In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), Santa Barbara, California, USA, June 29 - July 1, 2000, 2000, 221-237
  43. Supratik Mukhopadhyay and Andreas Podelski
    Model Checking for Timed Logic Processes
    In: Proceedings of the 1st International Conference on Computational Logic, Imperial College, London, UK, 24-28 July, 2000, 2000, 598-612
  44. Martin Müller, Joachim Niehren, and Andreas Podelski
    Ordering Constraints over Feature Trees
    Constraints 5 (1/2): 7-41, 2000
  45. Witold Charatonik, Andreas Podelski, and Jean-Marc Talbot
    Paths vs. Trees in Set-based Program Analysis
    In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL-00), Boston, Massachusetts, USA, 19-21 January 2000, 2000, 330-337
  46. Supratik Mukhopadhyay and Andreas Podelski
    Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
    In: Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS-99), Chennai, India, December,13 - December, 15, 1999, 232-244
    [PS: Download: beyond.ps]
  47. Giorgio Delzanno, Javier Esparza, and Andreas Podelski
    Constraint-Based Analysis of Broadcast Protocols
    In: Proceedings of the 13th International Workshop on Computer Science Logic (CSL-99), 8th Annual Conference on the EACSL, Madrid, Spain, September 20-25, 1999, 1999, 50-66
  48. Giorgio Delzanno and Andreas Podelski
    Model Checking in CLP
    In: Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS-99), Amsterdam, The Netherlands, March, 22nd-26th, 1999, 223-239
  49. Andreas Podelski, Witold Charatonik, and Martin Müller
    Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs
    In: Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP-99), Amsterdam, The Netherlands, March, 22nd-26th, 1999, 177-192
  50. Witold Charatonik and Andreas Podelski
    Co-definite Set Constraints
    In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), Tsukuba, Japan, March 30 - April 1, 1998, 1998, 211-225
  51. Witold Charatonik and Andreas Podelski
    Directional Type Inference for Logic Programs
    In: Proceedings of the 5th International Symposium in Static Analysis (SAS-98), Pisa, Italy, September 14-16, 1998, 278-294
  52. Ayari Abdelwaheb, David A. Basin, and Andreas Podelski
    LISA: A Specification Language Based on WS2S
    In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), Aarhus, Denmark, August, 23 - 29, 1998, 18-34
  53. Witold Charatonik and Andreas Podelski
    Set-Based Analysis of Reactive Infinite-state Systems
    In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS-98), Lisbon, Portugal, March 28 - April 4, 1998, 358-375
  54. Witold Charatonik, David McAllester, Damian Niwinski, Andreas Podelski, and Igor Walukiewicz
    The Horn Mu-calculus
    In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), Indianapolis, Indiana, June 21-24, 1998, 58-69
  55. Andreas Podelski
    Thema der Antrittsvorlesung: Alte Resultate aus der Automatentheorie
    Habilitation thesis, Universität des Saarlandes, 1998
  56. Martin Müller, Joachim Niehren, and Andreas Podelski
    Inclusion Constraints over Non-empty Sets of Trees
    In: Proceedings of the 7th International Joint Conference CAAP/FASE: Theory and practice of software development (TAPSOFT-97), Lille, France, April, 1997, 345-356
  57. Maurice Nivat and Andreas Podelski
    Minimal Ascending and Descending Tree Automata
    SIAM Journal on Computing 26 (1): 39-58, 1997
  58. Martin Müller, Joachim Niehren, and Andreas Podelski
    Ordering Constraints over Feature Trees
    In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Linz, Austria, October 29 - November 1, 1997, 549-562
  59. Andreas Podelski
    Set-Based Analysis of Logic Programs and Reactive Logic Programs
    In: Proceedings of the International Symposium on Logic Programming (ILPS-14), Leuven, Belgium, July 8-12, 1997, 35-36
  60. Witold Charatonik and Andreas Podelski
    Set Constraints with Intersection
    In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), Warsaw, Poland, June 29 - July 2, 1997, 362-372
  61. Leszek Pacholski and Andreas Podelski
    Set Constraints: a Pearl in Research on Constraints
    In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97), Linz, Austria, Obctober 29 - November 1, 1997, 549-562
  62. Andreas Podelski and Gert Smolka
    Situated Simplification
    Theoretical Computer Science 173 (1): 235-252, 1997. Note: Preliminary Version in Ugo Montanari, editor, Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95). Springer LNCS 976, 1995.
  63. Witold Charatonik and Andreas Podelski
    The Independence Property of a Class of Set Constraints
    In: Principles and Practice of Constraint Programming, Proceedings of the Second International Conference (CP'96), Cambridge, USA, August 19-22, 1996, 76-90
  64. Andreas Podelski and Gert Smolka
    Operational Semantics of Constraint Logic Programming with Coroutining
    In: Proceedings of the 12th International Conference on Logic Programming, Kanagawa, Japan, June, 1995, 449-463
  65. Andreas Podelski and Gert Smolka
    Situated Simplification
    In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95), Cassis, France, September, 1995, 328-344