On model checking data-independent systems with arrays with whole-array operations

Lecture Notes in Computer Science

Volumn 3525, Issue , 2005, Pages 275-291

  Lazić, Ranko ^a,c   Newcomb, Tom ^b   Roscoe, A W ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Arrays; Data independence; Infinite state systems; Model checking

Indexed keywords

ARRAYS; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; SET THEORY;

DATA INDEPENDENCE; DATA-INDEPENDENT SYSTEMS; INFINITE-STATE SYSTEMS; MODEL CHECKING;

COMPUTER SCIENCE;

EID: 26444457396     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11423348_17     Document Type: Conference Paper

References (17)

1. S. Adve and K. Gharachorloo. Shared memory consistency models: a tutorial. Computer, 29(12):66-76, December 1996.
2. P. J. Broadfoot, G. Lowe, and A. W. Roscoe. Automating data independence. In Proceedings of the 6th European Symposium on Research on Computer Security, pages 75-190, 2000.
3. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley Publishing Company, Inc., Reading, Massachusetts, 1988.
4. S. J. Creese and A. W. Roscoe. Data independent induction over structured networks. In International Conference on Parallel and Distributed Processing Techniques and Applications. CSREA Press, June 2000.
5. N. Cutland. Computability: An Introduction to Recursive Function Theory. Cambridge University Press, 1980.
6. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proceedings of the 14th IEEE Symposium on Logic in Computer Science, pages 352-359. IEEE Comp. Soc. Press, 1999.
7. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
8. R. Hojati and R. K. Brayton. Automatic datapath abstraction in hardware systems. In Proceedings of the 7th International Conference on Computer Aided Verification, volume 939 of Lecture Notes in Computer Science, pages 98-113. Springer-Verlag, 1995.
9. R. Hojati, A. J. Isles, and R. K. Brayton. Automatic state reduction techniques for hardware systems modelled using uninterpreted functions and infinite memory. In Proceedings of the IEEE International High Level Design Validation and Test Workshop, November 1997.
10. R. S. Lazić. A Semantic Study of Data Independence with Applications to Model Checking. PhD thesis, Oxford University Computing Laboratory, 1999.
11. R. S. Lazić, T. C. Newcomb, and A. W. Roscoe. On model checking data-independent systems with arrays without reset. Theory and Practice of Logic Programming, 4(5-6):659-693, 2004.
12. R. S. Lazić and D. Nowak. A unifying approach to data independence. In Proceedings of the 11th International Conference on Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 581-595. Springer-Verlag, August 2000.
13. I. A. Lomazova. Nested petri nets: Multi-level and recursive systems. Fundamenta Informaticae, 47:283-294, 2001.
14. K. L. McMillan. Verification of infinite state systems by compositional model checking. In Conference on Correct Hardware Design and Verification Methods, pages 219-234, 1999.
15. T. Melham and R. Jones. Abstraction by symbolic indexing transformations. In Proceedings of the Fourth International Conference on Formal Methods in Computer-Aided Design, volume 2517 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
16. T. C. Newcomb. Model Checking Data-Independent Systems With Arrays. PhD thesis, Oxford University Computing Laboratory, 2003.
17. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, pages 184-193, 1986.