Ideal abstractions for well-structured transition systems

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

Volumn 7148 LNCS, Issue , 2012, Pages 445-460

  Zufferey, Damien ^a   Wies, Thomas ^b   Henzinger, Thomas A ^a  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; ABSTRACT INTERPRETATIONS; FORMAL ANALYSIS; FORWARD ANALYSIS; GENERIC ALGORITHM; INFINITE STATE SYSTEMS; PROTOTYPE IMPLEMENTATIONS; SIMULATION RELATION; STATE SPACE; VERIFICATION PROBLEMS; WELL-STRUCTURED TRANSITION SYSTEMS; WIDENING OPERATORS;

ABSTRACTING; ALGORITHMS; COMPUTER PROGRAMMING; COMPUTER SIMULATION;

MODEL CHECKING;

EID: 84856138122     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-27940-9_29     Document Type: Conference Paper

References (30)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS, pp. 313-321 (1996)
2. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. FMSD 25(1), 39-65 (2004)
3. Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. In: LICS, pp. 160-170 (1993)
4. Azzopardi, T.: Generic compute server in Scala using remote actors (2008), http://tiny.cc/yjzva (accessed November 2011)
5. Bagnara, R., Hill, P.M., Zaffanella, E.: Widening operators for powerset domains. Software Tools for Technology Transfer 8(4/5), 449-466 (2006)
6. Calcagno, C., Distefano, D., O'Hearn, P.W., Yang, H.: Compositional shape analysis by means of bi-abduction. In: POPL, pp. 289-300 (2009)
7. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL, pp. 238-252 (1977)
8. Cousot, P., Cousot, R.: Systematic design of program analysis frameworks. In: POPL, pp. 269-282. ACM (1979)
9. Cousot, P., Cousot, R.: Abstract interpretation frameworks. Journal of Logic and Computation 2(4), 511-547 (1992)
10. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103-115. Springer, Heidelberg (1998)
11. Engelfriet, J., Gelsema, T.: Multisets and structural congruence of the pi-calculus with replication. Theor. Comput. Sci. 211(1-2), 311-337 (1999)
12. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part I: Completions. In: STACS. Dagstuhl Sem. Proc., vol. 09001, pp. 433-444 (2009)
13. Finkel, A., Goubault-Larrecq, J.: Forward Analysis for WSTS, Part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 188-199. Springer, Heidelberg (2009)
14. Finkel, A., Schnoebelen, P.:Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
15. Ganty, P., Raskin, J.-F., Van Begin, L.: A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 49-64. Springer, Heidelberg (2005)
16. Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1), 180-203 (2006)
17. Goubault-Larrecq, J.: On noetherian spaces. In: LICS, pp. 453-462. IEEE Computer Society (2007)
18. Haller, P., Odersky, M.: Scala actors: Unifying thread-based and event-based programming. Theor. Comput. Sci. 410(2-3), 202-220 (2009)
19. Joshi, S., König, B.: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems. In: Gupta, A.,Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 214-226. Springer, Heidelberg (2008)
20. Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147-195 (1969)
21. Lift. Lift web framework, http://liftweb.net/
22. Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS. IFIP, vol. 273, pp. 477-489. Springer, Boston (2008)
23. Milner, E.C.: Basic wqo- and bqo-theory. Graphs and order (1985)
24. Milner, R.: The polyadic pi-calculus: A tutorial. In: Logic and Algebra of Specification. Computer and Systems Sciences. Springer, Heidelberg (1993)
25. Petri, C.A., Reisig, W.: Scholarpedia 3(4), 6477 (2008), http://www.scholarpedia.org/article/Petri-net
26. Rival, X., Mauborgne, L.: The trace partitioning abstract domain. ACM Trans. Program. Lang. Syst. 29(5) (2007)
27. Schnoebelen, P.: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In: Hliněný, P., Kučera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 616-628. Springer, Heidelberg (2010)
28. Wies, T., Zufferey, D., Henzinger, T.A.: Forward Analysis of Depth-Bounded Processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 94-108. Springer, Heidelberg (2010)
29. Zufferey, D.,Wies, T.: Picasso Analyzer, http://ist.ac.at/~zufferey/ picasso/
30. Zufferey, D., Wies, T., Henzinger, T.A.: On ideal abstractions for well-structured transition systems. Technical Report IST-2011-10, IST Austria (November 2011)