Communicating sequential processes
Communicating sequential processes
A formal definition of priority in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
On the Axiomatic Treatment of Concurrency
Seminar on Concurrency, Carnegie-Mellon University
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Using FOCUS, LUSTRE, and Probability Theory for the Design of a Reliable Control Program
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
XEVE, an ESTEREL Verification Environment
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Priorities for Modeling and Verifying Distributed Systems
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Formal Development of Reactive Systems - Case Study Production Cell
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
prialt in Handel-C: an operational semantics
International Journal on Software Tools for Technology Transfer (STTT) - Special section on formal methods for industrial critical systems
Software Engineering 3: Domains, Requirements, and Software Design (Texts in Theoretical Computer Science. An EATCS Series)
Slotted-circus: a UTP-family of reactive theories
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Mechanised Wire-wise Verification of Handel-C Synthesis
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanised wire-wise verification of Handel-C synthesis
Science of Computer Programming
Hi-index | 0.00 |
We present a denotational semantics for a fully functional subset of the Handel-C hardware compilation language [1], based on the concept of typed assertion traces. We motivate the choice of semantic domains by illustrating the complexities of the behaviour of the language, paying particular attention to the prialt (priority-alternation) construct of Handel-C. We then define the typed assertion traces over an abstract notion of actions, which we then instantiate as state-transformers. The denotational semantics is then given and some examples are discussed. As is fitting given those honoured at the Festschrift of which this paper is a part, we show how the work of both Dines Björner and Zhou Chaochen act as inspiration, from the past, into the future for this research work.