VERIFY: a program for proving correctness of digital hardware designs
Artificial Intelligence - Special volume on qualitative reasoning about physical systems
Introduction to mathematical logic (3rd ed.)
Introduction to mathematical logic (3rd ed.)
A null-object detection algorithm for constructive solid geometry
Communications of the ACM
Communications of the ACM
What can we do about the unnecessary diversity of notation for syntactic definitions?
Communications of the ACM
Synthesis of Digital Design from Recursive Equations
Synthesis of Digital Design from Recursive Equations
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Discipline of Programming
muFP, a language for VLSI design
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The semantic elegance of applicative languages
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Abstraction in the Intel iAPX-432 prototype systems implementation language
ACM SIGPLAN Notices
Programming Languages, Information Structures, and Machine Organization.
Programming Languages, Information Structures, and Machine Organization.
Making languages more powerful by removing limitations
Conference proceedings on Formal methods in software development
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
Systems semantics extends the denotational semantics of programming languages to a semantics for the description of arbitrary systems, including objects that are not computations in any sense. By defining different meaning functions, the same formal description may be used to denote different system properties, such as structure, behavior, component cost, and performance aspects (e.g., timing).The definition of these semantic functions also provides guidance in language design, in particular for the match between language constructs and the system concepts to be expressed. Aiming at compositionality ensures useful properties for formal manipulation. In this fashion, the meaning functions can be made sufficiently simple to serve not only as a direct implementation on a machine but also as rules for reasoning about systems in a transformational manner. As the applications show, however, compositionality can be ensured only through careful consideration of the characteristics of the flow of information inside the system.Two classes of application are discussed:Unidirectional systems, in particular digital systems without feedback (combinational) and with feedback (sequential), and a certain class of analog systems.Nonunidirectional systems, in particular two-port analog networks. The emphasis will be on the functional style of description and on formal reasoning (theorem proving, derivation of properties).Implementation and rapid prototyping strategies in various system description environments are also briefly discussed. These would permit the concepts of system semantics to be explored without the need for a complete implementation.