Two-Variable Separation Logic and Its Inner Circle
暂无分享,去创建一个
[1] Dines Bjørner,et al. Logics of Specification Languages , 2007, Monographs in Theoretical Computer Science. An EATCS Series.
[2] M. de Rijke,et al. The Modal Logic of Inequality , 1992, J. Symb. Log..
[3] Phokion G. Kolaitis,et al. On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.
[4] Joseph Y. Halpern. The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..
[5] Wieslaw Szwast,et al. FO^2 with one transitive relation is decidable , 2013, STACS.
[6] Bernhard Beckert,et al. Dynamic Logic , 2007, The KeY Approach.
[7] Claire David,et al. Analyse de XML avec données non-bornées , 2009 .
[8] Charles G. Morgan,et al. Methods for Automated Theorem Proving in Nonclassical Logics , 1976, IEEE Transactions on Computers.
[9] Ursula Dresdner,et al. Computation Finite And Infinite Machines , 2016 .
[10] Thomas Schwentick,et al. Two-Variable Logic with Two Order Relations - (Extended Abstract) , 2010, CSL.
[11] M. Rabin. Decidability of second-order theories and automata on infinite trees , 1968 .
[12] Joël Ouaknine,et al. Tractable Reasoning in a Fragment of Separation Logic , 2011, CONCUR.
[13] Radu Iosif,et al. The Tree Width of Separation Logic with Recursive Definitions , 2013, CADE.
[14] Hongseok Yang,et al. Local reasoning for stateful programs , 2001 .
[15] James Worrell,et al. Complexity of Two-Variable Logic on Finite Trees , 2013, ICALP.
[16] Erich Grädel,et al. Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[17] Michael Fisher,et al. Equality and Monodic First-Order Temporal Logic , 2002, Stud Logica.
[18] Didier Galmiche,et al. A Modal BI Logic for Dynamic Resource Properties , 2013, LFCS.
[19] 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.
[20] Dov M. Gabbay,et al. Undecidability of modal and intermediate first-order logics with two individual variables , 1993, Journal of Symbolic Logic.
[21] Yuri Gurevich,et al. The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.
[22] A S Kahr,et al. ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE. , 1962, Proceedings of the National Academy of Sciences of the United States of America.
[23] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[24] Patricia Bouyer,et al. A logical characterization of data languages , 2002, Inf. Process. Lett..
[25] Larry Joseph Stockmeyer,et al. The complexity of decision problems in automata theory and logic , 1974 .
[26] James Brotherston,et al. Undecidability of Propositional Separation Logic and Its Neighbours , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.
[27] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[28] Kousha Etessami,et al. First-Order Logic with Two Variables and Unary Temporal Logic , 1997 .
[29] Yde Venema,et al. Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.
[30] Ben C. Moszkowski,et al. A Hierarchical Completeness Proof for Propositional Interval Temporal Logic with Finite Time , 2004, J. Appl. Non Class. Logics.
[31] Jakub Michaliszyn,et al. Two-Variable First-Order Logic with Equivalence Closure , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.
[32] James Worrell,et al. Complexity of Two-Variable Logic on Finite Trees , 2013, ACM Trans. Comput. Log..
[33] Witold Charatonik,et al. Decidability of weak logics with deterministic transitive closure , 2014, CSL-LICS.
[34] Stéphane Demri,et al. On the almighty wand , 2012, Inf. Comput..
[35] Martin Otto,et al. Undecidability Results on Two-Variable Logics , 1997, STACS.
[36] Benjamin Charles Moszkowski. Reasoning about Digital Circuits , 1983 .
[37] Martin Otto,et al. Two variable first-order logic over ordered domains , 2001, Journal of Symbolic Logic.
[38] Stéphane Demri,et al. Separation Logic with One Quantified Variable , 2016, Theory of Computing Systems.
[39] Harry R. Lewis,et al. Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..
[40] Peter W. O'Hearn,et al. Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.
[41] Michael Mortimer,et al. On languages with two variables , 1975, Math. Log. Q..
[42] Martin Leucker,et al. Ordered Navigation on Multi-attributed Data Words , 2014, CONCUR.
[43] D. Holdstock. Past, present--and future? , 2005, Medicine, conflict, and survival.
[44] D. Gabbay. Expressive Functional Completeness in Tense Logic (Preliminary report) , 1981 .
[45] R. Labrecque. The Correspondence Theory , 1978 .
[46] Kshitij Bansal,et al. Beyond Shapes: Lists with Ordered Data , 2009, FoSSaCS.
[47] James Brotherston,et al. A decision procedure for satisfiability in separation logic with inductive predicates , 2014, CSL-LICS.
[48] Neil Immerman,et al. Expressiveness and succinctness of first-order logic on finite words , 2011 .
[49] Diego Figueira,et al. Reasoning on words and trees with data , 2010 .
[50] Leszek Pacholski,et al. Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.
[51] Philippe Schnoebelen,et al. The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..
[52] Anuj Dawar,et al. Expressiveness and complexity of graph logic , 2007, Inf. Comput..
[53] Dov M. Gabbay,et al. EXPRESSIVE FUNCTIONAL COMPLETENESS IN TENSE LOGIC , 1981 .
[54] Dominique Larchey-Wendling,et al. Nondeterministic Phase Semantics and the Undecidability of Boolean BI , 2011, TOCL.
[55] Thomas Schwentick,et al. Two-variable logic on data words , 2011, TOCL.
[56] Richard Spencer-Smith,et al. Modal Logic , 2007 .
[57] Ulrike Sattler,et al. The Complexity of Reasoning with Boolean Modal Logics , 2000, Advances in Modal Logic.