Property-preserving refinement of concurrent systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6084 LNCS, Issue , 2010, Pages 222-236

  D'Errico, Liliana ^a   Loreti, Michele ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC APPROACHES; CONCURRENT SYSTEMS; FORMAL FRAMEWORK; PROPERTY-PRESERVING; REFINEMENT STEP; SYSTEM COMPONENTS;

ALGEBRA;

TEMPORAL LOGIC; COMPUTATION THEORY;

EID: 77958074911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15640-3_15     Document Type: Conference Paper

References (16)

1. Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1-3), 109-137 (1984)
2. Bobaru, M.G., Pasareanu, C., Giannakopoulou, D.: Automated assume-guarantee reasoning by abstraction refinement. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 135-148. Springer, Heidelberg (2008)
3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential pro-cesses. J. ACM 31(3), 560-599 (1984)
4. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Proceedings of Logic of Programs, pp. 52-71. Springer, Heidelberg (1982)
5. Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: An evaluation of auto-mated assume-guarantee reasoning. ACM Trans. Softw. Eng. Methodol. 17(2), 1-52 (2008)
6. D'Errico, L., Loreti, M.: Assume-Guarantee Verification ofConcurrent Systems. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol. 5521, pp. 288-305. Springer, Heidelberg (2009)
7. D'Errico, L., Loreti, M.: Property-preserving refinement of concurrent systems. Technical report, Università di Firenze (2009), at http://www.dsi.unifi.it/~loreti/
8. Dijkstra, E.W.: A Discipline ofProgramming. Prentice Hall PTR, Upper Saddle River (1997)
9. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM32(1), 137-161 (1985)
10. Kozen, D.: Results on the propositional μ-calculus. Theor. Comput. Sci. 27, 333-354 (1983)
11. Larsen, K.G.: Compositional Theories Based on an Operational Semantics ofContexts. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1989. LNCS, vol. 430, pp. 487-518. Springer, Heidelberg (1989)
12. Larsen, K.G., Milner, R.: A compositional protocol verification using relativized bisimula-tion. Information and computation 99(1), 80-108 (1992)
13. Larsen, K.G., Xinxin, L.: Compositionality through an operational semantics of contexts. Journal ofLogic and Computation 1(6), 761-795 (1991)
14. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
15. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
16. Winskel, G.: Topics in concurrency. Lecture notes. University of Cambridge, Cambridge (2008), http://www.cl.cam.acuk/~gwl04/TICy8.ps