Non-deterministic data types: models and implementations
Acta Informatica
Parallel program design: a foundation
Parallel program design: a foundation
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A characterization of lambda definability in categorical models of implicit polymorphism
Theoretical Computer Science
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Verifying linear temporal properties of data insensitive controllers using finite instantiations
CHDL'97 Proceedings of the IFIP TC10 WG10.5 international conference on Hardware description languages and their applications : specification, modelling, verification and synthesis of microelectronic systems: specification, modelling, verification and synthesis of microelectronic systems
A fully abstract semantics for a higher-order functional language with nondeterministic computation
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Model checking
Proving security protocols with model checkers by data independence techniques
Journal of Computer Security
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Symbolic Semantics and Bisimulation for Full LOTOS
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
First-Order-CTL Model Checking
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Automatic Datapath Abstraction In Hardware Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Deadlock-freeness of hexagonal systolic arrays
Information Processing Letters
| Hi-index | 0.00 |
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.