Expressing interesting properties of programs in propositional temporal logic

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

Volumn , Issue , 1986, Pages 184-193

  Wolper, F ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

PROGRAM VERIFICATION;

COMPUTER CIRCUITS;

EID: 85051051500     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512644.512661     Document Type: Conference Paper

References (40)

1. L L. Apt, D. C. Kom, Umki far Automatic Program Verilcati IBM ResearA Repo RC11095. 1985.
2. K. A. Bartfett, R. A. Scantlebury. P. I. Wilkinson, " A Note oa reliable Full-Duplex Transmission over Half-Duplex Linei", Cors-munications of the ACM, Vol. 12, No. 5, May 1969, pp. 260-261.
3. E. M. Clarke, E. A. Emerion, "Synthesis of %aAroaiatiffli Skeletons from Branching Time Temporal Logic", Proc. Of the 1981 Workshop on Logics of Programs, Lecture Notes in Computer Science Vol. 131, SpringerVerlag. New York, pp. 52-71.
4. E. M. Clarke, E. A. Emerson, A. P. Sttla. "Automatic Verfication of Finite state Coo-current Systems Using Temporal Logic Specifications: A Practical Approach", Proc. Of the 10th ACM Symposium on Principles of Programming Languages, Austin. January 1984, pp. 117-126.
5. E. M. Clarke, B. Mishra, "Automatic Verification of Asynchronous Circuiti". Logics of Por-grams Proc., Lecture Not in Compute Science, vol. 164, Springer-Verlag. Berlin, 1983. Pp. 101-115.
6. E.A. Emerson, J.Y. Halpern, ""Sometimes" and "Not Never" Revisited: On Branching vs. Linear Time", Proc. 10th ACM Symp. On Principles of Programming Languages, 1983.
7. E. A. Emerson, Cbing-Laung Lei, "Modalities for Model Checking: Branching Time Strikes Back", Proc. 12th ACM Symposium on Principles of Programming Languages. New Orleans, January 1985, pp. 84-96.
8. Y.A. Feldman. "A Décidante Proposkkmal Probabilaitic Dynamic Logic", Proc. 15th ACM Symp. On Theory of Computing, Boston, 1983, pp. 298-309.
9. R. W. Floyd. "Assigning Meaning to Program", Proc. Symp. Appi. Math., 19. Fa Mathematical Aspect of Computer Sckmat, (J. T. Schwartz, ed.), AMS, Providence, 1967, pp. 19-32.
10. M. Facher, R. Ladner. "Proposhional Dynamic Logic of Regular Programs", J. Of Computer and System Sciences, 18(2), 1979, pp. 194-211.
11. D. Gabbay, A. Pnueli. 5. SheUh and J. Stavi, The Temporal Analysis of Fairness", Proc. 7th ACM Symp. On Principles of Programming Languages, Las Vegas, 1980. Pp. 163-173.
12. D. Mare!, "First Order Dynamic Logic", Lecture Notes in Computo Science, vol. 68. Springer-Verlag, Berlin, 1979.
13. D. Hare!, D. Kozea, R. Parikh, "Process Logic: Expressiveness, Decidability. Completeness", Journal of Computer and System Science 25, 2 (1982), pp. 144-170.
14. J. Y. Halpern. Y. Moses. "Knowledge and Commoa KaowfedfB in a Distributed Environment", Proc. 3rd Symp. On Principles of Distributed Computing, Vancouver, 1984, pp. 50-61.
15. C. A. R. Hoare, "Ab Ariwaatie Basis fa Computer Programming", Communications of the ACM, 12 (10), 1969, pp. 576-580.
16. C. A. R. Hoare, "Communicating Sequential Processes", Communications of the ACM, Vol. 21, No 8 (August 1978). Pp. 666-677.
17. B. T. Hailpern and & S. Owiddi, '"Modular Verification of Computer Communication Protocols", IEEE Trans, on Comm., Vol. COM-31, No. 1, January, 1983, pp. 56-68.
18. D. Kozea, "Probsbilietic PDL".Proc15th ACM Symp. On Theory of computing, Boston, 1983, pp. 221-291.
19. L. Lamport, "Sometimes li Some timet Not Never", 5fi ACM Symposium on Principles of Programmini languages, Las Veg, NV, Irnmiy 1980, pp. 174-185.
20. fLeS4J D. Lehmann. "Knowledge, Comas Kaowfeife d Related Puzzles", A. In/Sywp. M Principles of Distributed Computing, Vancouver, 1984. Pp. 50-61.
21. O. Licht en stein, A. Pnueli, Thecking that Fiate State Concurrent Programs Satisfy their line ir Specifications". Proc. 12tk ACM Symposium m Principles of Programming Languages, New Orleans. January 1985, pp. 97-107.
22. Z. Manna, P. Wo!per, "Synthesis of Communicating Processes from Temporal Logic Specifications", ACM Transactions on Programming Languages and Systems, Vol. 6, No. 1, January 1984. Pp. 68-93
23. A. Pnueli, "The Temporal Logic of Concurrent PAgria Theoretical Computer Science 13(1981), pp. 45-60.
24. A. Panel, "Linear ma Branching Staetufes in the Semantics d Logics of Reactive Systems", Proc. 12th Int. CoUoq. On Automata, Languages ate Programming, Lecture Notes in Computer Sdence, vol. 194, Springer-Verlag. Berlin. 1985, pp. 15-32.
25. V.R. Pratt, "Semantical Considerations on Floyd-Hoare Logic", Proc. 17th IEEE Symp. On Foundations of Computer Science, Houston, October 1976. Pp. 109-121.
26. V.R. Pratt. "A Near-Optimal Method for Reasoning about Action", J. Computer and Systems Sciences 20(1990), pp. 231-254.
27. A. Pouell. L. Zuck. "The Gallant Model Checker", to appear.
28. J. P. Qarifc, J. Stfakis, '7 Related Properties in Transition Systems", Research Report #292, IMAG. Grenoble, 1982.
29. A. P Svstia, E.M. Clarke. The Complexity of Pro positional Linear Temporal Logics", Jour, of theACM. Vol. 32. No.3, July1985.pp. 733-749.
30. A. P. Sala, E.M. Clarke. N. Frances. Y. Gurevitch, "Are Message Buffers Char act erasable in Linear Temporal Logic". Proc. Of 1st ACM Symposium on Principles of Distributed Computing, Ottawa, 1982.
31. RS. Streett. 'Tropositional Dynamic Logic of Looping and Converse", Information and Cm-tro/54(1982), pp. 121-141.
32. K. Sabnani. P. Wolper. A. Lapone, "An Algorithmic Technique for Protocol Vérification", to appear.
33. M. Vardi, "Automatic Verification of Probabilistic Concurrent Finite-State Programs". Proc. 26th Symp. On Foundations of Computer Science, Portland, to appear.
34. F. H. Vogt, "Event-Based Temporal Logic Specification of Servi sad Protocols", in Protocol Specification, Testing and Verfication, North-Holland Publishing, 1982.
35. M. Y. Vardi. P. Wolper. "Yet Another Process Logic", in Logics of Programs, Springer-Verlag Lecture Notes in Computer Science, vol. 164. Berlin, 1983, pp. 501-512.
36. MY. Vardi, P. Wolper, "Autcmau-TheorerJc Techniques for Modal Logics of Programs", Proc. 16th ACM Symp. On Theory of Computing, Washington. 1984, pp. 446456.
37. M. Y. Vardi. P. Wolper. "An Automata-Theoretic Approach to Automatic Progenia Vérification", to appear.
38. P. Wolper, "Synthesis of Comunicata Processes from Temporal Logic Specifications' Ph. D. Thesis, Stanford University, August 1982.
39. P. Wolper, 'Tempora! Logic Can Be More Expressive", Information and Control, Vol. No. 1-2, 1983, pp. 72.
40. P. Wolper. M. Y. Vrdi. A P. Shtla. "Reasoning about Infinite Computation Patha", ftw. 24th IEEE Symposium m Foundations of Computer Science, Tucson, 1983, pp. 185-194.