Abstract
This paper describes a work on the systematic embedding into SAL of specifications written in the integrated approach of Configuration Machines. The final goal is to perform formal analysis. SAL is an intermediate language used as an input language of various formal reasoning tools and especially PVS. The Configuration Machine approach is a specification technique combining transition systems and state based data models. Our embedding technique, based on a systematic translation of the specifications into SAL, is presented, formalised and discussed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. W. Gravell and C. H. Pratten. Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logic of PVS and HOL. In M. Newey, editor. Supplementary Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics: Emerging Trends,(TPHOL’98). Australian National University [16], pages 73–84, 1998.
C. Attiogbé. Configuration Machines: A Simple Formalism For Specifying Multifaceted Systems. Technical Report 181, IRIN, University of Nantes, 1998.
C. Attiogbé. The Access Control System: Specification with Configuration Machines. In Proc. of AFADL’2000, pages 203–220, France, 2000.
C. Attiogbé. Mechanization of Configuration Machines: Shallow Embedding into SAL/PVS. Technical Report 01.8, IRIN, University of Nantes, 2001.
S. Bensalem, V. Ganesh, Y. Lakhnech, C. Muñoz, S. Owre, H. Rueß, J. Rushby, V. Rusu, H. Saïdi, N. Shankar, E. Singerman, and A. Tiwari. An Overview of SAL. In C. Michael Holloway, editor, Proc. of the Fifth NASA Langley Formal Methods Workshop (LFM’2000), pages 187–196, Vancouver, 2000.
R. Boulton, A. Gorgon, M.J.C. Gordon, J. Hebert, and J. van Tassel. Experience with Embedding Hardware Description Language in HOL. In Proc. of the International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, pages 129–156, North-Holland, 1992. IFIP TC10/WG 10.2.
J. P. Bowen and M. J. C. Gordon. A Shallow Embedding of Z in HOL. Information and Software Technology, 37(5–6):269–276, 1995.
M. Bozga, J. C. Ferandez, L. Ghirvu, S. Graph, J. P. Krimm, and L. Mounier. IF: An Intermediate Representation and Validation Environment for Timed Asynchronous Systems. In J. Wing and J. Woodcock and J. Davies, editor, Proc. of the International Conference on Formal Methods (FM’99), volume 1708 of Lecture Notes in Computer Science, France, 1999. Springer-Verlag.
M. J. Butler and C. C. Morgan. Action Systems, Unbounded Nondeterminism, and Infinite Traces. Formal Aspects of Computing, 7:37–53, 1995.
D. L. Dill. The Murø Verification System. In Proc. of Computer-Aided Verification (CAV’96), volume 1102 of Lecture Notes in Computer Science, pages 390–393, New Jersey, USA, 1996. Springer-Verlag.
J-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A Protocol Validation and Verification Toolbox. In R. Alur and T. A. Henzinger, editors, Proc. of the 8th Conference on Computer-Aided Verification (CAV’96), volume 1102 of Lecture Notes in Computer Science, pages 437–440. Springer-Verlag, 1996.
C. Fischer. CSP-OZ: A Combination of Object-Z and CSP. In H. Bowmann and J. Derick, editors, Proc. of FMOODS’97, volume 2, pages 423–438. Chapman and Hall, 1997.
A. Galloway. Integrated Formal Methods with Richer Methodological Profiles for the Development of Multi-Perspectives Systems. PhD thesis, University of Teesside-School of Computing and Mathematics, 1996.
M.J.C. Gordon. Introduction to HOL: A Theorem Proving Environment. Cambridge University Press, 1993.
J. Crow and S. Owre and J. Rushby and N. Shankar and M. Srivas. A Tutorial Introduction to PVS. In Proc. of the Workshop on Industrial-Strength Formal Specification Techniques (WIFT’95). IEEE Press, 1995. Florida.
J. Grundy and M. Newey, editor. Supplementary Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics: Emerging Trends, (TPHOL’98). Australian National University, 1998.
Kolyang, T Santen, and B. Wolff. A Structure Preserving Encoding of Z in Isabelle/HOL. In Proc. of the International Conference on Theorem Proving in Higher Order Logic (TPHOL’96), volume 1125 of Lecture Notes in Computer Science, pages 283–298. Springer-Verlag, 1996.
B. Krieg-Brückner, J. Peleska, E. R. Olderog, and A. Baer. The UniForM Workbench, a Universal Development Environment for Formal Methods. In J. Wing and J. Woodcock and J. Davies, editor, Proc. of the International Conference on Formal Methods (FM’99), volume 1708 of Lecture Notes in Computer Science, pages 1187–1205, France, 1999. Springer-Verlag.
A. Martin. Approaches to proof in Z. Technical report, University of Southampton, 1997.
C. Muñoz. Specification of the Flight Guidance System in (unofficial) SAL. Technical report, ICASE, http://www.icase.edu/~munoz/SAL/sal.html, 1999.
C. Muñoz and J. Rushby. Structural Embeddings: Mechanization with Method. In J. Wing and J. Woodcock, editor, Proc. of the World Congress in Formal Methods (FM99), volume 1708 of Lecture Notes in Computer Science, pages 452–471, France, 1999. Springer-Verlag.
D. Park, U. Stern, J. U. Skakkebaek, and D. L. Dill. Java Model Checking. In Proc. of the Fifteenth IEEE International Conference on Automated Software Engineering (ASE’2000), pages 253–256, 2000.
R. Büssow, R. Geisler, W. Grieskamp and M. Klar. The μ SZ Notation, Version 1.0. Technical report, Teschnische Universität Berlin, Fachbereich Informatik, December 1997.
N. Shankar. Symbolic Analysis of Transition Systems. In Y. Gurevich, P. W. Kutter, M. Odersky, and L. Thiele, editors, Proc. of the Workshop on Abstract State Machines: Theory and Applications (ASM’2000), volume 1912 of Lecture Notes in Computer Science, pages 287–302, Switzerland, 2000. Springer-Verlag.
W.J. Stoddart. An Introduction to the Event Calculus. In Proc. ZUM’97, volume 1212 of Lecture Notes in Computer Science, pages 10–34. Springer-Verlag, 1997.
D. W. J. Stringer-Calvert, S. Stepney, and I. Wand. Using PVS to Prove a Z Refinement: A Case Study. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, Proc. of Formal Methods: Their Industrial Application and Strengthened Foundations (FME’ 97), volume 1313 of Lecture Notes in Computer Science, pages 573–588, Austria, 1997. Springer-Verlag.
Z. Manna and the STeP group. STeP: The Stanford Temporal Prover. In P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, Proc. of Theory and Practice of Software Development, volume 915 of Lecture Notes in Computer Science, pages 793–794. Springer-Verlag, 1995.
ITU Recommendation Z.100. Specification and Description Language SDL. Technical report, ITU, 1994.
C. Fischer. How to combine Z with a Process Algebra. In J. P. Bowen, A. Fett, et M. G. Hinchey, éditeurs, Proc. of The Z Users Meeting (ZUM’98), volume 1493 of Lecture Notes in Computer Science, pages 5–23. Springer-Verlag, 1998.
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
Attiogbé, J.C. (2002). Mechanization of an Integrated Approach: Shallow Embedding into SAL/PVS. In: George, C., Miao, H. (eds) Formal Methods and Software Engineering. ICFEM 2002. Lecture Notes in Computer Science, vol 2495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36103-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-36103-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00029-7
Online ISBN: 978-3-540-36103-9
eBook Packages: Springer Book Archive