Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An Execution Architecture for GSL

  • Conference paper
  • First Online:
ZB 2000: Formal Specification and Development in Z and B (ZB 2000)

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

Included in the following conference series:

  • 195 Accesses

Abstract

We present a virtual machine architecture designed to provide an executional interpretation for a major subset of the Generalised Substitution Language and its probabilistic extension p GSL, including bounded non-determinism and infeasible operations. The virtual machine techniques we use to support abstract program execution are reversible execution and execution cloning. The architecture we propose will also allow the efficient execution of concrete programs, and a free mixture of abstract and concrete components, so it is possible to envisage a blurring of the distinction between the animation of a specification and the execution of its implementation.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. J R Abrial. Extending B without Changing it (for Developing Distributed Systems). In H Habrias, editor, The First B Conference, ISBN:2-906082-25-2, 1996.

    Google Scholar 

  2. J R Abrial and L Mussat. Introducing Dynamic Constraints in B. In Bert D, editor, B98: Recent Developments in the Use of the B Method., number 1393 in Lecture Notes in Computer Science, 1998.

    Google Scholar 

  3. H G Baker. The Thermodynamics of Garbage Collection. In Y Bekkers and Cohen J, editors, Memory Management: Proc IWMM’92, number 637 in Lecture Notes in Computer Science, 1992. See ftp://ftp.netcom.com/pub/hb/hbaker/ReverseGC.html.

    Chapter  Google Scholar 

  4. C Bennett. The logical reversibility of computation. IBM Journal of Research and Development, 6, 1973.

    Google Scholar 

  5. C Bennett. The thermodynamics of computation. International Journal of Theoretical Physics, 21 pp 905–940, 1982.

    Article  Google Scholar 

  6. M Butler. csp2B: A practical approach to combining CSP and B. In J M Wing, Woodcock J, and Davies J, editors, FM99 vol 1, Lecture Notes in Computer Science, no 1708. Springer Verlag, 1999.

    Google Scholar 

  7. M J Butler. An approach to the design of distributed systems with B AMN. In J P Bowen, M J Hinchey, and Till D, editors, ZUM’ 97: The Z Formal Specification Notation, number 1212 in Lecture Notes in Computer Science, 1997.

    Chapter  Google Scholar 

  8. ANSI J14 Technical Committee. American National Standard for Information Systems: Programming Languages-Forth. American National Standards Institute, 1994.

    Google Scholar 

  9. S E Dunne, A J Galloway, and Stoddart W J. Specification and Refinement in General Correctness. In A Evans, editor, 3rd Northern Formal Methods Workshop, EWIC (Electronic Workshops in Computing: http://www.ewic.org.uk/ewic/workshop/view.cfm/NFM-98. BCS, 1998.

  10. S E Dunne, W J Stoddart, and A J Galloway. Extending the generalised substitution to model semi-decidable operations. In H Habrias, editor, The First B Conference, ISBN: 2-906082-25-2, 1996.

    Google Scholar 

  11. D Jacobs and D Gries. General Correctness: a unification of partial and total correctness. Acta Informatica, 22, 1985.

    Google Scholar 

  12. J McCarthy. The inversion of functions defined by Turing Machines. In C E Shannon and J McArthy, editors, Automata Studies. Princeton, 1956.

    Google Scholar 

  13. C Moore. Forth, a new way to program mini-computers. The Annals of Leiden Observatory, 1972. See http://forth.gsfc.nasa.gov1.

  14. C Morgan. The Generalised Substitution Language Extended to Probabalistic Programs. In Bert D, editor, B98: Recent Developments in the Use of the B Method., number 1393 in Lecture Notes in Computer Science, 1998.

    Chapter  Google Scholar 

  15. W J Stoddart. An Introduction to the Event Calculus. In J P Bowen, M J Hinchey, and Till D, editors, ZUM’ 97: The Z Formal Specification Notation, number 1212 in Lecture Notes in Computer Science, 1997.

    Chapter  Google Scholar 

  16. W J Stoddart, S E Dunne, Galloway A J, and Shore R. Abstract State Machines: Designing Distributed Systems with State Machines and B. In Bert D, editor, B98: Recent Developments in the Use of the B Method., number 1393 in Lecture Notes in Computer Science, 1998.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stoddart, B. (2000). An Execution Architecture for GSL. In: ZB 2000: Formal Specification and Development in Z and B. ZB 2000. Lecture Notes in Computer Science, vol 1878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44525-0_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44525-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67944-8

  • Online ISBN: 978-3-540-44525-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics