Parallel program design: a foundation
Parallel program design: a foundation
Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B)
Deciding bisimulation equivalences for a class of non-finite-state programs
Information and Computation
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking
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
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
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Syntactic Program Transformations for Automatic Abstraction
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Automatic Datapath Abstraction In Hardware Systems
Proceedings of the 7th International Conference on Computer Aided Verification
A unifying approach to data-independence
A unifying approach to data-independence
Mathematical Models of Computer Security
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Algorithmic Verification with Multiple and Nested Parameters
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
A succinct canonical register automaton model
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
On model checking data-independent systems with arrays with whole-array operations
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Demonstrating learning of register automata
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Parameterized verification of open procedural programs
Proceedings of the Fifth Balkan Conference in Informatics
A succinct canonical register automaton model for data domains with binary relations
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
A concurrent system is data-independent with respect to a data type when the only operation it can perform on values of that type is equality testing. The system can also assign, input, nondeterministically choose, and output such values. Based on this intuitive definition, syntactic restrictions which ensure data-independence have been formulated for a variety of different formalisms. However, it is difficult to see how these are related. We present the first semantic definition of data-independence which allows equality testing, and its extension which allows constant symbols and predicate symbols. Both are special cases of a definition of when a family of labelled transition systems is parametric. This provides a unified approach to data-independence and its extensions. The paper also contains two theorems which, given a system and a specification which are data-independent, enable the verification for all instantiations of the data types (and of the constant symbols and the predicate symbols, in the case of the extension) to be reduced to the verification for a finite number of finite instantiations. We illustrate the applicability of the approach to particular formalisms by a programming language similar to UNITY.