论文信息 - Intra-step Interaction

Intra-step Interaction

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.

Yuri Gurevich

[1] Andreas Blass,et al. Ordinary interactive small-step algorithms, I , 2006, TOCL.

[2] Guy L. Steele,et al. Java(TM) Language Specification , 2005 .

[3] Egon Börger. Specification and validation methods , 1995 .

[4] Yuri Gurevich,et al. Evolving algebras 1993: Lipari guide , 1995, Specification and validation methods.

[5] Yuri Gurevich,et al. Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[6] Andreas Blass,et al. Algorithms: A Quest for Absolute Definitions , 2003, Bull. EATCS.

[7] Guy L. Steele,et al. Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley)) , 2005 .

[8] Bjarne Stroustrup,et al. C++ Programming Language , 1986, IEEE Softw..

[9] Andreas Blass,et al. Abstract state machines capture parallel algorithms , 2003, TOCL.

[10] Peter H. Golde,et al. C# Language Specification , 2003 .

[11] Andreas Blass,et al. General Interactive Small Step Algorithms , 2005 .