Your search returned the following 65 documents:

65. A Method and a Tool for Automatic Verification of Region Stability for Hybrid Systems
    Andreas Podelski and Silke Wagner
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2007-2-001, Research Report
    [PDF: Download: MPI-I-2007-2-001.pdf]
    
64. A Sound and Complete Proof Rule for Region Stability of Hybrid Systems
    Andreas Podelski and Silke Wagner
    In: Hybrid systems: computation and control : 10th International Conference, HSCC 2007, Pisa, Italy, 2007, 750-753
    
    
63. ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
    Andreas Podelski and Andrey Rybalchenko
    In: Practical aspects of declarative languages : 9th International Symposium, PADL 2007, Nice, France, 2007, 245-259
    
    
62. Proving that programs eventually do something good
    Byron Cook, Alexey Gotsman, Andreas Podelski, Andrey Rybalchenko, and Moshe Vardi
    In: 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2007), Nice, France, 2007, 265-276
    
61. Proving Thread Termination
    Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    In: PLDI'07 : Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, CA, USA, 2007, 320-330
    
    
60. Region Stability Proofs for Hybrid Systems
    Silke Wagner and Andreas Podelski
    In: Formal Modelling and Analysis of Timed Systems: 5th International Conference, FORMATS 2007, Salzburg, Austria, 2007, 16 p.
    
59. Transition Predicate Abstraction and Fair Termination
    Andreas Podelski and Andrey Rybalchenko
    ACM Transactions on Programming Languages and Systems 29 (3): 30 p., 2007
    
58. Directed Model Checking with Distance-Preserving Abstractions
    Klaus Dräge, Bernd Finkbeiner, and Andreas Podelski
    In: Model checking software : 13th International SPIN Workshop, Vienna, Austria, 2006, 19-34
    
57. Field Constraint Analysis
    Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin C. Rinard
    In: Verification, Model Checking, and Abstract Interpretation : 7th International Conference, VMCAI 2006, Charleston, SC, USA, 2006, 157-173
    [PDF: Download: field-constraint-analysis.pdf]
    
56. Model Checking of Hybrid Systems: From Reachability towards Stability
    Andreas Podelski and Silke Wagner
    In: Hybrid Systems: Computation and Control : 9th International Workshop, HSCC 2006 , Santa Barbara, CA, USA, 2006, 507-521
    
55. Termination Proofs for Systems Code
    Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    In: PLDI 2006 : Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, Ottawa, Ontario, Canada, 2006, 415-426
    
54. Terminator: Beyond Safety
    Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    In: Computer aided verification : 18th International Conference, CAV 2006, Seattle, WA, USA, 2006, 415-418
    
53. Thread-Modular Verification and Cartesian Abstraction
    Ganesh Gopalakrishnan and John O'Leary(Ed.)
    Alexander Malkis, Andreas Podelski, and Andrey Rybalchenko
    
    
    
52. Thread-Modular Verification is Cartesian Abstract Interpretation
    Alexander Malkis, Andreas Podelski, and Andrey Rybalchenko
    In: Theoretical Aspects of Computing - ICTAC 2006 : Third International Colloquium, Tunis, Tunisia, 2006, 183-197
    
51. Tools and algorithms for the construction and analysis of systems
    Kurt Jensen and Andreas Podelski
    International Journal on Software Tools for Technology Transfer 8 (3): 177-179, 2006
    
50. Abstraction-refinement for Termination
    Byron Cook, Andreas Podelski, and Andrey Rybalchenko
    In: Static analysis : 12th International Symposium, SAS 2005, London, UK, 2005, 87-101
    
49. Boolean Heaps
    Andreas Podelski and Thomas Wies
    In: Static analysis : 12th International Symposium, SAS 2005, London, UK, 2005, 268-283
    
48. Counterexample-Guided Abstraction Refinement for Termination
    Andreas Podelski, Andrey Rybalchenko, and Byron Cook
    
    
47. Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
    Amir Pnueli, Andreas Podelski, and Andrey Rybalchenko
    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
    
46. Summaries for While Programs with Recursion
    Andreas Podelski, Ina Schaefer, and Silke Wagner
    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
    
    
45. Transition predicate abstraction and fair termination
    Andreas Podelski and Andrey Rybalchenko
    In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, CA, USA, 2005, 124-139
    
44. Verification of Cryptographic Protocols: Tagging Enforces Termination
    Bruno Blanchet and Andreas Podelski
    Theoretical Computer Science 333 (1-2): 67-90, 2005
    
