General correctness: a unification of partial and total correctness
Acta Informatica
NREVERSAL of Fortune - The Thermodynamics of Garbage Collection
IWMM '92 Proceedings of the International Workshop on Memory Management
An Introduction to the Event Calculus
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
An Approach to the Design of Distributed Systems with B AMN
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
The Generalised Substitution Language Extended to Probabilistic Programs
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Introducing Dynamic Constraints in B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Abstract State Machines: Designing Distributed Systems with State Machines and B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Logical reversibility of computation
IBM Journal of Research and Development
Specification and refinement in general correctness
3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods
| Hi-index | 0.00 |
We present a virtual machine architecture designed to provide an executional interpretation for a major subset of the Generalised Substitution Language and its probabilistic extension pGSL, including bounded non-determinism and infeasible operations. The virtual machine techniques we use to support abstract program execution are reversible execution and execution cloning. The architecture we propose will also allow the efficient execution of concrete programs, and a free mixture of abstract and concrete components, so it is possible to envisage a blurring of the distinction between the animation of a specification and the execution of its implementation.