Language-theoretic abstraction refinement

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

Volumn 7212 LNCS, Issue , 2012, Pages 362-376

  Long, Zhenyue ^a,b,c   Calin, Georgel ^d   Majumdar, Rupak ^a   Meyer, Roland ^d  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^c UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

^d University of Koblenz Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION REFINEMENT; BOUNDED LANGUAGE; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; EMPTINESS PROBLEM; EXPERIMENTAL COMPARISON; MULTI-THREADED PROGRAMS; SAFETY VERIFICATION; UNDER-APPROXIMATION;

ALGORITHMS; VERIFICATION; ABSTRACTING; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; MODEL CHECKING; SAFETY ENGINEERING; SOFTWARE ENGINEERING;

CONTEXT FREE LANGUAGES;

EID: 84859142034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28872-2_25     Document Type: Conference Paper

References (29)

1. Armstrong, J., Virding, R., Wikström, C., Williams, M.: Concurrent Programming in Erlang, 2nd edn. Prentice Hall (1996)
2. Ball, T., Rajamani, S.K.: The SLAM project: debugging system software via static analysis. In: POPL 2002: Principles of Programming Languages, pp. 1-3. ACM (2002)
3. Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. International Journal on Foundations of Computer Science 14(4), 551-582 (2003)
4. Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T.: Verifying Concurrent Message-Passing C Programs with Recursive Calls. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 334-349. Springer, Heidelberg (2006)
5. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752-794 (2003)
6. Clarke, E.M., Talupur, M., Veith, H.: Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems. In: Ramakrish-nan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 33-47. Springer, Heidelberg (2008)
7. Eǧecioǧlu, Ö.: Strongly Regular Grammars and Regular Approximation of Context-Free Languages. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 207-220. Springer, Heidelberg (2009)
8. Esparza, J., Ganty, P.: Complexity of pattern-based verification for multithreaded programs. In: POPL 2011: Principles of Programming Languages, pp. 499-510. ACM (2011)
9. Ganty, P., Majumdar, R., Monmege, B.: Bounded Underapproximations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 600-614. Springer, Heidelberg (2010)
10. Ginsburg, S., Spanier, E.H.: Bounded Algol-like languages. Transactions of the American Mathematical Society 113(2), 333-368 (1964)
11. Gupta, A., Popeea, C., Rybalchenko, A.: Predicate abstraction and refinement for verifying multi-threaded programs. In: POPL 2011: Principles of Programming Languages, pp. 331-344. ACM (2011)
12. Henzinger, T.A., Jhala, R., Majumdar, R.: Race checking by context inference. In: PLDI 2004: Programming Language Design and Implementation, pp. 1-13. ACM (2004)
13. Henzinger, T.A., Jhala, R., Majumdar, R., Qadeer, S.: Thread-Modular Abstraction Refinement. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 262-274. Springer, Heidelberg (2003)
14. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL 2002: Principles of Programming Languages, pp. 58-70. ACM (2002)
15. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)
16. Kahlon, V.: Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise CFL-reachability for threads communicating via locks. In: LICS 2009: Logic in Computer Science, pp. 27-36. IEEE Computer Society (2009)
17. Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: POPL 2003: Principles of Programming Languages, pp. 303-314. ACM (2007)
18. Kidd, N.: Bluetooth protocol, http://pages.cs.wisc.edu/~kidd/bluetooth/
19. Lal, A., Reps, T.: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 37-51. Springer, Heidelberg (2008)
20. Latteux, M., Leguy, J.: Une propriété de la famille GRE. In: FCT 1979, pp. 255-261. Akademie-Verlag (1979)
21. Mohri, M., Nederhof, M.-J.: Regular approximation of context-free grammars through transformation. In: Robustness in Language and Speech Technology, vol. 9, pp. 251-261. Kluwer Academic Publishers (2000)
22. Patin, G., Sighireanu, M., Touili, T.: Spade: Verification of Multithreaded Dynamic and Recursive Programs. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 254-257. Springer, Heidelberg (2007)
23. Qadeer, S., Rehof, J.: Context-Bounded Model Checking of Concurrent Software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93-107. Springer, Heidelberg (2005)
24. Qadeer, S., Wu, D.: Kiss: keep it simple and sequential. In: PLDI 2004: Programming Language Design and Implementation, pp. 14-24. ACM (2004)
25. Ben Rajeb, N., Nasraoui, B., Robbana, R., Touili, T.: Verifying multithreaded recursive programs with integer variables. Electr. Notes Theor. Comput. Sci. 239, 143-154 (2009)
26. Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecid-able. ACM TOPLAS 22(2), 416-430 (2000)
27. Suwimonteerabuth, D., Esparza, J., Schwoon, S.: Symbolic Context-Bounded Analysis of Multithreaded Java Programs. In: Havelund, K., Majumdar, R. (eds.) SPIN 2008. LNCS, vol. 5156, pp. 270-287. Springer, Heidelberg (2008)
28. van Leeuwen, J.: Effective constructions in well-partially-ordered free monoids. Discrete Mathematics 21(3), 237-252 (1978)
29. Peterson, G.L.: Myths about the mutual exclusion problem. Inf. Process. Lett. 3(12), 115-116 (1981)