Specification and verification of concurrent programs by V-Automata

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn Part F130236, Issue , 1987, Pages 1-12

  Manna, Zohar ^a   Pnueli, Amir ^b  

^a Weizmanu Institute of Science ^*  (Israel)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS; TEMPORAL LOGIC;

COMPACT REPRESENTATION; CONCURRENT PROGRAM; DETERMINISTIC FINITE STATE AUTOMATA; DIAGRAM NOTATIONS; GRAPHICAL REPRESENTATIONS; PROOF RULES; SOUND AND COMPLETE; SPECIFICATION AND VERIFICATION;

AUTOMATA THEORY;

EID: 84969361398     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/41625.41626     Document Type: Conference Paper

References (22)

1. K. Apt, G.D. Piotkin - Countable Nondeterminism and Random Assignment, JACM 33, 4 (1986), 724-767.
2. B. Alpern, F.B. Schneider - Verifying Temporal Properties without using Temporal Logic, Technical Report TR 85-723, Cornell University (December 1985).
3. E.M. Clarke, E.A. Emerson, A.P. Sistla - Automatic Verification of Finite-State Concurrent Systems using Temporal Logic specifications, TOPLS 8, 1 (april 1986), 244-263.
4. E.W. Dijkstra - A Discipline of Programming, Prentice Hall (1976).
5. E.A. Emerson, C.L. Lei - Modalities for Model Checking: Branching Time Strikes Back, 12th Symp. on Principles of Programming Languages (1985), 84-96.
6. R.W. Floyd - Assigning Meanings to Programs, in Mathematical Aspects of Computer Science, 19th Symp. of Appl. Math., American Mathematical Society, Providence (1967), 19-32.
7. N. Francez - Fairness, Springer-Verlag (1986).
8. O. Grumberg, N. Francez, J.A. Makowsky, W.P. deRoever - A Proof Rule for Fair Termination of Guarded Commands, Information and Control 66 (1985), 83-102.
9. D. Harel - Statecharts: A Visual Formalism for Complex Systems, Technical Report, Weizmann Institute (1984).
10. D. Harel - Effective Transformations on Infinite Trees, with Applications to High Undecidability, Dominoes, and Fairness, JACM 33, 1 (1986), 224-248.
11. C.A.R. Hoare - An Axiomatic Approach to Computer Programming, CACM 12 (1969), 576-583.
12. O. Lichtenstein, A. Pnueli - Checking that Finite-State Concurrent Programs Satisfy their Linear Specifications, 12th Symp. on Principles of Programming Languages (1985), 97-107.
13. D. Lehmann, A. Pnueli, J. Stavi - Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, LNCS 115, Springer-Verlag (1981).
14. Z. Manna, A. Pnueli - The Temporal Framework for Concurrent Programming, in The Correctness Problem in Computer Science (R.S. Boyer, J.S. Moore, eds.), Academic Press (1981), 215-274.
15. Z. Manna, A. Pnueli - Adequate Proof Principles for Invariances and Liveness Properties of Concurrent Programs, Science of Computer Programming A (1984), 257-289.
16. Z. Manna, A. Pnueli - Specificat ion and Verification of Concurrent Programs by V-Automata, Computer Science Report, Stanford University (January 1987).
17. S. Owicki, L. Lamport - Proving Liveness Properties of Concurrent Programs, TOPLAS 4, 3 (1982), 455-495.
18. G.L. Peterson - Myths about the Mutual-exclusion Problem, Information Processing Letters 12, 3 (1981), 115-116.
19. F.A. Stomp, W.P. deRoever, R.T. Gerth - The μ-Calculus as an Assertion Language for Fairness Arguments, Technical Report 84-12, Utrecht (1984).
20. M.Y. Vardi, P. Wolper - An Automata-theoretic Approach to Automatic Program Verification, IEEE Symp. on Logic in Computer Science, Cambridge (1986), 332-344.
21. P. Wolper - Temporal Logic can be More Expressive, 22nd Symp. on Foundations of Computer Science (1981), 340-348.
22. P. Wolper, M.Y. Vardi, A.P. Sistla - Reasoning about Infinite Computation Paths, 24th IEEE Symp. oh Foundations of Computer Science, Tucson (1983), 185-194.