Paper Info
Title
A Denotational Semantic Theory of Concurrent Systems.
Abstract
This paper proposes a general denotational semantic theory suitable for most concurrent systems. It is based on well-known concepts of events, traces and specifications of systems as sets of traces. Each programming language combinator is modeled by a transformer that combines the specifications of the components to yield the specification of a system. We introduce smooth and bismooth transformers that correspond to monotonic and continuous functions in traditional denotational theory. We show how fairness under recursion can be treated within this theory.
Year
DOI
Venue
2015
10.1007/978-3-319-23165-5_23
Lecture Notes in Computer Science
Keywords
DocType
Volume
Denotational semantics,Specification transformer,Smooth transformer,Bismooth transformer,Specifications of recursive programs,Fairness and recursion
Conference
9200
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
3
1
Name
Order
Citations
PageRank
Jayadev Misra13147771.78