AbstractCompiler Verification has been identified as a vital process in the implementation of correct safety-critical systems. We extend here Hoare's refinement-algebra approach to compilation in order to include real-time languages in which processes interact asynchronously via communication queues. The existence of unique fixed-points is exploited to verify the implementation of crucial operators such as asynchronous input, delay and timeout
In this paper we present an assume-guarantee specification theory (aka in-terface theory from [14]) ...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
Abstract. Program compilation can be formally defined as a sequence of equivalence-preserving transf...
Abstract. We have previously developed a verified algorithm for compiling programs written in an occ...
Synchronous data-flow languages have been used successfully for design and implementation of embedde...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
AbstractProgram compilation can be formally defined as a sequence of equivalence-preserving transfor...
[[abstract]]With the rapid growth of networking and high-computing power, the demand for large-scale...
We present an extension of synchronous programming lan-guages that can be used to declare program lo...
Asynchronous programming has become ubiquitous in smartphone and web application develop-ment, as we...
We develop a theory of refinement for timed asynchronous systems, in the setting of Communicating Ti...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
We describe a layered approach to the specification and verification of real-time systems. Applicati...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
In this paper we present an assume-guarantee specification theory (aka in-terface theory from [14]) ...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
Abstract. Program compilation can be formally defined as a sequence of equivalence-preserving transf...
Abstract. We have previously developed a verified algorithm for compiling programs written in an occ...
Synchronous data-flow languages have been used successfully for design and implementation of embedde...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
AbstractProgram compilation can be formally defined as a sequence of equivalence-preserving transfor...
[[abstract]]With the rapid growth of networking and high-computing power, the demand for large-scale...
We present an extension of synchronous programming lan-guages that can be used to declare program lo...
Asynchronous programming has become ubiquitous in smartphone and web application develop-ment, as we...
We develop a theory of refinement for timed asynchronous systems, in the setting of Communicating Ti...
We define a language and a predicative semantics to model concurrent real-time programs. We consider...
We describe a layered approach to the specification and verification of real-time systems. Applicati...
The real-time refinement calculus is an extension of the standard refinement calculus in which progr...
In this paper we present an assume-guarantee specification theory (aka in-terface theory from [14]) ...
Formal methods to specify and verify concurrent programs with synchronous message passing are discus...
Once strictly the province of assembly-language programmers, real-time computing has developed into ...
DOI
Add to ORKG