TUG: An Executable Specification Language

Author

Chiang, Chia-Chu

Author_Institution

Dept. of Comput. Sci., Arkansas Univ., Little Rock, AR

fYear

2006

fDate

10-12 July 2006

Firstpage

180

Lastpage

186

Abstract

The TUG (tree unified with grammar) specification language aims at providing formality and abstraction for capturing requirements and expressing the functionality of programs. A TUG specification is formal since the language uses a mathematical notation based on the principles of definite clause grammars (DCGs) and regular expression. This paper introduces the syntax and semantics of the TUG specification language. Some important features of TUG are illustrated with the aid of sample program specifications. With the formality of the TUG specification language, a specification in the language can be interpreted through a language processor. A prototype can be exercised by executing the specification. Formality and executability are designed into the language to give an improvement in quality for user requirements

Keywords

formal specification; grammars; program processors; programming language semantics; specification languages; trees (mathematics); TUG; definite clause grammar; executable specification language; formal method; language processor; mathematical notation; program specification; programming language semantics; regular expression; tree unified with grammar; Computer languages; Computer science; Electronic mail; Error correction; Formal specifications; Programming; Prototypes; Software prototyping; Software tools; Specification languages; Executable Specification; Formal Methods; TUG;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Information Science, 2006 and 2006 1st IEEE/ACIS International Workshop on Component-Based Software Engineering, Software Architecture and Reuse. ICIS-COMSAR 2006. 5th IEEE/ACIS International Conference on

Conference_Location

Honolulu, HI

Print_ISBN

0-7695-2613-6

Type

conf

DOI

10.1109/ICIS-COMSAR.2006.85

Filename

1651989