43. A Complete Method for the Synthesis of Linear Ranking Functions
    Andreas Podelski and Andrey Rybalchenko
    In: Verification, model checking, and abstract interpretation : 5th International Conference, VMCAI 2004, Venice, Italy, 2004, 239-251
    
42. Introduction to the Special Issue on Verification and Computational Logic
    Andreas Podelski
    Theory and Practice of Logic Programming (TPLP) 4 (5-6): 541-751, 2004
    
41. Summaries for While Programs with Recursion
    Andreas Podelski, Ina Schaefer, and Silke Wagner
    Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, MPI-I-2004-2-007, Research Report
    [PS: Download: 85998158.ps]
    
40. Transition Invariants
    Andreas Podelski and Andrey Rybalchenko
    In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, LICS 2004, Turku, Finland, 2004, 32-41
    
39. Boolean and Cartesian Abstraction for Model Checking C Programs
    Andreas Podelski, Tom Ball, and Sriram K. Rajamani
    International Journal on Software Tools for Technology Transfer (STTT) 5 (3): 1-15, 2003
    
38. Software Model Checking with Abstraction Refinement
    Andreas Podelski
    In: Verification, model checking, and abstract interpretation : 4th International Conference, VMCAI 2003, New York, NY (USA), Januray, 2003, 1-13
    
37. Verification of Cryptographic Protocols: Tagging Enforces Termination
    Bruno Blanchet and Andreas Podelski
    In: Foundations of software science and computation structures : 6th International Conference, FOSSACS 2003, Warsaw, Poland, April, 2003, 136-152
    
36. An Algebraic Framework for Abstract Model Checking
    Supratik Mukhopadhyay and Andreas Podelski
    In: Abstraction, reformulation, and approximation : 5th International Symposium, SARA 2002, Montreal, 2002, 152-169
    
35. Compositional Termination Analysis of Symbolic Forward Analysis
    Witold Charatonik, Supratik Mukhopadhyay, and Andreas Podelski
    In: Verification, Model Checking, and Abstract Interpretation. Third International Workshop, VMCAI 2002, Venice, Italy, 2002, 109-125
    
34. Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
    Witold Charatonik, Supratik Mukhopadhyay, and Andreas Podelski
    In: Logic Programming. 18th International Conference, ICLP 2002, Copenhagen, Denmark, 2002, 115-129
    
33. Is Logic Effective for Analyzing C Programs?
    Thomas Hillenbrand, Andreas Podelski, and Dalibor Topić
    In: Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi, Saarbrücken, 2002, 27-30
    [PS: Download: analysis.ps]
    
32. Relative Completeness of Abstraction Refinement for Software Model Checking
    Andreas Podelski, Tom Ball, and Sriram K. Rajamani
    In: Tools and algorithms for the construction and analysis of systems : 8th International Conference, TACAS 2002, Grenoble, France, 2002, 158-172
    
31. Set Constraints with Intersection
    Witold Charatonik and Andreas Podelski
    Information and Computation 179 (2): 213-229, 2002
    
30. Accurate Widenings and Boundedness Properties of Timed Systems
    Supratik Mukhopadhyay and Andreas Podelski
    In: Perspectives of System Informatics: 4th International Andrei Ershov Memorial Conference, Novosibirsk, Russia, 1st-6th July, 2001, 2001, 79-94
    
29. Boolean and Cartesian Abstraction for Model Checking C Programs
    Thomas Ball, Andreas Podelski, and Sriram K. Rajamani
    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
    
28. Constraint-based Deductive Model Checking
    Giorgio Delzanno and Andreas Podelski
    International Journal on Software Tools for Technology Transfer (STTT) 3 (3): 250-270, 2001
    
27. Constraint Database Models Characterizing Timed Bisimilarity
    Supratik Mukhopadhyay and Andreas Podelski
    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]
    
26. Model Checking for Communication Protocols
    Pablo Argon, Giorgio Delzanno, Supratik Mukhopadhyay, and Andreas Podelski
    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.
    
25. Efficient Algorithms for Pre$^\star$ and Post$^\star$ on Interprocedural Parallel Flow Graphs
    Javier Esparza and Andreas Podelski
    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
    
24. Model Checking as Constraint Solving
    Andreas Podelski
    In: Proceedings of the 7th International Symposium on Static Analysis (SAS-00), Santa Barbara, California, USA, June 29 - July 1, 2000, 2000, 221-237
    
