Annotated transition systems for verifying concurrent programs
We propose what we view as a generalization of an assertional approach to the verification of concurrent programs. In doing so we put an emphasis on reflecting the semantic contents of programs rather than their syntax in the adopted pattern of reasoning. Therefore assertions annotate not a text of...
Main Author: | Paczkowski, Pawel |
---|---|
Published: |
University of Edinburgh
1990
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.660279 |
Similar Items
-
Oh!... is it really you? : using rank functions to verify authentication protocols
by: Heather, James
Published: (2000) -
Type systems for modular programs and specifications
by: Aspinall, David R.
Published: (1997) -
Phase transition behaviour in constraint satisfaction problems
by: Grant, Stuart Alexander
Published: (1997) -
Generating program animators from programming language semantics
by: Berry, Dave
Published: (1990) -
Quantum programming
by: Zuliani, Paolo
Published: (2001)