A temporal logic for multi-threaded programs

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

Volumn 7604 LNCS, Issue , 2012, Pages 225-239

  La Torre, Salvatore ^a   Napoli, Margherita ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONCURRENT PROGRAM; MODEL CHECKING PROBLEM; MULTI-THREADED PROGRAMS; NATURAL MODELS; PUSHDOWN SYSTEMS; SATISFIABILITY;

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE; MODEL CHECKING; FORMAL LOGIC; TEMPORAL LOGIC;

TEMPORAL LOGIC; MODEL CHECKING;

EID: 84866915947     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33475-7_16     Document Type: Conference Paper

References (15)

1. Alur, R., Arenas, M., Barceló, P., Etessami, K., Immerman, N., Libkin, L.: First-order and temporal logics for nested words. Log. Meth. Comp. Sci. 4(4) (2008)
2. Alur, R., Etessami, K., Madhusudan, P.: A Temporal Logic of Nested Calls and Returns. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 467-481. Springer, Heidelberg (2004)
3. Atig, M.F.: Global model checking of ordered multi-pushdown systems. In: FSTTCS, pp. 216-227 (2010)
4. Atig, M.F., Bollig, B., Habermehl, P.: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 121-133. Springer, Heidelberg (2008)
5. Atig, M.F., Bouajjani, A., Narayan Kumar, K., Saivasan, P.: Linear-time model-checking for multithreaded programs under scope-bounding. In: Mukund, M., Chakraborty, S. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 152-166. Springer, Heidelberg (2012)
6. Bollig, B., Cyriac, A., Gastin, P., Zeitoun, M.: Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 132-144. Springer, Heidelberg (2011)
7. Bozzelli, L., La Torre, S., Peron, A.: Verification of well-formed communicating recursive state machines. Theor. Comput. Sci. 403(2-3), 382-405 (2008)
8. Breveglieri, L., Cherubini, A., Citrini, C., Crespi-Reghizzi, S.: Multi-push-down languages and grammars. Int. J. Found. Comput. Sci. 7(3), 253-292 (1996)
9. Esparza, J., Schwoon, S.: A BDD-Based Model Checker for Recursive Programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 324-336. Springer, Heidelberg (2001)
10. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161-170. IEEE Computer Society (2007)
11. La Torre, S., Napoli, M.: Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 203-218. Springer, Heidelberg (2011)
12. La Torre, S., Parlato, G.: Scope-bounded multistack pushdown systems: Fixed-point, sequentialization, and tree-width (2012), http://users.ecs.soton. ac.uk/gp4/papers/scoped2012.pdf
13. Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: POPL, pp. 283-294 (2011)
14. Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46-57. IEEE Computer Society (1977)
15. 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)