Abstract
In this paper we have presented a formal model for processes that communicate through fifo message buffers and have given a sound automatic proof system for verifying RTL definable properties of such systems. The proof method is modular. Although our method is not complete, we feel, as illustrated by the example, that it can be applied to some practical examples. Theorem 3.1 holds for any fragment L of temporal logic as long as the formulae in L do not distinguish between two computations one of which is a stuttered extension of the other. In this case, we can use our approach for proving properties given by formulae in L as long as the theory of fifo buffers in the logic L is decidable.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Y. Afek, H. Attyia, A. Fekete, M. Fischer, N. Lynch, Y. Mansour, D.-W. Wang, and L. Zuck. Reliable communication using unreliable channel, to appear in JACM.
K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable full-duplex transmission over half-duplex links. Communication of the ACM, 12:260–261, 1969.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. Transactions on Programming Languages and Systems, 8(2), 1986.
K. M. Chandy and J. Misra. Parallel Program Design: A Fundation. (A draft), 1986.
E. A. Emerson and C. L. Lei. Modalities for model checking: Branching time strikes back. In Proc. 12th ACM Symp. on Principles of Programming Languages, pages 84–96, 1985.
L. Lamport. Specifying concurrent program modules. ACM TOPLAS, 5(2):190–222, 1983.
O. Lichtenstein and A. Pnueli. Checking that finite-state concurrent programs satisfy their linear specifications. In Proc. 12th ACM Symp. on Principles of Programming Languages, pages 97–107, 1985.
N.A. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 137–151, 1987.
N.A. Lynch and M. R. Tuttle. An introduction to input/output automata. CWI Quarterly, 2(3):219–246, 1989.
S. Owicki and L. Lamport. Proving liveness properties of concurrent programs. TOPLAS, 4(3):455–495, 1982.
A. Pnueli. The Temporal Logic of programs. In Proc. 18th IEEE Symp. on Foundation of Computer Science, pages 46–57, 1977.
A. P. Sistla, E. M. Clarke, N. Francez, and A. R. Meyer. Can message buffers be axiomatized in linear temporal logic? Information and Control, 63(1/2):88–112, 1984.
A. P. Sistla and L. D. Zuck. Reasoning in a restricted temporal logic. submitted for publication, parts appeared in [SZ87], 1990.
M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In Proc. 1st IEEE Symp. on Logics in Computer Science, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sistla, A.P., Zuck, L.D. (1992). Automatic temporal verification of buffer systems. In: Larsen, K.G., Skou, A. (eds) Computer Aided Verification. CAV 1991. Lecture Notes in Computer Science, vol 575. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55179-4_7
Download citation
DOI: https://doi.org/10.1007/3-540-55179-4_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55179-9
Online ISBN: 978-3-540-46763-2
eBook Packages: Springer Book Archive