Skip to main content
SpringerLink
Log in

Faithful Translations Among Models and Specifications

  • Conference paper
  • First Online:
FME 2001: Formal Methods for Increasing Software Productivity (FME 2001)

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

Included in the following conference series:

Abstract

Numerous translations exist between the design notations of formal methods tools, usually between two specific notations. In addition, more general translation frameworks are under development. For any translation it is vital that properties true of the semantic interpretations of the source and the translated notations are closely related.

Some possible applications of translations among model descriptions are described and key issues in translating among models with inconsistent features are identified, leading to a source and a target model that do not always preserve the correctness of properties in a simple way. The concept is presented of a faithful relation among models and families of properties true of those models. In this framework families of properties are provided with uniform syntactic transformations, in addition to the translations of the models. Three variants are presented, depending on the intended use of the translation, so that the correctness of a property in a model corresponds to the correctness of the transformed property in the translated model. This framework is shown appropriate for common instances of relations among translations previously treated in an ad hoc way. Furthermore, it allows expressing connections among models where one is neither a refinement nor an abstraction of the other. The classes of properties that can be faithful for a given translation provide a measure of the usefulness of the translation.

This research was partially supported by the David and Miriam Mondry research fund at the Technion

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt, N. Francez, and S. Katz. Appraising fairness in languages for distributed programming. Distributed Computing, 2:226–241, 1988.

    Article  MATH  Google Scholar 

  2. Saddek Bensalem, Vijay Ganesh, Yassine Lakhnech, César Muñoz, Sam Owre, Harald Rueß, John Rushby, Vlad Rusu, Hassen Saïdi, N. Shankar, Eli Singerman, and Ashish Tiwari. An overview of SAL. In C. Michael Holloway, editor, LFM 2000: Fifth NASA Langley Formal Methods Workshop, pages 187–196, Hampton, VA, June 2000. Available at http://shemesh.larc.nasa.gov/fm/Lfm2000/Proc/.

  3. N. Bjorner, A. Browne, E. Chang, M. Colon, A. Kapur, Z. Manna, H.B. Simpa, and T.E. Uribe. Step: The stanford temporal prover-user’s manual. Technical Report STAN-CS-TR-95-1562, Department of Computer Science, Stanford University, November 1995.

    Google Scholar 

  4. T. Bolognesi and E. Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25–59, 1987.

    Article  Google Scholar 

  5. T. Bolognesi, J.v.d. Legemaat, and C.A. Vissars (eds.). LOTOSphere: software development with LOTOS. Kluwer Academic Publishers, 1994.

    Google Scholar 

  6. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing finite kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1-2), July 1988.

    Google Scholar 

  7. J.R. Burch, E.M. Clarke, K.L. McMillan, D. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142–170, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  8. K.M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, 1988.

    Google Scholar 

  9. E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems (TOPLAS), 16, 5:1512–1542, September 1994.

    Article  Google Scholar 

  10. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, April 1986.

    Article  MATH  Google Scholar 

  11. D. R. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(2), March 1997.

    Google Scholar 

  12. D.R. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In IFIP working conference on Programming Concepts, Methods and Calculi (PROCOMET’94), San Miniato, Italy, June 1994.

    Google Scholar 

  13. O. Grumberg and S. Katz. VeriTech: translating among specifications and verification tools-design principles. In Proceedings of third Austria-Israel Symposium Software for Communication Technologies, pages 104-109, April 1999. http://www.cs.technion.ac.il/Labs/veritech/.

  14. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843–871, 1994.

    Article  Google Scholar 

  15. D. Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming, 8:231–274, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. Harel, H. Lachover, A. Naamad, A. Pnueli, M. Politi, R. Sherman, A. Shtull-Trauring, and M. Trakhtenbrot. Statemate: a working environment for the development of complex reactive systems. IEEE Trans. on Software Eng., 16(4):403–414, April 1990.

    Article  Google Scholar 

  17. C.A.R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice-Hall, 1998.

    Google Scholar 

  18. G. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall International, 1991.

    Google Scholar 

  19. G.J. Holzmann and D. Peled. The state of SPIN. In Proceedings of CAV96, volume 1102 of LNCS, pages 385–389. Springer-Verlag, 1996.

    Google Scholar 

  20. C.N. Ip and D.L. Dill. Better verification through symmetry. Formal Methods in System Design, 9:41–75, 1996.

    Article  Google Scholar 

  21. S. Katz. Refinement with global equivalence proofs in temporal logic. In D. Peled, V. Pratt, and G. Holzmann, editors, Partial Order Methods in Verification, pages 59–78. American Mathematical Society, 1997. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 29.

    Google Scholar 

  22. S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75:263–287, 1990. Preliminary version appeared in the 6th ACM-PODC, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  23. R.P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.

    Google Scholar 

  24. L. Lamport. What good is temporal logic. In 9th World Congress, pages 657–668. IFIP, 1983.

    Google Scholar 

  25. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.

    Google Scholar 

  26. K. L. McMillan. Symbolic Model Checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.

    Google Scholar 

  27. R. Milner. A formal notion of simulation between programs. Technical Report 14, Swansean University, 1970.

    Google Scholar 

  28. http://wwwbrauer.informatik.tu-muenchen.de/gruppen/theorie/KIT/.

  29. S. Owre, S. Rajan, J.M. Rushby, N. Shankar, and M.K. Srivas. PVS: Combining specification, proof checking, and model checking. In Rajeev Alur and Thomas A. Henzinger, editors, Computer-Aided Verification, CAV’ 96, volume 1102 of Lecture Notes in Computer Science, pages 411–414, New Brunswick, NJ, July/August 1996. Springer-Verlag.

    Google Scholar 

  30. Sam Owre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107–125, February 1995.

    Article  Google Scholar 

  31. B. Potter, J. Sinclair, and D. Till. An introduction to Formal Specification and Z. Prentice Hall, 1991.

    Google Scholar 

  32. W. Reisig. Elements of Distributed Algorithms-Modeling and Analysis with Petri Nets. Springer-Verlag, 1998.

    Google Scholar 

  33. J.M. Spivey. The Z Notation: a Reference Manual, 2nd. ed. Prentice Hall, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, The Technion, Haifa, Israel

    Shmuel Katz

Authors
  1. Shmuel Katz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Minho, Campus de Gualtar, 4700-320, Braga, Portugal

    José Nuno Oliveira

  2. AT&T Laboratories — Research, 180 Park Avenue, Florham Park, New Jersey, 07932, USA

    Pamela Zave

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katz, S. (2001). Faithful Translations Among Models and Specifications. In: Oliveira, J.N., Zave, P. (eds) FME 2001: Formal Methods for Increasing Software Productivity. FME 2001. Lecture Notes in Computer Science, vol 2021. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45251-6_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-45251-6_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41791-0

  • Online ISBN: 978-3-540-45251-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation