Interactive verification of concurrent systems using symbolic execution

AI Communications

Volumn 23, Issue 2-3, 2010, Pages 285-307

  Bäumler, Simon ^a   Balser, Michael ^a   Nafz, Florian ^a   Reif, Wolfgang ^a   Schellhorn, Gerhard ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Compositional reasoning; Interactive verification; Temporal logic; Theorem prover

Indexed keywords

COMPOSITIONAL REASONING; CONCURRENT SYSTEMS; FIRST-ORDER; INFINITE STATE; INTERACTIVE PROOFS; INTERACTIVE VERIFICATION; LINEAR TEMPORAL LOGIC; PARALLEL PROGRAM; PROOF METHODS; SEQUENTIAL PROGRAMS; SYMBOLIC EXECUTION; TEMPORAL PROPERTY; VERIFICATION ENVIRONMENT;

AUTOMATA THEORY; PARALLEL ARCHITECTURES;

TEMPORAL LOGIC;

EID: 77950221845     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2010-0458     Document Type: Conference Paper

References (45)

1. M. Abadi and L. Lamport, Conjoining specifications, ACM Transactions on Programming Languages and Systems 3 (1995), 507-535.
2. L. Aceto, W. Fokkink and C. Verhoef, Structural operational semantics, in: Handbook of Process Algebra, J.A. Bergstra, A. Ponse and S.A. Smolka, eds, Elsevier, Amsterdam, 2001.
3. K.R. Apt and E.-R. Olderog, Verification of Sequential and Concurrent Programs, Springer, Berlin, 1991.
4. M. Balser, Verifying concurrent system with symbolic execution -temporal reasoning is symbolic execution with a little induction, PhD thesis, University of Augsburg, Augsburg, Germany, 2005.
5. S. Bäumler, M. Balser, A. Dunets, W. Reif and J. Schmitt, Verification of medical guidelines by model checking: A case study, in: Proc. of the 13th International SPIN Workshop on Model Checking of Software, Vienna, LNCS, Vol.3925, Springer, 2006, pp. 219-233.
6. S. Bäumler,M. Balser, A. Knapp,W. Reif and A. Thums, Interactive verification of uml state machines, in: Formal Methods and Software Engineering, Seattle, LNCS, Vol.3308, Springer, 2004, pp. 434-448.
7. S. Bäumler, M. Balser, W. Reif and J. Schmitt, Synchronous parallelism in the asbru language. Technical Report 2008-11, University of Augsburg, 2008, available at: http://www.informatik.uni-augsburg.de/lehrstuehle/ swt/se/publications/.
8. S. Bäumler, F. Nafz, M. Balser and W. Reif, Compositional proofs with symbolic execution, in: Proceedings of the 5th International Verification Workshop in Connection with IJCAR' 2008, Sydney, CEUR Workshop Proceedings, Vol.372, CEUR, 2008.
9. S. Bäumler, G. Schellhorn, M. Balser and W. Reif, Proving linearizability with temporal logic, Technical Report 2008-19, Universität Augsburg, 2008, available at: http://www.informatik.uni-augsburg.de/lehrstuehle/ swt/se/publications/.
10. N. Bjørner, A. Brown, M. Colon, B. Finkbeiner, Z. Manna, H. Sipma and T. Uribe, Verifying temporal properties of reactive systems: A step tutorial, in: Formal Methods in System Design, Kluver, Boston, MA, 2000, pp. 227-270.
11. A. Cau and P. Collette, Parallel composition of assumptioncommitment specifications: A unifying approach for shared variable and distributed message passing concurrency, Acta Informatica 33(2) (1996), 153-176.
12. A. Cau, B. Moszkowski and H. Zedan, ITL -Interval Temporal Logic, Software Technology Research Laboratory, SERCentre, De Montfort University, The Gateway, Leicester LE1 9BH, UK, 2002, available at: www.cms.dmu.ac.uk/∼cau/ itlhomepage.
13. E. Clarke, O. Grumberg and D. Peled, Model Checking, MIT Press, Cambridge, MA, 2000.
14. W.-P. de Roever, F. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech,M. Poel and J. Zwiers, Concurrency Verification: Introduction to Compositional and Noncompositional Methods, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, UK, 2001.
15. J.-Y. Girard, P. Taylor and Y. Lafont, Proofs and Types, Cambridge University Press, New York, NY, USA, Boston, MA, 1989.
16. D. Harel, Dynamic logic, in: Handbook of Philosophical Logic, Vol.2, D. Gabbay and F. Guenther, eds, Reidel, 1984, pp. 496-604.
17. D. Harel and D. Peleg, Process logic with regular formulas, Theoretical Computer Science 38 (1985), 307-322.
18. D. Harel and E. Singerman, Computation path logic: An expressive, yet elementary, process logic, Annals of Pure and Applied Logic 96 (1999), 167-186.
19. M. Heisel,W. Reif andW. Stephan, A Dynamic Logic for Program Verification, in: Logical Foundations of Computer Science, A. Meyer and M. Taitslin, eds, LNCS, Vol.363, Berlin, 1989, pp. 134-145.
20. D. Hutter, H. Mantel, G. Rock, W. Stephan, A. Wolpers, M. Balser, W. Reif, G. Schellhorn and K. Stenzel, VSE: Controlling the complexity in formal software developments, in: Current Trends in Applied Formal Methods, Boppard, LNCS, Vol.1641, Springer, Germany, 1999, pp. 351-358.
21. C.B. Jones, Tentative steps toward a development method for interfering programs, ACM Transactions on Programming Languages and Systems 5(4) (1983), 596-619.
22. S. Kalvala, A formulation of TLA in Isabelle, June 1995, available at: http://www.research.digital.com/SRC/personal/lamport/ tla/tla.html.
23. KIV homepage, http://www.informatik.uni-augsburg.de/ swt/kiv.
24. L. Lamport, The temporal logic of actions, ACM Transactions on Programming Languages and Systems 16(3) (1994), 872-923.
25. L. Lamport, Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers, Addison-Wesley, Boston, MA, 2002.
26. L. Lamport, The +cal algorithm language, Technical report, Microsoft, 2006.
27. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer, Heidelberg/Berlin, 1991.
28. Z. Manna and A. Pnueli, Temporal Verification of Reactive Systems -Safety, Springer, Heidelberg/Berlin, 1995.
29. C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Boston, MA, 1980.
30. S. Merz, Mechanizing TLA in Isabelle, in: Workshop on Verification in New Orientations, R. Rodošek, ed., Univ. of Maribor, Maribor, July 1995, pp. 54-74.
31. J. Misra and K.M. Chandi, Proofs of networks of processes, IEEE Transactions of Software Engineering 7 (1981), 417-426.
32. B. Moszkowski, A temporal logic for multilevel reasoning about hardware, IEEE Computer 18(2) (1985), 10-19.
33. F. Ortmeier, M. Balser, A. Dunets and S. Bäumler, Embedding ctl* in an extension to interval temporal logic (itl), Technical Report 2008-2016, University of Augsburg, 2008.
34. F. Ortmeier, W. Reif and G. Schellhorn, Formal safety analysis of a radio-based railroad crossing using deductive causeconsequence analysis (DCCA), in: Proceedings of 5th European Dependable Computing Conference EDCC, Budapest, LNCS, Vol.3463, Springer, 2005, pp. 210-224.
35. F. Ortmeier, W. Reif and G. Schellhorn, Deductive causeconsequence analysis (DCCA), in: Proceedings of IFAC World Congress, Paris, Elsevier, 2006, pp. 284-293.
36. D. Peleg, Concurrent dynamic logic, Journal of ACM 34(2) (1987), 450-479.
37. G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Aarhus University, 1981.
38. A. Pnueli and T. Arons, Tlpvs: A pvs-based ltl verification system, in: Verification -Theory and Practice: Proceedings of an International Symposium in Honor of Zohar Manna's 64th Birthday, LNCS, Springer, Heidelberg/Berlin, 2003, pp. 84-98.
39. L. Prensa Nieto, The rely-guarantee method in isabelle/hol, in: European Symposium on Programming (ESOP'03), Warsaw, P. Degano, ed., LNCS, Vol.2618, Springer, 2003, pp. 348-362.
40. W. Reif, G. Schellhorn, K. Stenzel and M. Balser, Structured specifications and interactive proofs with KIV, in: Automated Deduction -A Basis for Applications,W. Bibel and P. Schmitt, eds, Systems and Implementation Techniques, Vol.II, Kluwer Academic Publishers, Dordrecht, 1998, pp. 13-39, Chapter 1: Interactive Theorem Proving.
41. J. Schmitt, A. Hoffmann, M. Balser, W. Reif and M. Marcos, Interactive verification of medical guidelines, in: Formal Methods 2006, Proceedings, Hamilton, J. Misra, T. Nipkow and E. Sekerinski, eds, LNCS, Vol.4085, Springer, 2006, pp. 32-47.
42. R. Sherman, A. Pnueli and D. Harel, Is the interesting part of process logic uninteresting?: A translation from pl to pdl, in: POPL'82: Proceedings of the 9th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, New York, NY, USA, 1982, pp. 347-360.
43. M.E. Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, 1969.
44. A. Thums, Formale Fehlerbaumanalyse, PhD thesis, Universität Augsburg, Augsburg, Germany, 2004 (in German).
45. Q. Xu, W.-P. de Roever and J. He, The rely-guarantee method for verifying shared variable concurrent programs, in: Formal Asp. Comput., Warsaw, 1997, pp. 147-174.