暂无分享,去创建一个
[1] Cristiano Calcagno,et al. Infer: An Automatic Program Verifier for Memory Safety of C Programs , 2011, NASA Formal Methods.
[2] Stéphane Demri,et al. On the almighty wand , 2012, Inf. Comput..
[3] Stéphane Demri,et al. Separation Logic with One Quantified Variable , 2014, CSR.
[4] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[5] Dana Scott. DECIDABILITY OF SECOND-ORDER THEORIES AND AUTOMATA ON INFINITE TREES , 2007 .
[6] Nicolas Peltier,et al. On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic , 2018, ArXiv.
[7] Peter W. O'Hearn,et al. BI as an assertion language for mutable data structures , 2001, POPL '01.
[8] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .
[9] Yuri Gurevich,et al. The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.
[10] John C. Reynolds,et al. Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.
[11] Peter W. O'Hearn,et al. Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.