Mind the shapes: Abstraction refinement via topology invariants

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

Volumn 4762 LNCS, Issue , 2007, Pages 35-50

  Bauer, Jörg ^a   Toben, Tobe ^b   Westphal, Bernd ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; AUTOMATION; COMMUNICATION SYSTEMS; DYNAMICAL SYSTEMS; TOPOLOGY; VERIFICATION;

COMMUNICATION TOPOLOGY; DYNAMIC COMMUNICATION SYSTEMS (DCS); FINITARY ABSTRACTION; PLATOONING;

ABSTRACTING;

EID: 38149142374     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75596-8_5     Document Type: Conference Paper

References (19)

1. Baldan, P., Corradini, A., König, B.: Verifying finite-state graph grammars: An unfolding-based approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, Springer, Heidelberg (2004)
2. Bauer, J., Schaefer, I., Toben, T., Westphal, B.: Specification and Verification of Dynamic Communication Systems. In: Proc. ACSD 2006, IEEE, Los Alamitos (2006)
3. Bauer, J., Toben, T., Westphal, B.: Mind the shapes: Abstraction refinement via topology invariants. Reports of SFB/TR 14 AVACS 22, SFB/TR 14 AVACS, (June 2007) available at http://www.avacs.org ISSN: 1860-9821
4. Bauer, J., Wilhelm, R.: Static Analysis of Dynamic Communication Systems by Partner Abstraction. In: Nielson, H.R, filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 249-264. Springer, Heidelberg (2007)
5. Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the Association for Computing Machinery 30(2), 323-342 (1983)
6. Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 126-141. Springer, Heidelberg (2005)
7. Damm, W., Westphal, B.: Live and let die: LSC-based verification of UML-models. Science of Computer Programming 55(1-3), 117-159 (2005)
8. Brayton, R.K., et al.: VIS: a system for verification and synthesis. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 428-432. Springer, Heidelberg (1996)
9. Hsu, A., Eskafi, F., Sachs, S., Varaiya, P.: The design of platoon maneuver protocols for IVHS. PATH Report UCB-ITS-PRR-91-6, U. California (April 1991)
10. Jain, H., et al.: Using statically computed invariants in the predicate abstraction and refinement loop. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 137-151. Springer, Heidelberg (2006)
11. Lubachevsky, B.D.: An approach to automating the verification of compact parallel coordination programs. Acta Inf. 21, 125-169 (1984)
12. Lynch, N.A.: Input/output automata: Basic, timed, hybrid, probabilistic, dynamic. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 187-188. Springer, Heidelberg (2003)
13. McMillan, K.L.: A methodology for hardware verification using compositional model checking. Science of Computer Programming 37, 279-309 (2000)
14. Milner, R.: The π Calculus. Cambridge University Press, Cambridge (1999)
15. Rakow, J.: Verification of Dynamic Communication Systems. Master's thesis, Carl von Ossietzky Universität Oldenburg (April 2006)
16. Rensink, A., Distefano, D.: Abstract graph transformation. Electr. Notes Theor. Comput. Sci. 157(1), 39-59 (2006)
17. Venet, A.: Automatic determination of communication topologies in mobile systems. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 152-167. Springer, Heidelberg (1998)
18. Wachter, B., Westphal, B.: The spotlight principle. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 182-198. Springer, Heidelberg (2007)
19. Westphal, B.: LSC verification for UML models with unbounded creation and destruction. In: Proc. SoftMC 2005. ENTCS, 144(3),133-145 (2005)