UNSPECIFIED (2004) CSP representation of game semantics for second-order idealized Algol. In: 6th International Conference on Formal Engineering Methods, NOV 08-12, 2004, Seattle, WA.

Full text not available from this repository.

Abstract

We show how game semantics of an interesting fragment of Idealised Algol can be represented compositionally by CSP processes. This enables observational equivalence and a range of properties of terms-in-context (i.e. open program fragments) to be checked using the FDR tool. We have built a prototype compiler which implements the representation, and initial experimental results are positive.

Item Type:	Conference Item (UNSPECIFIED)
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Series Name:	LECTURE NOTES IN COMPUTER SCIENCE
Journal or Publication Title:	FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-23841-7
ISSN:	0302-9743
Editor:	Davies, J and Schulte, W and Barnett, M
Date:	2004
Volume:	3308
Number of Pages:	16
Page Range:	pp. 146-161
Publication Status:	Published
Title of Event:	6th International Conference on Formal Engineering Methods
Location of Event:	Seattle, WA
Date(s) of Event:	NOV 08-12, 2004
URI:	http://wrap.warwick.ac.uk/id/eprint/7568

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item