Skip to main content

A Decision Method for Linear Temporal Logic

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 170))

Abstract

In this paper we define a new decision method for propositional temporal logic of programs. Temporal logic appears to be an appropriate tool to prove some properties of programs such as invariance or eventually because in this logic we define operators that enable us to represent properties that are valid during all the development of the program or over some parts of the program.

The decision method that we define is an extension of classical resolution to temporal operators.

We give an example of a mutual exclusion problem and we show, using resolution method, that it verifies a liveness property.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. BEN-ARI M.-Complexity of proofs and models in programming logics. Ph D., Tel-Aviv University, May 1981.

    Google Scholar 

  2. CARNAP R.-Modalities and quantification. JSL Vol. 11, 1946, pp. 33–64.

    MathSciNet  MATH  Google Scholar 

  3. CHANG C., LEE R.-Symbolical logic and mechanical theorem proving. Academic Press, New-York, 1973.

    Google Scholar 

  4. FARIÑAS DEL CERRO L.-A simple deduction method for modal logic. Information Processing Letters, Vol. 14, n∘2, 1982

    Google Scholar 

  5. FARIÑAS DEL CERRO L., LAUTH E.-Raisonnement temporel: une méthode de déduction. Rapport Université Paul Sabatier, Toulouse, 1983.

    Google Scholar 

  6. GABBAY D., PNUELI A., SHEALAH S., STAVI J.-Temporal Analysis of Fairness. Seventh ACM Symposium on Principles of Programming Languages. Las Vegas, NV, Janvier 1980.

    Google Scholar 

  7. LEMMON E.-An introduction to modal logic. Amer. Phil. Quaterly Monograph Series, 1977.

    Google Scholar 

  8. MANNA Z.-Verification of sequential programs: Temporal axiomatization, Report NoSTAN-CS-81-877, Stanford University, 1981.

    Google Scholar 

  9. ROBINSON J.-A machine oriented logic based on the resolution principle. J. ACM, 12, 1965, pp. 23–41.

    Article  MathSciNet  MATH  Google Scholar 

  10. CLARKE E., EMERSON E.-Design and synthesis of synchronization skeletons using branching time temporal logic, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cavalli, A.R., Cerro, L.F.D. (1984). A Decision Method for Linear Temporal Logic. In: Shostak, R.E. (eds) 7th International Conference on Automated Deduction. CADE 1984. Lecture Notes in Computer Science, vol 170. Springer, New York, NY. https://doi.org/10.1007/978-0-387-34768-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-34768-4_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96022-7

  • Online ISBN: 978-0-387-34768-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics