A small step for mankind

Authors:
Cornelis Huizing;Ron Koymans;Ruurd Kuiper
Affiliations:
Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
Concurrency, Compositionality, and Correctness
Year:
2010

Citing 5
Cited 0

A proof rule for fair termination of guarded commands

Information and Control - The MIT Press scientific computation series
Compositional semantics for real-time distributed computing

Information and Computation
A Proof System for Communicating Sequential Processes

ACM Transactions on Programming Languages and Systems (TOPLAS)
Now you may compose temporal logic specifications

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Specification and Verification of Invariants by Exploiting Layers in OO Designs

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

For many programming languages, the only formal semantics published is an SOS big-step semantics. Such a semantics is not suited for investigations that observe intermediate states, such as invariant techniques. In this paper, a construction is proposed that generates automatically a small-step SOS semantics from a big-step semantics. This semantics is based on the a priori technique pioneered by Willem-Paul de Roever et al.