The TASM Language Reference Manual Version 1.1 - Synrc

More documents

Recommendations

Info

Bibliography [1] M. Anlauff. XASM - An Extensible, Component-Based Abstract State Machines Language. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Abstract State Machines - ASM 2000, International Workshop on Abstract State Machines, pages 1–21. TIK-Report 87, 2000. [2] E. Börger. Why Use Evolving Algebras for Hardware and Software Engineering In M. Bartošek, J. Staudek, and J. Wiedermann, editors, Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM ’95, volume 1012 of Lecture Notes in Computer Science, pages 236–271, Milovy, Czech Republic, 1995. Springer-Verlag. [3] E. Börger. The Origins and the Development of the ASM Method for High Level System Design and Analysis. Journal of Computer Science, 8(5):2–74, 2001. [4] E. Börger, P. Päppinghaus, and J. Schmid. Report on a Practical Application of ASMs in Software Design. In Abstract State Machines: Theory and Applications, volume 1912, pages 361–366. Springer-Verlag, 2000. [5] E. Börger and R. Stärk. Abstract State Machines. Springer-Verlag, 2003. [6] E. M. Clarke and J. Wing. Formal Methods: State of the Art and Future Directions. ACM Computing Surveys, 28(3):626–643, 1996. [7] J. Cohen and A. Slissenko. On Verification of Refinements of Asynchronous Timed Distributed Algorithms. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, International Workshop on Abstract State Machines, pages 100–114. Springer-Verlag, 2000. [8] R. Eschbach, U. Glässer, R. Gotzhein, and A. Prinz. On the Formal Semantics of Design Languages: A Compilation Approach using Abstract State Machines. In Y. Gurevich, P. Kutter, M. Odersky, , and L. Thiele, editors, Proceedings of the International Workshop on Abstract State Machines – ASM 2000, volume 1912 of Lecture Notes in Computer Science, pages 242–265, Monte Verita, Switzerland, 2000. Springer-Verlag. [9] N. E. Fuchs. Specifications are (Preferably) Executable. IEE/BCS Software Engineering Journal, 7(5):323–334, 1992. 70
[10] Y. Gurevich. Evolving Algebras 1993: Lipari Guide. Specification and Validation Methods, pages 9–36, 1995. [11] http://www.coreasm.org. The coreASM Engine. [12] http://www.research.microsoft.com/foundations/asml. ASML: The Abstract State Machine Language. [13] http://www.tydo.de/AsmGofer. ASM Gopher. [14] http://www.uni-paderborn.de/cs/asm/ASMToolPage/asm workbench.html. The ASM Workbench. [15] R. Milner. Communication and Concurrency. Prentice Hall, 1980. [16] H. Rust. Using Abstract State Machines: Using the Hypperreals for Describing Continuous Changes in a Discrete Notation. In Abstract State Machines – ASM 2000, pages 341–346. Springer-Verlag, March 2000. [17] K. Winter. Model Checking for Abstract State Machines. Journal of Universal Computer Science, 3(5):689–701, 1997. 71
Page 1 and 2:
The TASM Language Reference Manual
Page 3 and 4:
Contents 1 Introduction 5 2 The Lan
Page 5 and 6:
List of Figures 2.1 Hierarchical co
Page 7 and 8:
Chapter 1 Introduction This documen
Page 9 and 10:
Chapter 2 The Language The Timed Ab
Page 11 and 12:
2.2 Basic Definitions The term spec
Page 13 and 14:
TASM Example 1 Light Switch Version
Page 15 and 16:
The keyword next, used with time sp
Page 17 and 18:
of resource usage for the step. If
Page 19 and 20:
• T RU 1 = (5, ((memory, 200), (p
Page 21 and 22: The composition of resources also f
Page 23 and 24: T RU ret = T RU 1 ⊕ ( (T RU 2 ⊕
Page 25 and 26: • T RS 0 = (0, ((memory, 0)), ((l
Page 27 and 28: RC 1 ⊙ RC 2 = (rc 11 , . . . , rc
Page 29 and 30: The example is further extended to
Page 31 and 32: TASM Example 8 Fan Main Machine Def
Page 33 and 34: Table 2.1: Special Operators Operat
Page 35 and 36: main machine templates. The concept
Page 37 and 38: Chapter 3 Syntax This chapter descr
Page 39 and 40: Table 3.1: Reserved Keywords Keywor
Page 41 and 42: Table 3.2: Operators Operator Signa
Page 43 and 44: TASMUCaseLetter > ::= ′ A ′ |
Page 45 and 46: 3.2.2 Project < TASMProjectDef > ::
Page 47 and 48: 3.2.5 Syntax Common to all Machine
Page 49 and 50: 3.2.8 Function Machine < TASMFTempl
Page 51 and 52: Table 3.3: XML Tags for Top Level S
Page 53 and 54: env types rsrcs vars vname tname *
Page 55 and 56: sys confs * conf name desc viname v
Page 57 and 58: XML Example 4 XML for a list of tem
Page 59 and 60: cons cbody cparams body * cparam cp
Page 61 and 62: XML Example 5 XML for main ASM temp
Page 63 and 64: Table 3.11: XML Syntax Tree for Fun
Page 65 and 66: 3.4.2 Typing All variables are stat
Page 67 and 68: Table 4.1: Operator Precedence Oper
Page 69 and 70: 4.2.5 Rules The desugaring of the r
Page 71: is used to sum up all of the resour
show all

The TASM Language Reference Manual Version 1.1 - Synrc

Create successful ePaper yourself

Delete template?

Save as template?