Abstract
One central problem in the computer-aided verification of concurrent systems consisting of communicating sequential processes with data is to find suitable symbolic models. Such models should provide a compact computer representation for control and data flows, and should be appropriate for mainstream verification techniques such as model checking and theorem proving. A number of symbolic models have been proposed, many of which based on the guarded commands (also known as condition/action) paradigm. In this paper, we draw attention to the limitations of this paradigm and propose a better model named Ntif (New Technology Intermediate Form), which is well-adapted to compiling high-level, concurrent languages (such as the recent E-Lotos standard). Finally, we present two software tools developed for Ntif and report about the use of Ntif for modeling two embedded applications in smart cards.
Keywords
- Smart Card
- Sequential Process
- Label Transition System
- Process Algebra
- Symbolic Model
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.
This work has been partly done in the framework of FormalCard (see http://www.inrialpes.fr/vasy/dyade/formalcard.html), a joint research project between Inria and Schlumberger (formerly Bull/CP8)
Download conference paper PDF
References
G. Berry, G. Gonthier. The Esterel Synchronous Programming Language: Design, Semantics, Implementation. Science Of Computer Programming, 19(2), 1992.
M. Bezem, J. Groote. Invariants in Process Algebra with Data. Proc. CONCUR’94, LNCS 836.
M. Bozga, J.-C. Fernandez, L. Ghirvu, S. Graf, J.-P. Krimm, L. Mounier. IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems. Proc. FM’99, LNCS 1708.
M. Bozga, S. Graf, L. Mounier. IF-2.0: A Validation Environment for Component-Based Real-Time Systems Proc. CAV’2002, LNCS 2404.
S. Budkowski, P. Dembinski. An Introduction to Estelle: A Specification Language for Distributed Systems. Computer Networks and ISDN Systems, 14(1), 1988.
CEPSCO. Common Electronic Purse Specification-Technical Specification version 2.3, 1999. http://www.cepsco.com/.
D. Clarke, T. Jéron, V. Rusu, E. Zinovieva. STG: A Symbolic Test Generation Tool. Proc. TACAS’2002, LNCS 2280.
H. Garavel, F. Lang, R. Mateescu. An Overview of CADP 2001. Technical Report RT 254, INRIA, 2001.
H. Garavel, F. Lang, R. Mateescu. Compiler Construction using LOTOS NT. Proc. Compiler Construction 2002, LNCS 2304.
H. Garavel, J. Sifakis. Compilation and Verification of LOTOS Specifications. Proc. PSTV’90. North-Holland.
J. Groote, M. Reniers. Algebraic Process Verification. Proc. Handbook of Process Algebra, chapter 17. North Holland, 2001.
M. Hennessy, M. Lin. Symbolic Bisimulations. Theoretical Computer Science, 138, 1995.
G. Holzmann. The Model Checker SPIN. IEEE Transactions on Software Engineering, 23(5), 1997.
ISO/IEC. LOTOS-A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, 1989.
ISO/IEC. Enhancements to LOTOS (E-LOTOS). International Standard 15437, 2001.
G. Karjoth. Implementing LOTOS Specifications by Communicating State Machines. Proc. CONCUR’92, LNCS 630.
N. Lynch, M. Tuttle. An Introduction to I/O automata. CWI-Quarterly, 2(3), 1989.
E.-R. Olderog. Nets, Terms and Formulas, Cambridge Tracts in Theoretical Computer Science 23. Cambridge University Press, 1991.
J.-P. Queille. Le systeme CESAR: description, spécification et analyse des applications réparties. Université Scientifique et Médicale de Grenoble (Grenoble, France) 1982.
W. de Roever, F. de Boer, U. Hanneman, J. Hooman, Y. Lakhnech, M. Poel, J. Zwiers. Concurrency Veri.cation-Introduction to Compositional and Noncompositional Methods, Cambridge Tracts in Theoretical Computer Science 54. 2001.
V. Rusu, L. du Bousquet, T. Jéron. An Approach to Symbolic Test Generation. Proc. IFM’00, LNCS 1945.
J.-P. Schwartz. QUASAR, une réalisation du système CESAR: description, spécification et analyse des applications réparties. Thèse de Doctorat, Institut National Polytechnique de Grenoble (France), 1983.
M. Sighireanu. Contribution á la définition et á l’implémentation du langage “Extended LOTOS”. Thèse de Doctorat, Université Joseph Fourier (Grenoble, France), 1999.
M. Sighireanu. LOTOS NT User’s Manual (Version 2.1). INRIA projet VASY. ftp://ftp.inrialpes.fr/pub/vasy/traian/manual.ps.Z, 2000.
D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, LNCS 369. 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garavel, H., Lang, F. (2002). NTIF: A General Symbolic Model for Communicating Sequential Processes with Data. In: Peled, D.A., Vardi, M.Y. (eds) Formal Techniques for Networked and Distributed Sytems — FORTE 2002. FORTE 2002. Lecture Notes in Computer Science, vol 2529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36135-9_18
Download citation
DOI: https://doi.org/10.1007/3-540-36135-9_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00141-6
Online ISBN: 978-3-540-36135-0
eBook Packages: Springer Book Archive