On Bounded Reachability Analysis of Shared Memory Systems
暂无分享,去创建一个
Mohamed Faouzi Atig | Ahmed Bouajjani | K. Narayan Kumar | Prakash Saivasan | A. Bouajjani | M. Atig | Prakash Saivasan | K. Kumar
[1] Jakob Rehof,et al. Context-Bounded Model Checking of Concurrent Software , 2005, TACAS.
[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[3] Tayssir Touili,et al. On the Reachability Analysis of Acyclic Networks of Pushdown Systems , 2008, CONCUR.
[4] Rodney R. Howell,et al. An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines , 1985, J. Comput. Syst. Sci..
[5] Anthony Widjaja Lin,et al. Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters , 2012, CAV.
[6] Mohamed Faouzi Atig,et al. Model-Checking of Ordered Multi-Pushdown Automata , 2012, Log. Methods Comput. Sci..
[7] Tayssir Touili,et al. Verifying Parallel Programs with Dynamic Communication Structures , 2009, CIAA.
[8] Bruno Courcelle,et al. On Constructing Obstruction Sets of Words , 1991, Bull. EATCS.
[9] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.
[10] Salvatore La Torre,et al. A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[11] Philippe Schnoebelen,et al. Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems , 2007, FSTTCS.
[12] Rupak Majumdar,et al. Parameterized Verification of Asynchronous Shared-Memory Systems , 2013, CAV.
[13] Matthew Hague,et al. Parameterised Pushdown Systems with Non-Atomic Writes , 2011, FSTTCS.