메뉴 건너뛰기




Volumn 343, Issue 3, 2005, Pages 370-412

Semantic essence of AsmL

Author keywords

Abstract state machine; Executable specification language

Indexed keywords

DATA STRUCTURES; MATHEMATICAL TECHNIQUES; OBJECT ORIENTED PROGRAMMING;

EID: 24144501436     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.017     Document Type: Conference Paper
Times cited : (65)

References (26)
  • 1
    • 25844497369 scopus 로고    scopus 로고
    • The AsmL webpage, http://research.microsoft.com/foundations/AsmL/.
    • The AsmL Webpage
  • 5
    • 25844475604 scopus 로고    scopus 로고
    • Ordinary interactive small-step algorithms, II, microsoft research
    • A. Blass, Y. Gurevich, Ordinary Interactive Small-Step Algorithms, II, Microsoft Research, Tech. Report MSR-TR-2004-88.
    • Tech. Report , vol.MSR-TR-2004-88
    • Blass, A.1    Gurevich, Y.2
  • 7
    • 84959351755 scopus 로고    scopus 로고
    • Composition and submachine concepts for sequential ASMs
    • P. Clote, H. Schwichtenberg (Eds.), Computer Science Logic (Proc. CSL 2000) Springer, Berlin
    • E. Boerger, J. Schmid, Composition and submachine concepts for sequential ASMs, in: P. Clote, H. Schwichtenberg (Eds.), Computer Science Logic (Proc. CSL 2000), Lecture Notes in Computer Science, Vol. 1862, Springer, Berlin, 2000, pp. 41-60.
    • (2000) Lecture Notes in Computer Science , vol.1862 , pp. 41-60
    • Boerger, E.1    Schmid, J.2
  • 9
    • 0002017107 scopus 로고
    • Evolving algebra 1993: Lipari guide
    • E. Boerger Oxford University Press Oxford
    • Y. Gurevich Evolving algebra 1993: Lipari guide E. Boerger Specification and Validation Methods 1995 Oxford University Press Oxford 9 36
    • (1995) Specification and Validation Methods , pp. 9-36
    • Gurevich, Y.1
  • 10
    • 0003439346 scopus 로고    scopus 로고
    • May 1997 draft of the ASM guide
    • EECS Department, University of Michigan (available at the author's website)
    • Y. Gurevich, May 1997 draft of the ASM guide, Tech. Report CSE-TR-336-97, EECS Department, University of Michigan, 1997 (available at the author's website).
    • (1997) Tech. Report , vol.CSE-TR-336-97
    • Gurevich, Y.1
  • 11
    • 84947248224 scopus 로고    scopus 로고
    • For every sequential algorithm there is an equivalent sequential abstract state machine
    • Y. Gurevich For every sequential algorithm there is an equivalent sequential abstract state machine ACM Trans. Comput. Logic 1 1 2000 77 111
    • (2000) ACM Trans. Comput. Logic , vol.1 , Issue.1 , pp. 77-111
    • Gurevich, Y.1
  • 12
    • 0008282119 scopus 로고    scopus 로고
    • Toward industrial strength abstract state machines
    • Microsoft Research, October
    • Y. Gurevich, W. Schulte, M. Veanes, Toward Industrial Strength Abstract State Machines, Tech. Report MSR-TR-2001-98, Microsoft Research, October 2001.
    • (2001) Tech. Report , vol.MSR-TR-2001-98
    • Gurevich, Y.1    Schulte, W.2    Veanes, M.3
  • 19
    • 84958790465 scopus 로고
    • Natural semantics
    • Proc. Symp. on Theoretical Aspects of Computer Science
    • G. Kahn, Natural semantics, in: Proc. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 247, 1987, pp. 22-39.
    • (1987) Lecture Notes in Computer Science , vol.247 , pp. 22-39
    • Kahn, G.1
  • 24
    • 0003931061 scopus 로고
    • Structural approach to operational semantics
    • Computer Science Department, Aarhus University, Denmark, September
    • G.D. Plotkin, Structural approach to operational semantics, Tech. Report DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, September 1981.
    • (1981) Tech. Report , vol.DAIMI FN-19
    • Plotkin, G.D.1
  • 25
    • 25844432664 scopus 로고    scopus 로고
    • PVS Website http://pvs.csl.sri.com/.
    • PVS Website


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.