Expressive Power of Specification Languages

By abstracting away from a particular specification language and considering a ‘specification’ to be just a set of implementations, one can define a partial order on specification languages that reflects their expressive power. In addition, one can show that there is no universal specification langu...

Full description

Saved in:

Bibliographic Details
Published in:	Formal aspects of computing Vol. 10; no. 2; pp. 187 - 192
Main Author:	Hayes, Ian J.
Format:	Journal Article
Language:	English
Published:	London Springer-Verlag London Limited 01.11.1998 Springer
Subjects:	Applied sciences Computer science; control theory; systems Exact sciences and technology Language theory and syntactical analysis Programming languages Software Software and its engineering Software and its engineering / Software creation and management Software and its engineering / Software creation and management / Designing software Software and its engineering / Software creation and management / Designing software / Requirements analysis Software and its engineering / Software notations and tools Software and its engineering / Software notations and tools / General programming languages Theoretical computing Theory of computation Theory of computation / Formal languages and automata theory Theory of computation / Semantics and reasoning Theory of computation / Semantics and reasoning / Program reasoning Theory of computation / Semantics and reasoning / Program reasoning / Program specifications Keywords: Specification languages; Expressive power; Specifiability Partial ordering Specification language Language theory Programming language
ISSN:	0934-5043, 1433-299X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!