We give an abstract syntax and a partial correctness semantics for program control-flow paths as a generic model for path analysis and constraint derivation.Expand

We show in analogy to [2] that specifying concurrent systems in Z means conjoining the individual specifications and defining the input-output relations for the processes.Expand

We show how the formal semantics of those statements comprising a path provides a sound theoretical foundation for identification of dead control-flow paths.Expand

Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code.Expand

A practical methodology for compilation of trustworthy real-time programs is introduced that combines new program development and timing analysis techniques with traditional compilation and assembly technologies.Expand

We provide an abstract command language for real-time programs and outline how a partial correctness semantics can be used to compute execution times.Expand

This paper defines an algorithm for predicting worst-case and best-case execution times, and determining execution-time constraints of control-flow paths through real-time programs using their partial correctness semantics.Expand

We present a new, simple model of real-time refinement, based on predicate transformer semantics, to present a straightforward compilation formalism that incorporates real- time constraints.Expand

We introduce a notion of state abstractness for speci!cations and introduce a state-abstraction lattice to characterise re!nement proofs with abstraction functions.Expand