• Publications
  • Influence
Formal Semantics for Program Paths
TLDR
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
  • 6
  • 1
Specifying parallel and distributed real-time systems in Z
  • P. Baumann, K. Lermer
  • Computer Science
  • Proceedings of the 4th International Workshop on…
  • 15 April 1996
TLDR
A framework for the specification of parallel and distributed real time systems is presented by using the formal specification language Z. Expand
  • 8
  • 1
A Framework for the Specification of Reactive and Concurrent Systems in Z
TLDR
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
  • 17
Semantic characterisation of dead control-flow paths
TLDR
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
  • 14
  • PDF
A Formal Model of Real-Time Program Compilation
TLDR
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Expand
  • 8
A Methodology for Compilation of High-Integrity Real-Time Programs
TLDR
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
  • 6
A theory for execution-time derivation in real-time programs
TLDR
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
  • 7
  • PDF
Linear Approximation of Execution-Time Constraints
TLDR
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
  • 3
A formal model of real-time program compilation
TLDR
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
  • 3
Refinement and state machine abstraction
TLDR
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
  • 2