Abstract
In this paper we present an abstract model of process semantics, Abstract Trace Semantics, which is built on top of an abstract interpretation for (the Abstract Data Types part of) LOTOS. We use it as a model for an abstract interpretation of a linear time temporal logics. Both Abstract Trace Semantics and the abstract interpretation of the satisfiability relation are proven correct w.r.t. their concrete counterparts. The main advantage of the proposed approach is that it makes automatic model checking applicable also to full value passing process algebras. Currently, model checking is applied only to process algebraic specifications where only synchronization is supported (or, equivalently, value passing is restricted to data types which must be finite). By means of abstract interpretation we can reduce the infinite branching of labeled transition systems, which is due to infinite data types, to finite branching. In this way we can completely automate the verification that a formula is satisfied by a process in the abstract domain. When the formula is satisfied by the process in the abstract domain, then the correctness theorem guarantees that indeed the formula holds for the process.
The work presented in this paper has been partially funded by ”Progetto Coordinate C.N.R.: Metodologie e Strumenti di Analisi, Verifica e Validazione per Sistemi Software Affidabili.”
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.
A. Bouali, S. Gnesi, S. Larosa. The integration Project for the JACK Environment. Bulletin of the EATCS, n.54, October 1994, pages 207–223.
R. Boute. Funmath illustrated: A declarative formalism and application examples. Technical Report Declarative Systems Series n.1, Univerity of Nijmegen, july 1993.
E.M.Clarke, O.Grumberg, D.E.Long. Model Checking and Abstraction. ACM TOPLAS, 16(5), 1994, pages 1512–1542.
R. Cleaveland and J. Riely. Testing-based Abstractions for Value-Passing Systems. Concur '94: Concurrency Theory, Lecture Notes in Computer Science 836, pages 415–432. Springer-Verlag, 1994.
D.Dams, O.Grumberg, R.Gerth. Automatic Verification of Abstract Interpretation of Reactive Systems: Abstractions Preserving ”CTL*, CTL*, CTL*. IFIP Transactions A-56, Conference on Programming Concepts, Methods and Calculi (PRO-COMET'94), E. Olderog (ed.), North Holland, 1994.
N. De Francesco, A. Fantechi, S. Gnesi, P.Inverardi. Model Checking of non-finite state processes by Finite Approximations. TACAS'95, Lecture Notes in Computer Science 1019, Springer-Verlag.
P. van Eijk. The Lotosphere Integrated Tool Environment. 4th International Conference on Formal Description Techniques (FORTE '91), North-Holland, 1991, pp. 473–476.
A. Fantechi, S. Gnesi, C. Laneve. An Expressive Temporal Logic for Basic LOTOS 2nd International Conference on Formal Description Techniques (FORTE '89), North-Holland, 1990, pp. 261–276.
A. Fantechi, S. Gnesi, D. Latella. Temporal Logics Verification of LOTOS Specifications Using Abstract Interpretation. CNUCE Internal Report C94-19, Oct. 1994. Available from anonymous ftp as pub/fantechi/repC94-19.ps at repl.iei.pi.cnr.it.
A. Fantechi, S. Gnesi, G. Ristori. Compositionality and Bisimulation: a negative result. Information Processing Letters, vol. 39, July 1991, pp.109–114.
F. Fiore and F. Giannotti. An abstract interpreter for the specification language LOTOS. 7h International Conference on Formal Description Techniques — FORTE '94, 1994.
F. Giannotti and D. Latella. Gate splitting in LOTOS specifications using abstract interpretation. Science of Computer Programming, (23):127–149, 1994.
S. Gnesi, E. Madelaine, G. Ristori. An Exercise in Protocol Verification. LOTOSPHERE — Software Development using LOTOS — Results of the LotoSphere Project; Kluwer Academic Publishers, 1995.
C.A.R. Hoare. A model for Communicating Sequential Processes. Technical Monograph Prg-22, Computing laboratory, University of Oxford, 1981.
R. Langerak. Transformations and Semantics for LOTOS. Ph. D. Thesis — University of Twente 1992
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fantechi, A., Gnesi, S., Latella, D. (1996). Towards automatic temporal logic verification of value passing process algebra using abstract interpretation. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_76
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive