A dash of fairness for compositional reasoning

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

Volumn 6174 LNCS, Issue , 2010, Pages 543-557

  Cohen, Ariel ^a   Namjoshi, Kedar S ^b   Sa'ar, Yaniv ^c  

^a NEW YORK UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL METHOD; COMPOSITIONAL REASONING; ITERATIVE REFINEMENT; LOCAL FLAVOR; LOCAL PROOFS; LOCAL REASONING; PROCESS STATE; SHARED VARIABLES; STANDARD MODEL;

AUTOMATA THEORY; COMPUTER AIDED ANALYSIS;

MODEL CHECKING;

EID: 77954997812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14295-6_46     Document Type: Conference Paper

References (27)

1. Alur, R., Henzinger, T.: Reactive modules. In: IEEE LICS (1996)
2. Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87-106 (1987)
3. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)
4. Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NUSMV: a new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 495-499. Springer, Heidelberg (1999)
5. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS) 8(2) (1986)
6. Clarke, E.M., Grumberg, O.: Avoiding the state explosion problem in temporal logic model checking. In: PODC, pp. 294-303 (1987)
7. Cobleigh, J.M., Avrunin, G.S., Clarke, L.A.: Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning. In: ISSTA, pp. 97-108 (2006)
8. Cohen, A., Namjoshi, K.S.: Local proofs for global safety properties. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 55-67. Springer, Heidelberg (2007)
9. Cohen, A., Namjoshi, K.S.: Local proofs for linear-time properties of concurrent programs. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 149-161. Springer, Heidelberg (2008)
10. Cohen, A., Namjoshi, K.S., Sa'ar, Y.: SPLIT: A Compositional LTL Verifier. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 558-561. Springer, Heidelberg (2010)
11. de Roever, W.-P., de Boer, F., Hannemann, U., Hooman, J., Lakhnech, Y., Poel, M., Zwiers, J.: Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Cambridge University Press, Cambridge (2001)
12. Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, Heidelberg (1990)
13. Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional mucalculus (extended abstract). In: LICS (1986)
14. Emerson, E.A., Lei, C.-L.:Modalities for model checking: Branching time logic strikes back. Sci. of Comp. Programming 8(3) (1987)
15. Farzan, A., Chen, Y., Clarke, E.M., Tsan, Y., Wang, B.: Extending automated compositional verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 2-17. Springer, Heidelberg (2008)
16. Flanagan, C., Qadeer, S.: Thread-modular model checking. In: Ball, T., Rajamani, S.K. (eds.) SPIN 2003. LNCS, vol. 2648, pp. 213-224. Springer, Heidelberg (2003)
17. Giannakopoulou, D., Pasareanu, C.S., Barringer, H.: Assumption generation for software component verification. In: ASE, pp. 3-12 (2002)
18. Lamport, L.: A new solution of Dijkstra's concurrent programming problem. ACM Commun. 17(8), 453-455 (1974)
19. Lamport, L.: Proving the correctness of multiprocess programs. IEEE Trans. Software Eng. 3(2) (1977)
20. McMillan, K.L.: A compositional rule for hardware design refinement. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 24-35. Springer, Heidelberg (1997)
21. McMillan, K.L.: Circular compositional reasoning about liveness. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 342-346. Springer, Heidelberg (1999)
22. Namjoshi, K.S.: Symmetry and completeness in the analysis of parameterized systems. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 299-313. Springer, Heidelberg (2007)
23. Namjoshi, K.S., Trefler, R.J.: On the completeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 139-153. Springer, Heidelberg (2000)
24. Owicki, S.S., Gries, D.: Verifying properties of parallel programs: An axiomatic approach. ACM Commun. 19(5), 279-285 (1976)
25. Pnueli, A., Sa'ar, Y.: All you need is compassion. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 233-247. Springer, Heidelberg (2008)
26. Pnueli, A., Sa'ar, Y., Zuck, L.D.: JTLV: A framework for developing verification algorithms. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 171-174. Springer, Heidelberg (2010), http://jtlv.ysaar. net/
27. Tkachuk, O., Dwyer,M.B., Pasareanu, C.S.: Automated environment generation for software model checking. In: ASE, pp. 116-129 (2003)