Accelerated data-flow analysis

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

Volumn 4634 LNCS, Issue , 2007, Pages 184-199

  Leroux, Jérôme ^a   Sutre, Grégoire ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CONSTRAINT THEORY; PROBLEM SOLVING; VERIFICATION;

ABSTRACT INTERPRETATION; ACCELERATION FRAMEWORKS; SYMBOLIC VERIFICATION;

DATA REDUCTION;

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

References (17)

1. Annichini, A., Bouajjani, A., Sighireanu, M.: TReX: A tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368-372. Springer, Heidelberg (2001)
2. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Acceleration of Symbolic Transition systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 118-121. Springer, Heidelberg (2003)
3. Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat acceleration in symbolic model checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474-488. Springer, Heidelberg (2005)
4. Boigelot, B., Godefroid, P., Willems, B., Wolper, P.: The power of QDDs. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol. 1302, pp. 172-186. Springer, Heidelberg (1997)
5. Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 55-67. Springer, Heidelberg (1994)
6. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points. In: Proc. 4th ACM Symp. Principles of Programming Languages, Los Angeles, CA, USA, pp. 238-252. ACM Press, New York (1977)
7. Cousot, P., Cousot, R.: Comparing the Galois connection and widening/-narrowing approaches to abstract interpretation. In: Bruynooghe, M., Wirsing, M. (eds.) PLILP 1992. LNCS, vol. 631, pp. 269-295. Springer, Heidelberg (1992)
8. Costan, A., Gaubert, S., Goubault, E., Martel, M., Putot, S.: A policy iteration algorithm for computing fixed points in static analysis of programs. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 462-475. Springer, Heidelberg (2005)
9. Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and Presburger arithmetic. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 268-279. Springer, Heidelberg (1998)
10. Finkel, A., Iyer, S.P., Sutre, G.: Well-abstracted transition systems: Application to FIFO automata. Information and Computation 181(1), 1-31 (2003)
11. Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols. In: Agrawal, M., Seth, A.K. (eds.) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2556, pp. 145-156. Springer, Heidelberg (2002)
12. Karr, M.: Affine relationship among variables of a program. Acta Informatica 6, 133-141 (1976)
13. Lash homepage, http://www.montefiore.ulg.ac.be/~boigelot/research/lash/
14. Leroux, J., Sutre, G.: Flat counter automata almost everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 489-503. Springer, Heidelberg (2005)
15. Müller-Olm, M., Seidl, H.: A note on Karr's algorithm. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 1016-1028. Springer, Heidelberg (2004)
16. Su, Z., Wagner, D.: A class of polynomially solvable range constraints for interval analysis without widenings and narrowings. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 280-295. Springer, Heidelberg (2004)
17. Seidl, H., Gawlitza, T.: Precise fixpoint computation through strategy iteration. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 300-315. Springer, Heidelberg (2007)