Compositional proofs with symbolic execution

CEUR Workshop Proceedings

Volumn 372, Issue , 2008, Pages 12-27

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

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE PROOFS; INTERVAL TEMPORAL LOGIC; PARALLEL PROGRAM; PROOF METHODS; SAFETY PROPERTY; SYMBOLIC EXECUTION; TEMPORAL PROPERTY;

PARALLEL ARCHITECTURES;

EID: 70749098211     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9) (1965) 569
2. Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4) (1983) 596-619
3. Misra, J., Chandi, K.: Proofs of networks of processes. IEEE Transactions of Software Engineering (1981)
4. de Roever, W.P., et al.: Concurrency Verification: Introduction to Compositional and Noncompositional Methods. Cambridge University Press (2001)
5. Furia, C.A.: A compositional world: a survey of recent works on compositionality in formal methods. Technical Report 2005.22, Dipartimento di Elettronica e Informazione, Politecnico di Milano (March 2005)
6. Harel, D.: Dynamic logic. In Gabbay, D., Guenther, F., eds.: Handbook of Philosophical Logic. Volume 2. Reidel (1984) 496-604
7. Heisel, M., Reif, W., Stephan, W.: A Dynamic Logic for Program Verification. In Meyer, A., Taitslin, M., eds.: Logical Foundations of Computer Science. LNCS 363, Berlin, Logic at Botik, Pereslavl-Zalessky, Russia, Springer (1989) 134-145
8. Burstall, R.M.: Program proving as hand simulation with a little induction. Information processing 74 (1974) 309-312
9. King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7) (1976) 385-394
10. Balser, M.: Verifying Concurrent Systems with Symbolic Execution. Shaker Verlag, Germany (2006)
11. Moszkowski, B.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)
12. Balser, M., Reif,W., Schellhorn, G., Stenzel, K.: KIV 3.0 for Provably Correct Systems. In Hutter, D., Stephan, W., Traverso, P., Ullmann, M., eds.: Proc. Int. Wsh. Applied Formal Methods. Volume 1641 of LNCS., Springer (1999) 330-337
13. Balser, M., Reif, W.: Interactive verification of concurrent systems using symbolic execution. Technical Report 2008-12, Universität Augsburg (2008)
14. Cau, A., Moszkowski, B., Zedan, H.: ITL - Interval Temporal Logic. Software Technology Research Laboratory, SERCentre, De Montfort University, The Gateway, Leicester LE1 9BH, UK. (2002) http://www.cse.dmu.ac.uk/STRL/ITL/.
15. Manna, Z., Pnueli, A.: Temporal verification diagrams. LNCS 789 (1994) 726-765 Springer-Verlag.
16. Balser, M., Reif,W.: An interval temporal logic with compositional interleaving. Technical Report 2008-11, Universität Augsburg (2008)
17. Abadi, M., Lamport, L.: Conjoining specifications. ACM Transactions on Programming Languages and Systems (1995)
18. Cau, A., Collette, P.: Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency. Acta Inf. 33(2) (1996) 153-176
19. Mead, C., Conway, L.: Introduction to VLSI systems. Addison-Wesley (1980)
20. Balser, M., Bäumler, S., Knapp, A., Reif, W., Thums, A.: Interactive verification of uml state machines. In Davies, J., Schulte,W., Barnett, M., eds.: Proc. 6th Int. Conf. of Formal Engineering Methods. Volume 3308 of LNCS., Springer (2004)
21. Thums, A.: Formale Fehlerbaumanalyse. PhD thesis, Universität Augsburg, Augsburg, Germany (2004) (in German).
22. Schmitt, J., Balser, M., Reif, W.: Asbru in KIV v2.1 - a tutorial. Technical Report 2006-03, University of Augsburg (2006)
23. Solanki, M., Cau, A., Zedan, H.: Augmenting semantic web service descriptions with compositional specification. In Feldman, S.I., Uretsky, M., Najork, M., Wills, C.E., eds.: Proc. of 13th int. conference on World Wide Web, ACM (2004) 544-552
24. Zwiers, J., de Roever, W.P., van Emde Boas, P.: Compositionality and concurrent networks: Soundness and completeness of a proofsystem. In: Proc. of 12th Colloquium on Automata, Languages and Programming, Springer (1985) 509-519
25. Pandya, P.K., Joseph, M.: P-A logic: a compositional proof system for distributed programs. Distributed Computing 5(1) (1991) 37-54
26. Moszkowski, B.: Compositional reasoning using interval temporal logic and tempura. LNCS 1536 (1996) 439-464 Springer-Verlag.
27. Pnueli, A.: In transition from global to modular temporal reasoning about programs. (1985) 123-144
28. Stirling, C.: A generalization of Owicki-Gries's Hoare logic for a concurrent while language. Theor. Comput. Sci. 58(1-3) (1988) 347-359
29. Woodcock, J.C.P., Dickinson, B.: Using VDM with rely and guarantee-conditions. Experiences from real projects. In: Proceedings of the 2nd VDM-Europe Symposium on VDM - The Way Ahead, New York, NY, USA, Springer-Verlag New York, Inc. (1988) 434-458
30. Pnueli, A.: Applications of temporal logic to the specification and verification of concurrent systems: A survey of current trends. LNCS 224, Berlin, Springer (1986)
31. Jonsson, B., Tsay, Y.K.: Assumption/guarantee specifications in linear-time temporal logic. Theoretical Computer Science, Vol. 167 (1996)
32. Breitling, M., Philipps, J.: Black box views of state machines. Technical Report TUM-I9916, Technische Univerität München (1999)
33. Rock, G., Stephan, W., Wolpers, A.: Modular reasoning about structured tla specifications. In Berghammer, R., Lakhnech, Y., eds.: Tool Support for System Specification, Development and Verification, Springer (1999)