Reasoning About Threads Communicating via Locks
暂无分享,去创建一个
[1] Antoni Mazurkiewicz,et al. CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.
[2] Scott D. Stoller,et al. Model-checking multi-threaded distributed Java programs , 2000, International Journal on Software Tools for Technology Transfer.
[3] Thomas W. Reps,et al. Precise interprocedural dataflow analysis via graph reachability , 1995, POPL '95.
[4] Pierre Wolper,et al. Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..
[5] Tayssir Touili,et al. A Generic Approach to the Static Analysis of Concurrent Programs with Procedures , 2003, Int. J. Found. Comput. Sci..
[6] David A. Schmidt,et al. Program Analysis as Model Checking of Abstract Interpretations , 1998, SAS.
[7] Klaus Havelund,et al. Model Checking Programs , 2004, Automated Software Engineering.
[8] Patrice Godefroid,et al. Model checking for programming languages using VeriSoft , 1997, POPL '97.
[9] Lori A. Clarke,et al. Data flow analysis for verifying properties of concurrent programs , 1994, SIGSOFT '94.
[10] Thomas A. Henzinger,et al. Thread-Modular Abstraction Refinement , 2003, CAV.
[11] Javier Esparza,et al. Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.
[12] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[13] G. Ramalingam,et al. Context-sensitive synchronization-sensitive analysis is undecidable , 2000, TOPL.
[14] Igor Walukiewicz. Model Checking CTL Properties of Pushdown Systems , 2000, FSTTCS.
[15] Jakob Rehof,et al. Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.
[16] Jakob Rehof,et al. Summarizing procedures in concurrent programs , 2004, POPL.