Pierre Wolper
ABSTRACT
We show that the class of properties of programs expressible in propositional temporal logic can be substantially extended if we assume the programs to be <i>data-independent.</i> Basically, a program is data-independent if its behavior does not depend on the specific data it operates upon. Our results significantly extend the applicability of program verification and synthesis methods based on propositional temporal logic.
- {AK85} K. R. Apt, D. C. Kozen, "Limits for Automatic Program Verification", IBM Research Report RC11095, 1985.Google Scholar
- {BSW69} K. A. Bartlett, R. A. Scantlebury. P. T. Wilkinson, " A Note on reliable Full-Duplex Transmission over Half-Duplex Lines", Communications of the ACM, Vol. 12, No. 5, May 1969, pp. 260--261. Google ScholarDigital Library
- {CE81} E. M. Clarke, E. A. Emerson, "Synthesis of Synchronization Skeletons from Branching Time Temporal Logic", Proc. of the 1981 Workshop on Logics of Programs, Lecture Notes in Computer Science Vol. 131, Springer-Verlag, New York, pp. 52--71. Google ScholarDigital Library
- {CES83} E. M. Clarke, E. A. Emerson, A. P. Sistla, "Automatic Verification of Finite state Concurrent 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. Google ScholarDigital Library
- {CM83} E. M. Clarke, B. Mishra, "Automatic Verification of Asynchronous Circuits", Logics of Programs Proc., Lecture Notes in Computer Science, vol. 164, Springer-Verlag, Berlin, 1983, pp. 101--115. Google ScholarDigital Library
- {EH83} 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. Google ScholarDigital Library
- {EL85} E. A. Emerson, Ching-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. Google ScholarDigital Library
- {Fe83} Y. A. Feldman, "A Decidable Propositional Probabilistic Dynamic Logic", Proc. 15th ACM Symp. on Theory of Computing, Boston, 1983, pp. 298--309. Google ScholarDigital Library
- {F167} R. W. Floyd, "Assigning Meaning to Programs", Proc. Symp. Appl. Math., 19, in Mathematical Aspects of Computer Science, (J. T. Schwartz, ed.), AMS, Providence, 1967, pp. 19--32.Google Scholar
- {FL79} M. Fischer, R. Ladner, "Propositional Dynamic Logic of Regular Programs", J. of Computer and System Sciences, 18(2), 1979, pp. 194--211.Google ScholarCross Ref
- {GPSS80} D. Gabbay, A. Pnueli, S. Shelah and J. Stavi, "The Temporal Analysis of Fairness", Proc. 7th ACM Symp. on Principles of Programming Languages, Las Vegas, 1980, pp. 163--173. Google ScholarDigital Library
- {Ha79} D. Harel, "First Order Dynamic Logic", Lecture Notes in Computer Science, vol. 68, Springer-Verlag, Berlin, 1979. Google ScholarDigital Library
- {HKP82} D. Harel, D. Kozen, R. Parikh, "Process Logic: Expressiveness, Decidability, Completeness", Journal of Computer and System Science 25, 2 (1982), pp. 144--170.Google ScholarCross Ref
- {HM84} J. Y. Halpern, Y. Moses, "Knowledge and Common Knowledge in a Distributed Environment", Proc. 3rd Symp. on Principles of Distributed Computing, Vancouver, 1984, pp. 50--61. Google ScholarDigital Library
- {Ho69} C. A. R. Hoare, "An Axiomatic Basis for Computer Programming", Communications of the ACM, 12 (10), 1969, pp. 576--580. Google ScholarDigital Library
- {Ho78} C. A. R. Hoare, "Communicating Sequential Processes", Communications of the ACM, Vol. 21, No 8 (August 1978), pp. 666--677. Google ScholarDigital Library
- {HO83} B. T. Hailpern and S. S. Owicki, "Modular Verification of Computer Communication Protocols", IEEE Trans. on Comm., Vol. COM-31, No. 1, January, 1983, pp. 56--68.Google Scholar
- {Ko83} D. Kozen, "Probabilistic PDL", Proc. 15th ACM Symp. on Theory of Computing, Boston, 1983, pp. 291--297. Google ScholarDigital Library
- {La80} L. Lamport, "Sometimes is Sometimes Not Never". Seventh ACM Symposium on Principles of Programming Languages, Las Vegas, NV, January 1980, pp. 174--185. Google ScholarDigital Library
- {Le84} D. Lehmann, "Knowledge, Common Knowledge and Related Puzzles", Proc. 3rd Symp. on Principles of Distributed Computing, Vancouver, 1984, pp. 50--61. Google ScholarDigital Library
- {LP85} O. Lichtenstein, A. Pnueli, "Checking that Finite State Concurrent Programs Satisfy their Linear Specifications", Proc. 12th ACM Symposium on Principles of Programming Languages, New Orleans, January 1985, pp. 97--107. Google ScholarDigital Library
- {MW84} Z. Manna, P. Wolper, "Synthesis of Communicating Processes from Temporal Logic Specifications", ACM Transactions on Programming Languages and Systems, Vol. 6, No. 1, January 1984, pp. 68--93 Google ScholarDigital Library
- {Pn81} A. Pnueli, "The Temporal Logic of Concurrent Programs", Theoretical Computer Science 13(1981), pp. 45--60.Google ScholarCross Ref
- {Pn85} A. Pnueli, "Linear and Branching Structures in the Semantics and Logics of Reactive Systems", Proc. 12th Int. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 194, Springer-Verlag, Berlin, 1985, pp. 15--32. Google ScholarDigital Library
- {Pr76} V. R. Pratt, "Semantical Considerations on Floyd-Hoare Logic", Proc. 17th IEEE Symp. on Foundations of Computer Science, Houston, October 1976, pp. 109--121.Google Scholar
- {Pr80} V. R. Pratt, "A Near-Optimal Method for Reasoning about Action", J. Computer and Systems Sciences 20(1980), pp. 231--254.Google ScholarCross Ref
- {PZ85} A. Pnueli, L. Zuck, "The Gallant Model Checker", to appear.Google Scholar
- {QS82} J. P. Queille, J. Sifakis, "Fairness and Related Properties in Transition Systems", Research Report #292, IMAG, Grenoble, 1982.Google Scholar
- {SC85} A. P. Sistla, E. M. Clarke, "The Complexity of Propositional Linear Temporal Logics", Jour. of the ACM, vol. 32, no. 3, July 1985, pp. 733--749. Google ScholarDigital Library
- {SCFG82} A. P. Sistla, E. M. Clarke, N. Frances, Y. Gurevitch, "Are Message Buffers Characterizable in Linear Temporal Logic", Proc. of 1st ACM Symposium on Principles of Distributed Computing, Ottawa, 1982. Google ScholarDigital Library
- {St82} R. S. Streett, "Propositional Dynamic Logic of Looping and Converse", Information and Control 54(1982), pp. 121--141.Google ScholarCross Ref
- {SWL85} K. Sabnani, P. Wolper, A. Lapone, "An Algorithmic Technique for Protocol Verification", to appear.Google Scholar
- {Va85} M. Vardi, "Automatic Verification of Probabilistic Concurrent Finite-State Programs". Proc. 26th Symp. on Foundations of Computer Science, Portland, to appear. Google ScholarDigital Library
- {Vo82} F. H. Vogt, "Event-Based Temporal Logic Specification of Services and Protocols", in Protocol Specification, Testing and Verification, North-Holland Publishing, 1982. Google ScholarDigital Library
- {VW83} 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. Google ScholarDigital Library
- {VW84} M. Y. Vardi, P. Wolper, "Automata-Theoretic Techniques for Modal Logics of Programs", Proc. 16th ACM Symp. on Theory of Computing, Washington, 1984, pp. 446--456. Google ScholarDigital Library
- {VW85} M. Y. Vardi, P. Wolper, "An Automata-Theoretic Approach to Automatic Program Verification", to appear.Google Scholar
- {Wo82} P. Wolper, "Synthesis of Communicating Processes from Temporal Logic Specifications", Ph. D. Thesis, Stanford University, August 1982. Google ScholarDigital Library
- {Wo83} P. Wolper, "Temporal Logic Can Be More Expressive", Information and Control, Vol. 56, Nos. 1--2, 1983, pp. 72--99.Google ScholarCross Ref
- {WVS83} P. Wolper, M. Y. Vardi, A. P. Sistla, "Reasoning about Infinite Computation Paths", Proc. 24th IEEE Symposium on Foundations of Computer Science, Tucson, 1983, pp. 185--194.Google Scholar
Recommendations
A complete proof system for propositional projection temporal logic
The paper presents a proof system for Propositional Projection Temporal Logic (PPTL) with projection-plus. The syntax, semantics, and logical laws of PPTL are introduced together with an axiom system consisting of axioms and inference rules. To ...
Monodic temporal logic with quantified propositional variables
We extend the monodic fragment of first-order linear temporal logic to include right-linear grammar operators and quantification of propositional variables. Unlike propositional temporal logic, the use of grammar operators in first-order temporal logic ...
A Complete Axiomatization of Propositional Projection Temporal Logic
TASE '08: Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software EngineeringThis paper investigates a complete axiomatic system for Propositional Projection Temporal Logic (PPTL). To this end, the syntax, semantics, and logic laws of PPTL are briefly introduced. Further, the normal form of PPTL formulas is presented. Moreover, ...
Comments