UNSPECIFIED (2005) Data-abstraction refinement: A game semantic approach. In: 12th International Static Analysis Symposium (SAS 2005), Imperial Coll London, London, ENGLAND, SEP 07-09, 2005. Published in: STATIC ANALYSIS, PROCEEDINGS, 3672 pp. 102-117.

Full text not available from this repository.

Abstract

This paper presents a semantic framework for data abstraction and refinement for verifying safety properties of open programs. The presentation is focused on an Algol-like programming language that incorporates data abstraction in its syntax. The fully abstract game semantics of the language is used for model-checking safety properties, and an interaction-sequence-based semantics is used for interpreting potentially spurious counterexamples and computing refined abstractions for the next iteration.

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:	STATIC ANALYSIS, PROCEEDINGS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-28584-9
ISSN:	0302-9743
Editor:	Hankin, C and Siveroni, I
Date:	2005
Volume:	3672
Number of Pages:	16
Page Range:	pp. 102-117
Publication Status:	Published
Title of Event:	12th International Static Analysis Symposium (SAS 2005)
Location of Event:	Imperial Coll London, London, ENGLAND
Date(s) of Event:	SEP 07-09, 2005
URI:	http://wrap.warwick.ac.uk/id/eprint/34396

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item