The spotlight principle on combining process-summarizing state abstractions

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

Volumn 4349 LNCS, Issue , 2007, Pages 182-198

  Wachter, Björn ^a   Westphal, Bernd ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; DATA REDUCTION; DATA STRUCTURES;

ENVIRONMENT ABSTRACTION; INTERLINKED PROCESSES;

ABSTRACTING;

EID: 36349025169     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (21)

1. Hsu, A., Eskafi, F., Sachs, S., Varaiya, P.: The Design of Platoon Maneuver Protocols for IVHS. PATH Research Report UCB-ITS-PRR-91-6, Institute of Transportation Studies, University of California at Berkeley (1991) ISSN 1055-1425.
2. Pnueli, A., Xu, J., Zuck, L.: Liveness with (0,1,infty)-counter abstraction. In Hunt, Jr., W.A., Somenzi, F., eds.: Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings. Volume 2725 of Lecture Notes in Computer Science., Springer (2003) 107-133
3. Lubachevsky, B.D.: An Approach to Automating the Verification of Compact Parallel Coordination Programs. Acta Informatica 21 (1984) 125-169
4. Pong, F., Dubois, M.: Formal verification of complex coherence protocols using symbolic state models. J. ACM 45 (1998) 557-587
5. German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM 39 (1992) 675-735
6. Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In Emerson, E.A., Namjoshi, K.S., eds.: Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings. Volume 3855 of Lecture Notes in Computer Science., Springer (2006) 126-141
7. McMillan, K.L.: Verification of infinite state systems by compositional model checking (charme). In Pierre, L., Kropf, T., eds.: Correct Hardware Design and Verification Methods, 10th IFIP WG 10.5 Advanced Research Working Conference, CHARME '99, Bad Herrenalb, Germany, September 27-29, 1999, Proceedings. Volume 1703 of Lecture Notes in Computer Science., Springer (1999) 219-234
8. Sagiv, S., Reps, T.W., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 22 (2001)
9. Yahav, E.: Verifying safety properties of concurrent Java programs using 3-valued logic. ACM SIGPLAN Notices 36 (2001) 27-40
10. Yahav, E., Ramalingam, G.: Verifying safety properties using separation and heterogeneous abstractions. In: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation, ACM Press (2004) 25-34
11. Yahav, E., Reps, T., Sagiv, S., Wilhelm, R.: Verifying Temporal Heap Properties Specified via Evolution Logic. In Degano, P., ed.: Programming Languages and Systems, 12th European Symposium on Programming, ESOP 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings. Number 2618 in Lecture Notes in Computer Science, Springer-Verlag (2003) 204-222
12. Distefano, D., Katoen, J.P., Rensink, A.: Who is Pointing When to Whom? In: Proceedings of the 24th International Conference On Foundations of Software Technology and Theoretical Computer Science. (2004) 250-262
13. McMillan, K.L., Qadeer, S., Saxe, J.B.: Induction in Compositional Model Checking. In: Proceedings of the 12th International Conference on Computer-Aided Verification, CAV 2000, Chicago, IL, USA, July 15-19, 2000. (2000) 312-327
14. Manevich, R., Yahav, E., Ramalingam, G., Sagiv, M.: Predicate abstraction and canonical abstraction for singly-linked lists. In Cousot, R., ed.: Verification, Model Checking, and Abstract Interpretation, 6th International Conference, VM-CAI 2005, Paris, France, January 17-19, 2005, Proceedings. Volume 3385 of Lecture Notes in Computer Science., Springer (2005) 181-198
15. Damm, W., Westphal, B.: Live and Let Die: LSC-based Verification of UML-Models. In Boer, F., Bonsangue, M., Graf, S., de Roever, W.P., eds.: Formal Methods for Components and Objects First International Symposium, FMCO 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures. Number 2852 in Lecture Notes in Computer Science, Springer-Verlag (2003) 99-135
16. Dams, D., Namjoshi, K.S.: Shape Analysis through Predicate Abstraction and Model Checking. In: VMCAI 2003: Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation, London, UK, Springer-Verlag (2003) 310-324
17. Kesten, Y., Pnueli, A.: Control and Data Abstraction: The Cornerstones of Practical Formal Verification. International Journal on Software Tools for Technology Transfer 2 (2000) 328-342
18. Lamport, L.: A New Solution of Dijkstra's Concurrent Programming Problem. Communications of the ACM 17 (1974) 453-455
19. Lev-Ami, T., Sagiv, M.: TVLA: A System for Implementing Static Analyses. In Palsberg, J., ed.: Static Analysis, 7th International Symposium, SAS 2000, Santa Barbara, CA, USA, June 29 - July 1, 2000, Proceedings. Number 1824 in Lecture Notes in Computer Science, Springer-Verlag (2000) 280-301
20. Podelski, A., Wies, T.: Boolean Heaps. In Hankin, C., Siveroni, I., eds.: Static Analysis, 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005, Proceedings. Volume 3672 of Lecture Notes in Computer Science., Springer (2005) 268-283
21. Wachter, B.: Checking universally quantified temporal properties with three-valued analysis. Master's thesis, Universität des Saarlandes (2005)