UNSPECIFIED (2003) On a semantic definition of data independence. In: 6th International Conference on Typed Lambda Calculi and Applications (TLCA 2003), JUN 10-12, 2003, VALENCIA, SPAIN.

Full text not available from this repository.

Abstract

A variety of results which enable model checking of important classes of infinite-state systems are based on exploiting the property of data independence. The literature contains a number of definitions of variants of data independence, which are given by syntactic restrictions in particular formalisms. More recently, data independence was defined for labelled transition systems using logical relations, enabling results about data independent systems to be proved without reference to a particular syntax. In this paper, we show that the semantic definition is sufficiently strong for this purpose. More precisely, it was known that any syntactically data independent symbolic LTS denotes a semantically data independent family of LTSs, but here we show that the converse also holds.

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:	TYPED LAMBDA CALCULI AND APPLICATIONS, PROCEEDINGS
Publisher:	SPRINGER-VERLAG BERLIN
ISBN:	3-540-40332-9
ISSN:	0302-9743
Editor:	Hofmann, M
Date:	2003
Volume:	2701
Number of Pages:	15
Page Range:	pp. 226-240
Publication Status:	Published
Title of Event:	6th International Conference on Typed Lambda Calculi and Applications (TLCA 2003)
Location of Event:	VALENCIA, SPAIN
Date(s) of Event:	JUN 10-12, 2003
URI:	http://wrap.warwick.ac.uk/id/eprint/9389

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item