Skip to main content
SpringerLink
Log in

Intra-step Interaction

  • Conference paper
Abstract State Machines 2004. Advances in Theory and Practice (ASM 2004)

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

Included in the following conference series:

  • 309 Accesses

Abstract

For a while it seemed possible to pretend that all interaction between an algorithm and its environment occurs inter-step, but not anymore. Andreas Blass, Benjamin Rossman and the speaker are extending the Small-Step Characterization Theorem (that asserts the validity of the sequential version of the ASM thesis) and the Wide-Step Characterization Theorem (that asserts the validity of the parallel version of the ASM thesis) to intra-step interacting algorithms.

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 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.

References

  1. ASM Michigan Webpage, http://www.eecs.umich.edu/gasm/ (maintained by James K. Huggins)

  2. The AsmL webpage, http://research.microsoft.com/foundations/AsmL/

  3. Blass, A., Gurevich, Y.: Abstract state machines capture parallel algorithms. A. C. M. Trans. Computational Logic 4(4), 578–651 (2003)

    Article  MathSciNet  Google Scholar 

  4. Blass, A., Gurevich, Y.: Algorithms: A Quest for Absolute Definitions. Bulletin of the European Association for Theoretical Computer Science (81), 195–225 (October 2003)

    Google Scholar 

  5. Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, I. Technical Report MSR-TR-2004-16, Microsoft Research (February 2004)

    Google Scholar 

  6. Blass, A., Gurevich, Y.: Ordinary Interactive Small-Step Algorithms, II (in preparation)

    Google Scholar 

  7. Blass, A., Gurevich, Y., Rossman, B.: General interactive smallstep algorithms (tentative title) (in preparation)

    Google Scholar 

  8. Hejlsberg, A., Wiltamuth, S., Golde, P.: The C# Programming Language. Addison-Wesley, Reading (2003)

    Google Scholar 

  9. Gurevich, Y.: Evolving algebra 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press, Oxford (1995)

    Google Scholar 

  10. Gurevich, Y.: Sequential abstract state machines capture sequential algorithms. A. C. M. Trans. Computational Logic 1(1), 77–111 (2000)

    Article  MathSciNet  Google Scholar 

  11. Joy, B., Steele, G., Gosling, J., Bracha, G.: Java (TM) Language Specification, 2nd edn. Addison-Wesley Pub., Reading (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA

    Yuri Gurevich

Authors
  1. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Martin-Luther-Universität Halle-Wittenberg, 06099, Halle/Saale, Germany

    Wolf Zimmermann

  2. Institute of Computer Science and Applied Mathematics, Christian-Albrechts-University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurevich, Y. (2004). Intra-step Interaction. In: Zimmermann, W., Thalheim, B. (eds) Abstract State Machines 2004. Advances in Theory and Practice. ASM 2004. Lecture Notes in Computer Science, vol 3052. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24773-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24773-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22094-7

  • Online ISBN: 978-3-540-24773-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation