Abstract:
Abstract. A variety of results which enable model checking of important classes of innite-state systems are based on exploiting the property of data independence. The literature contains a number of denitions of variants of data independence which are by syntactic restrictions in particular formalisms. More recently, data independence was dened 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 denition is suciently 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.
Citations
|
1440
|
Model Checking
– Clarke, Grumberg, et al.
- 2001
|
|
693
|
Parallel Program Design { A Foundation
– Chandy, Misra
- 1988
|
|
266
|
Types, abstraction, and parametric polymorphism
– Reynolds
- 1983
|
|
144
|
Symbolic bisimulations
– Hennessy, Lin
- 1995
|
|
51
|
A semantic study of data-independence with applications to model-checking
– Lazic, Roscoe
- 1998
|
|
43
|
Proving security protocols with model checkers by data independence techniques
– Roscoe
- 1998
|
|
37
|
Non-deterministics data types: Models and implementations
– Nipkow
- 1986
|
|
30
|
A symbolic semantics and bisimulation for Full LOTOS
– Calder, Shankland
- 2001
|
|
21
|
Better veri through symmetry
– Ip, Dill
- 1996
|
|
20
|
Verifying sequential consistency on shared-memory multiprocessor systems
– Qadeer
- 1999
|
|
17
|
Logical relations for monadic types
– Goubault-Larrecq, Lasota, et al.
- 2002
|
|
15
|
A unifying approach to data-independence
– Lazić, Nowak
- 2000
|
|
9
|
Verifying linear temporal properties of data insensitive controllers using instantiations
– Hojati, Dill, et al.
- 1997
|
|
7
|
A characterization of lambda de in categorical models of implicit polymorphism
– Alimohamed
- 1995
|
|
5
|
First-order-CTL model checking
– Bohn, Damm, et al.
- 1998
|
|
4
|
Deciding bisimulation equivalences for a class of nonnite-state programs
– Jonsson, Parrow
- 1993
|
|
4
|
A new characterization of lambda de
– Jung, Tiuryn
- 1993
|
|
3
|
Lambda de with sums via Grothendieck logical relations
– Fiore, Simpson
- 1999
|
|
1
|
A fully abstract semantics for a higher-order functional language with nondeterministic computation. Theoretical Computer Science
– Jerey
- 1999
|
|