23. Model Checking for Timed Logic Processes
    Supratik Mukhopadhyay and Andreas Podelski
    In: Proceedings of the 1st International Conference on Computational Logic, Imperial College, London, UK, 24-28 July, 2000, 2000, 598-612
    
22. Ordering Constraints over Feature Trees
    Martin Müller, Joachim Niehren, and Andreas Podelski
    Constraints 5 (1/2): 7-41, 2000
    
21. Paths vs. Trees in Set-based Program Analysis
    Witold Charatonik, Andreas Podelski, and Jean-Marc Talbot
    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
    
20. Beyond Region Graphs: Symbolic Forward Analysis of Timed Automata
    Supratik Mukhopadhyay and Andreas Podelski
    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]
    
19. Constraint-Based Analysis of Broadcast Protocols
    Giorgio Delzanno, Javier Esparza, and Andreas Podelski
    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
    
18. Model Checking in CLP
    Giorgio Delzanno and Andreas Podelski
    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
    
17. Set-based Failure Analysis for Logic Programs and Concurrent Constraint Programs
    Andreas Podelski, Witold Charatonik, and Martin Müller
    In: Programming Languages and Systems: Proceedings of the 8th European Symposium on Programming (ESOP-99), Amsterdam, The Netherlands, March, 22nd-26th, 1999, 177-192
    
16. Co-definite Set Constraints
    Witold Charatonik and Andreas Podelski
    In: Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA-98), Tsukuba, Japan, March 30 - April 1, 1998, 1998, 211-225
    
15. Directional Type Inference for Logic Programs
    Witold Charatonik and Andreas Podelski
    In: Proceedings of the 5th International Symposium in Static Analysis (SAS-98), Pisa, Italy, September 14-16, 1998, 278-294
    
14. LISA: A Specification Language Based on WS2S
    Ayari Abdelwaheb, David A. Basin, and Andreas Podelski
    In: Proceedings of the 11th International Workshop on Computer Science Logic (CSL-97), Aarhus, Denmark, August, 23 - 29, 1998, 18-34
    
13. Set-Based Analysis of Reactive Infinite-state Systems
    Witold Charatonik and Andreas Podelski
    In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS-98), Lisbon, Portugal, March 28 - April 4, 1998, 358-375
    
12. The Horn Mu-calculus
    Witold Charatonik, David McAllester, Damian Niwinski, Andreas Podelski, and Igor Walukiewicz
    In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), Indianapolis, Indiana, June 21-24, 1998, 58-69
    
11. Thema der Antrittsvorlesung: Alte Resultate aus der Automatentheorie
    Andreas Podelski
    Habilitation thesis, Universität des Saarlandes, 1998
    
10. Inclusion Constraints over Non-empty Sets of Trees
    Martin Müller, Joachim Niehren, and Andreas Podelski
    In: Proceedings of the 7th International Joint Conference CAAP/FASE: Theory and practice of software development (TAPSOFT-97), Lille, France, April, 1997, 345-356
    
9. Minimal Ascending and Descending Tree Automata
   Maurice Nivat and Andreas Podelski
   SIAM Journal on Computing 26 (1): 39-58, 1997
   
8. Ordering Constraints over Feature Trees
   Martin Müller, Joachim Niehren, and Andreas Podelski
   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
   
7. Set-Based Analysis of Logic Programs and Reactive Logic Programs
   Andreas Podelski
   In: Proceedings of the International Symposium on Logic Programming (ILPS-14), Leuven, Belgium, July 8-12, 1997, 35-36
   
6. Set Constraints with Intersection
   Witold Charatonik and Andreas Podelski
   In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), Warsaw, Poland, June 29 - July 2, 1997, 362-372
   
5. Set Constraints: a Pearl in Research on Constraints
   Leszek Pacholski and Andreas Podelski
   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
   
4. Situated Simplification
   Andreas Podelski and Gert Smolka
   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.
   
3. The Independence Property of a Class of Set Constraints
   Witold Charatonik and Andreas Podelski
   In: Principles and Practice of Constraint Programming, Proceedings of the Second International Conference (CP'96), Cambridge, USA, August 19-22, 1996, 76-90
   
2. Operational Semantics of Constraint Logic Programming with Coroutining
   Andreas Podelski and Gert Smolka
   In: Proceedings of the 12th International Conference on Logic Programming, Kanagawa, Japan, June, 1995, 449-463
   
1. Situated Simplification
   Andreas Podelski and Gert Smolka
   In: Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP'95), Cassis, France, September, 1995, 328-344