Define the static semantics of SDL with ASM
Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences(2001)
Abstract
This paper presents a new approach to defining the static semantics of SDL (Specification and Description Language) by means of ASM (abstract state machine). ASM is an efficient methodology to define computations based on functions and predicates through combining Tarski structure with transition systems. Therefore, unlike the definition for SDL-2000, we define the static semantics of SDL based on functions and predicates, which indirectly represent a syntax tree. The definitions according to this approach are shown to be more precise and readable. Especially, this approach can be fulfilled by doing a little modification on the current definition. In addition, since ASM is built upon a rigorous mathematical foundation, it is quite feasible to solve the consistency problem for this formal definition by combining formal verification techniques
MoreTranslated text
Key words
finite automata,formal verification,programming language semantics,specification languages,sdl-2000,specification and description language,tarski structure,abstract state machine,formal definition,formal verification techniques,functions,predicates,static semantics,syntax tree,transition systems
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined