Communications of the ACM
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
Transputer instruction set: a compiler writer's guide
Transputer instruction set: a compiler writer's guide
Acta Informatica
An approach to systems verification
Journal of Automated Reasoning
Duality in specification languages: a lattice-theoretical approach
Acta Informatica
Data refinement of predicate transformers
Theoretical Computer Science
Normal form approach to compiler design
Acta Informatica
Theoretical Computer Science
VLISP: a verified implementation of Scheme
Lisp and Symbolic Computation
Piton: a mechanically verified assembly-level language
Piton: a mechanically verified assembly-level language
Synthesising controllers from real-time specifications
ISSS '97 Proceedings of the 10th international symposium on System synthesis
Proof, language, and interaction
Advice on structuring compilers and proving them correct
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
A Discipline of Programming
Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction
Modular Compiler Verification: A Refinement-Algebraic Approach Advocating Stepwise Abstraction
On the Refinement Calculus
The Definition of Standard ML
Specifying and Verifying Requirements of Real-Time Systems
IEEE Transactions on Software Engineering
Workshop on Hardware Specification, Verification and Synthesis: Mathematical Aspects
Totally Verified Systems: Linking Verified Software to Verified Hardware
Workshop on Hardware Specification, Verification and Synthesis: Mathematical Aspects
Real-Time Constraints Through the ProCoS Layers
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Decidability and Undecidability Results for Duration Calculus
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Towards a Provably Correct Hardware Implementation of Occam
CHARME '93 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Synthesizing Controllers from Duration Calculus
FTRTFT '96 Proceedings of the 4th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Symbolic Controller Synthesis for Discrete and Timed Systems
Hybrid Systems II
Towards Provably Correct Code Gneration for a Hard Real-Time Programming Language
CC '94 Proceedings of the 5th International Conference on Compiler Construction
Refinement Calculus, Part I: Sequential Nondeterministic Programs
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
This article provides an overview over two constructive approaches to provably correct hard real-time code generation where hard real-time code is generated from abstract requirements rather than verified against the timing requirements a posteriori. The first, more pragmatic approach is concerned with translation of imperative programs, extended by hard real-time commands which allow one to specify upper bounds for the execution time of basic blocks. In the second approach, Duration Calculus, a metric-time temporal logic, is used as the source language. Duration Calculus allows one to specify real-time systems at a very high level of abstraction.