DocumentCode :
2238185
Title :
Define the static semantics of SDL with ASM
Author :
Yuhong, Zhao ; Ying, Wang ; Weilei, Zhang ; Bo, Ai
Author_Institution :
Beijing Univ. of Posts & Telecommun., China
Volume :
2
fYear :
2001
fDate :
2001
Firstpage :
252
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
Keywords :
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; Concrete; History; Natural languages; Production; Telecommunication computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Info-tech and Info-net, 2001. Proceedings. ICII 2001 - Beijing. 2001 International Conferences on
Conference_Location :
Beijing
Print_ISBN :
0-7803-7010-4
Type :
conf
DOI :
10.1109/ICII.2001.983586
Filename :
983586
Link To Document :
بازگشت