On Gurevich's theorem on sequential algorithms

Acta Informatica

Volumn 39, Issue 4, 2003, Pages 273-305

  Reisig, W ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SEQUENTIAL ALGORITHMS;

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; SEMANTICS;

THEOREM PROVING;

EID: 0038370926     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-002-0106-3     Document Type: Article

References (22)

1. E. Börger. High Level System Design and Analysis using Abstract State Machines. In D.Hutter et al, editor, Current Trends in Applied Formal Methods, volume 1464 of LNCS, pages 1-43, 1999
2. E. B"orger. The Origin of the ASM Method for High Level System Design and Analysis. Journal of Universal Computer Science, Vol.8 No.1:2-74, 2002
3. M. Broy, K. Stølen. Specification and Development of Interactive Systems. Berlin Heidelberg New York: Springer 2001
4. A.B. Cremers, T.N. Hibbard. Formal Modeling of Virtual Machines. IEE on Software Engineering, SE-4 No 5:426-436, September 1978
5. P. Dauchy, M.-C. Gaudel. Implicit state in algebraic specifications. In ISCORE'93, volume No 01/93 of Informatik-Berichte. Universität Hannover, 1993
6. L.M.G. Feijs, H.B.M. Jonkers. Formal Specification and Design. Cambridge Tracts in Theoretical Computer Science, 35:188ff, 1992
7. H. Friedmann. Algorithmic procedurs, generalized Turing algorithms and elementary recursion theory. In Logic Colloqium '69. Gandy and Yates(eds), Amsterdam: North-Holland Publ. Co 1971
8. R.O. Gandy. Church's Thesis and principles for mechanisms. In The Kleene Symposium. H.Barwise et al(eds), Amsterdam: North-Holland Publ. Co 1980
9. H. Ganzinger. Programs as Transformations of Algebraic Theories. In 11. GI-Jahrestagung, Informatikfachberichte 50, pages 32-41. Berlin Heidelberg New York: Springer 1981
10. H. Ganzinger. Denotational Semantics for Languages with Modules. In D. Bjørner, editor, Formal Description of Programming Concepts - II, pages 3-20. Amsterdam: North-Holland 1983
11. M.-C. Gaudel, A. Zamulin. Imperative Algebraic Specifications. In conference, PSI'99, Novosibirsk, June 1999, volume 1755 of LNCS, pages 17-39. Berlin Heidelberg New York: Springer 2000
12. Y. Gurevich. A new thesis. American Mathematical Society Abstracts, page 317, August 1985
13. Y. Gurevich. Logic and the Challenge of Computer Science. In E.Börger, editor, Current Trends in Theoretical Computer Science, pages 1-57. Computer Science Press 1988
14. Y. Gurevich. Evolving Algebra 1993: Lipari Guide. In E.Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press 1995
15. Y. Gurevich. The Sequential ASM Thesis Bulletin of the EATCS, Number 67:93-124, 1999
16. Y. Gurevich. Sequential Abstract-State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic, Vol.1 No. 1:77-111, July 2000
17. Y. Gurevich, M. Spielmann. Recursive Abstract State Machines. Journal of Universal Computer Science, Vol.3 No.4, 1997
18. +. unpublished manuscript, http://www.research.digital.com/SRC/tla, 2000
19. D.C. Luckham, D.M.R. Park, M. Paterson. Formalized computer programs. 4:220-249, 1970
20. C. Pair. Types abstrait et Sémantique Algébrique des Languages de Programmation. Centre de Recherche en Informatique de Nancy, TR 80-R-011:1-46, Feb/July 1980
21. C. A. Petri. Kommunikation mit Automaten. Schriften des Institutes für Instrumentelle Mathematik Bonn, 1962
22. E. Zucca. From Static to Dynamic Abstract Data-Types. In A.Szalas W.Penczek, editor, MFCS 96, volume 1113 of LNCS, pages pp 579-590, 1996