Crocos: An Integrated Environment for Interactive Verification of SDL Specifications

We are interested by proofs of concurrent programs properties, such as invariance and eventuality. They are connected with execution of a program, and, in order to discuss them, we introduce an operational model of the language and show that the deductive system is consistent with respect to it. The studied language is a selected subset of the SDL language. A system for computer-aided reasoning on programs is derived as follows: we implement the deductive system in Isabelle [24] and then integrate it into a programming environment developed under Concerto namely Crocos [19]. The prover proceeds in an interactive way in which the user's intervention may be required at several stages of the proof derivation.

[1]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Robert W. Floyd,et al.  Assigning Meanings to Programs , 1993 .

[3]  Lawrence C. Paulson,et al.  Natural Deduction as Higher-Order Resolution , 1986, J. Log. Program..

[4]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[5]  Pierre Wolper,et al.  Temporal logic can be more expressive , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[6]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[7]  Robert E. Milne,et al.  The formal description technique Estelle : J.P. Diaz, J.P. Ansart, J.P. Courtiat, P. Azema and V. Chari, eds. North-Holland, Amsterdam, Netherlands, 1989, Prince $102.50 (hardback), ISBN 0-444-87132-2. , 1990 .

[8]  Tobias Nipkow,et al.  Isabelle tutorial and user’s manual , 1990 .

[9]  Zohar Manna,et al.  Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..

[10]  Rick Reed,et al.  Telecommunications systems engineering using SDL , 1989 .

[11]  Carl A. Sunshine,et al.  Formal Techniques for Protocol Specification and Verification , 1979, Computer.

[12]  E. Pascal Gribomont,et al.  Stepwise Refinement and Concurrency: The Finite-State Case , 1990, Sci. Comput. Program..

[13]  A. Prasad Sistla,et al.  Automatic verification of finite state concurrent system using temporal logic specifications: a practical approach , 1983, POPL '83.

[14]  Gérard P. Huet,et al.  A Unification Algorithm for Typed lambda-Calculus , 1975, Theor. Comput. Sci..

[15]  Gregor von Bochmann,et al.  Formal Methods in Communication Protocol Design , 1980, IEEE Trans. Commun..

[16]  Zohar Manna,et al.  Verification of Concurrent Programs: Temporal Proof Principles , 1981, Logic of Programs.

[17]  Dominique MERYa,et al.  A Proof Environment for a Subset of Sdl , 1991 .

[18]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[19]  Jens Chr. Godskesen.  An Operational Semantic Model for Basic SDL , 1991 .

[20]  Dominique Méry.  Méthode Axiomatique Pour Les Propriétés De Fatalité Des Programmes Parallèles , 1987, RAIRO Theor. Informatics Appl..

[21]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.