Characterization of a sequentially consistent memory and verification of a cache memory by abstraction

Distributed Computing

Volumn 12, Issue 2-3, 1999, Pages 75-90

  Graf, Susanne ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; FORMAL LOGIC; RESPONSE TIME (COMPUTER SYSTEMS); SEQUENTIAL SWITCHING; STATE SPACE METHODS;

DISTRIBUTED CACHE MEMORY SYSTEMS; TEMPORAL LOGIC;

BUFFER STORAGE;

EID: 0033340224     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050059     Document Type: Article

References (29)

1. Y. Afek, G. Brown, M. Meritt: Lazy caching. ACM Transactions on Programming Languages and Systems, 15(1), 1993
2. T. Bolognesi, E. Brinksma: Introduction to the ISO specification language LOTOS. ISDN, 14(1):25-29 (1988)
3. A. Bouajjani, S. Bensalem, C. Loiseaux, J. Sifakis: Property preserving simulations. In: Workshop on Computer-Aided Verification (CAV), Montréal. LNCS 630, 1992
4. S. Bensalem, Y. Lakhnech, S. Owre: Computing Abstractions of Infinite State Systems Compositionally and Automatically. In Proceedings of CAV'98, volume 1427 of LNCS, June 1998
5. P. Cousot, R. Cousot: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of lixpoints. In 4th POPL, 1977
6. E.M. Clarke, O. Grumberg, D.E. Long: Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542 (1994)
7. K. M. Chandy, J. Misra: Parallel Program Design. Reading, MA: Addison-Wesley 1988
8. R. Cridlig: Semantic Analysis of Shared-Memory Concurrent Languages using Abstract Model-Checking. In: Symposium on Partial Evaluation and Program Manipulation. La Jolla, California, June 1995
9. J. Dingel, Th. Filkorn: Model checking for infinite state systems using data abstraction, assumption-committment style reasoning and theorem proving. In: Proc. of 7th CAV 95, Liège. LNCS 939, Berlin Heidelberg New York: Spinger 1995
10. E. A. Emerson, J. Y. Halpern: 'Sometimes' and 'not never' revisited: On branching versus linear time. In 10th ACM Symposium on Principles of Programming Languages (POPL 83), 1983 also in Journal of ACM , 33:151-178
11. [FGM+92] J.Cl. Fernandez, H. Garavel, L. Mounier, A. Rasse, C. Rodriguez, J. Sifakis: A tool box for the verification of lotos programs. In 14th International Conference on software Engineering, 1992
12. R. Gerth: Introduction to sequential consistency and the lazy caching algorithm. Distrib Comput 12: 57-59 (1999)
13. S. Graf, C. Loiseaux: A tool for symbolic program verification and abstraction. In: Conference on Computer Aided Verification CAV 93, Heraklion Crete. LNCS 697, Berlin Heidelberg New York: Spinger 1993
14. S. Graf: Verification of a distributed cache memory by using abstractions. In Conf. on Computer Aided Verification CAV'94, Stanford. LNCS 818, Berlin Heidelberg New York: Spinger 1994
15. S. Graf, H. Saldi: Construction of Abstract State Graphs with PVS. In: Proceedings of CAV'97. Haifa, volume 1254 of LNCS, June 1997
16. B. Jonsson, A. Pnueli, C Rump: Proving refinement using transduction. Distrib Comput 12: 129-149 (1999)
17. D. Kozen: Results on the proportional μ-calculus. In: Theoretical Computer Science. Amstersdam: North-Holland 1983
18. R.P. Kurshan: Analysis of discrete event coordination. In: REX Workshop on Stepwise Refinement of Distributed Systems, Mook. LNCS 430, Berlin Heidelberg New York: Spinger 1989
19. R.P. Kurshan: Computer-Aided Verification of Coordinating processes, the automata theoretic approach. Princeton Series in Computer Science. Princeton University Press, 1994
20. L. Lamport: How to make a multiprocessor that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28:690-691, 1979
21. L. Lamport: The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3), 1994
22. [LGS+94] C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, S. Bensalem: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, Vol. 6, Iss 1, January 1995
23. C. Loiseaux: Vérification symbolique de programmes réactifs à l'aide d'abstractions. PhD thesis, February 1994
24. D. E. Long: Model checking, abstraction and compositional verification. Phd thesis, Carnegie Mellon University, July 1993
25. Z. Manna, A. Pnueli: The temporal Logic of reactive and concurrent systems, Vol 1: Specification. Berlin Heidelberg New York: Spinger 1991
26. R. Milner: An algebraic definition of simulation between programs. In: Proc. Second Int. Joint Conf. on Artificial Intelligence, pp 481-489. BCS, 1971
27. A. Pnueli: In transition from global to modular temporal reasoning about programs. In: Logics and Models for Concurrent Systems. NATO, ASI Series F, Vol. 13, Berlin Heidelberg New York: Spinger 1985
28. A. Pnueli: Specilication and development of reactive systems. In: Conference IFIP, Dublin. Amsterdam: North-Holland 1986
29. G. Shurek, O. Grumberg: The Modular Framework of Computer-aided Verification: Motivation, Solutions and Evaluation Criteria. In: Conference on Automatic Verification (CAV). Rutgers, NJ, LNCS 531, Berlin Heidelberg New York: Spinger 1990