Static analysis of dynamic communication systems by partner abstraction

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

Volumn 4634 LNCS, Issue , 2007, Pages 249-264

  Bauer, Jörg ^a   Wilhelm, Reinhard ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AD HOC NETWORKS; CONGESTION CONTROL (COMMUNICATION); STATIC ANALYSIS; VERIFICATION;

DYNAMIC COMMUNICATION SYSTEMS; PARTNER ABSTRACTION; SPECIFICATION FORMALISMS;

COMMUNICATION SYSTEMS;

EID: 38149129413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74061-2_16     Document Type: Conference Paper

References (14)

1. Rozenberg, G.(ed.).: Handbook of Graph Grammars and Computing by Graph Transformations, vol 1: Foundations. World Scientific, Singapore (1997)
2. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation of fixed points. In: Symp. on Princ. of Prog. Lang., New York, NY, pp. 238-252. ACM Press, New York (1977)
3. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: Symp. on Princ, of Prog. Lang., pp. 269-282. ACM Press, New York (1979)
4. Hsu, A., Eskafi, F., Sachs, S., Varaiya, P.: The design of platoon maneuver protocols for IVHS. Technical Report UCB-ITS-PRR-91-6, University of California, Berkley (1991)
5. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems 24(3), 217-298 (2002)
6. Bauer, J.: Analysis of Communication Topologies by Partner Abstraction. PhD thesis, Universität des Saarlandes,(2006) Available from http://www2.imm.dtu.dk/~joba/phd.pdf
7. Bauer, J., Schaefer, I., Toben, T., Westphal, B.: Specification and verification of dynamic communication systems. In: Proc. of the 6th Conference on Application of Concurrency to System Design (ACSD 2006), IEEE Computer Society Press, Los Alamitos (2006)
8. Bouajjani, A., Jurski, Y., Sighireanu, M.: A generic framework for reasoning about dynamic networks of infinite-state processes. In: Grumberg, O., Huth, M. (eds.) 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (January 2007)
9. Abdulla, P.A., Delzanno, G., Rezine, A.: Parameterized verification of infinite-state processes with global conditions. In: Damm, W., Hermanns, H. (eds.) Proc. CAV'07, 19th International Conference on Computer Aided Verification (July 2007)
10. Venet, A.: Automatic determination of communication topologies in mobile systems. In: Static Analysis Symposium, pp. 152-167 (1998)
11. Baldan, P., Corradini, A., König, B.: Verifying finite-state graph grammars: An unfoldingbased approach. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 83-98. Springer, Heidelberg (2004)
12. Baldan, P., Corradini, A., Montanari, U.: Unfolding and event structure semantics for graph grammars. In: Thomas, W. (ed.) ETAPS 1999 and FOSSACS 1999. LNCS, vol. 1578, pp. 73-89. Springer, Heidelberg (1999)
13. Clark, D., Hankin, C., Hunt, S.: Safety of strictness analysis via term graph rewriting. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 95-114. Springer, Heidelberg (2000)
14. Rensink, A., Distefano, D.: Abstract graph transformation. Electr. Notes Theor. Comput. Sci. 157(1), 39-59 (2006)