Separation Logic Expressiveness and Copyless Message-Passing

[1]  Stéphane Demri,et al.  On the almighty wand , 2012, Inf. Comput..

[2]  Hongseok Yang,et al.  Relational Parametricity and Separation Logic , 2008, Log. Methods Comput. Sci..

[3]  Joël Ouaknine,et al.  Tractable Reasoning in a Fragment of Separation Logic , 2011, CONCUR.

[4]  Vasco Thudichum Vasconcelos,et al.  Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication , 1998, SecReT@ICALP.

[5]  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.

[6]  Peter W. O'Hearn,et al.  Smallfoot: Modular Automatic Assertion Checking with Separation Logic , 2005, FMCO.

[7]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[8]  Peter W. O'Hearn,et al.  Computability and Complexity Results for a Spatial Assertion Language for Data Structures , 2001, APLAS.

[9]  John C. Reynolds,et al.  An Overview of Separation Logic , 2005, VSTTE.

[10]  Anuj Dawar,et al.  Separating Graph Logic from MSO , 2009, FoSSaCS.

[11]  Alain Finkel,et al.  From pointer systems to counter systems using shape analysis , 2006 .

[12]  Étienne Lozes,et al.  A spatial equational logic for the applied π-calculus , 2008, Distributed Computing.

[13]  Viktor Vafeiadis,et al.  Proving that non-blocking algorithms don't block , 2009, POPL '09.

[14]  Jan Smans,et al.  Deadlock-Free Channels and Locks , 2010, ESOP.

[15]  Étienne Lozes,et al.  Reliable Contracts for Unreliable Half-Duplex Communications , 2011, WS-FM.

[16]  Ralf Treinen,et al.  Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus , 2011, TOSCA.

[17]  Peter W. O'Hearn.  Tutorial on Separation Logic (Invited Tutorial) , 2008, CAV.

[18]  Viktor Vafeiadis.  Concurrent Separation Logic and Operational Semantics , 2011, MFPS.

[19]  Peter W. O'Hearn,et al.  Compositional Shape Analysis by Means of Bi-Abduction , 2011, JACM.

[20]  Julian Rathke,et al.  Permission-Based Separation Logic for Message-Passing Concurrency , 2011, Log. Methods Comput. Sci..

[21]  Eric G. Manning,et al.  On the Progress of Communications between Two Finite State Machines , 1984, Inf. Control..

[22]  Stéphane Demri,et al.  Reasoning about sequences of memory states , 2009, Ann. Pure Appl. Log..

[23]  Cosimo Laneve,et al.  Linear forwarders , 2007, Inf. Comput..

[25]  Multiparty asynchronous session types , 2008, POPL '08.

[26]  Peter W. O'Hearn,et al.  Resources, Concurrency and Local Reasoning , 2004, CONCUR.

[27]  Peter Lee,et al.  Automatic numeric abstractions for heap-manipulating programs , 2010, POPL '10.

[28]  Peter W. O'Hearn,et al.  BI as an assertion language for mutable data structures , 2001, POPL '01.

[29]  Ahmed Bouajjani,et al.  Programs with lists are counter automata , 2011, Formal Methods Syst. Des..

[30]  S. Presentation.  Separation logic preserves the expressive power of classical logic , 2003 .

[31]  Peter W. O'Hearn,et al.  Variance analyses from invariance analyses , 2007, POPL '07.

[32]  Viktor Vafeiadis,et al.  Modular Safety Checking for Fine-Grained Concurrency , 2007, SAS.

[33]  Étienne Lozes,et al.  Elimination of spatial connectives in static spatial logics , 2005, Theor. Comput. Sci..

[34]  David Nowak,et al.  Towards symbolic verification of programs handling pointers , 2004 .

[35]  Cristiano Calcagno,et al.  Proving Copyless Message Passing , 2009, APLAS.

[36]  Samik Basu,et al.  Choreography conformance via synchronizability , 2011, WWW.

[37]  Andrew W. Appel,et al.  A theory of indirection via approximation , 2010, POPL '10.

[38]  Anuj Dawar,et al.  Expressiveness and complexity of graph logic , 2007, Inf. Comput..

[39]  Peter W. O'Hearn,et al.  The Complexity of Abduction for Separated Heap Abstractions , 2011, SAS.

[40]  Carroll Morgan.  The Shadow Knows: Refinement and security in sequential programs , 2009, Sci. Comput. Program..

[41]  Étienne Lozes.  Adjuncts elimination in the static ambient logic , 2003, EXPRESS.

[42]  James R. Larus,et al.  Language support for fast and reliable message-based communication in singularity OS , 2006, EuroSys.

[43]  Peter W. O'Hearn,et al.  A Local Shape Analysis Based on Separation Logic , 2006, TACAS.

[44]  Jerzy Marcinkowski.  On the Expressive Power of Graph Logic , 2006, CSL.

[45]  James Brotherston,et al.  Undecidability of Propositional Separation Logic and Its Neighbours , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[46]  Alexey Gotsman,et al.  Local Reasoning for Storable Locks and Threads , 2007, APLAS.

[47]  B. Pierce,et al.  Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009 , 2009, POPL.

[48]  Alain Finkel,et al.  Verification of programs with half-duplex communication , 2005, Inf. Comput..

[49]  Andrew W. Appel,et al.  Concurrent Separation Logic for Pipelined Parallelization , 2010, SAS.

[50]  Nick Benton,et al.  Relational Reasoning in a Nominal Semantics for Storage , 2005, TLCA.

[51]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[52]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[53]  Peter W. O'Hearn.  Abductive, Inductive and Deductive Reasoning about Resources , 2010, CSL.

[54]  Vasco Thudichum Vasconcelos,et al.  A Linear Account of Session Types in the Pi Calculus , 2010, CONCUR.

[55]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[56]  Peter W. O'Hearn,et al.  Local Action and Abstract Separation Logic , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[57]  Luca Padovani,et al.  Typing Copyless Message Passing , 2012, Log. Methods Comput. Sci..

[58]  Marius Bozga,et al.  Quantitative Separation Logic and Programs with Lists , 2008, Journal of Automated Reasoning.

[59]  Kshitij Bansal,et al.  Beyond Shapes: Lists with Ordered Data , 2009, FoSSaCS.

[60]  Jules Villard,et al.  Heaps and Hops , 2011 .

[61]  Viktor Vafeiadis,et al.  Bi-abductive Resource Invariant Synthesis , 2009, APLAS.

[62]  Stephen D. Brookes,et al.  A Semantics for Concurrent Separation Logic , 2004, CONCUR.

[63]  Andrew W. Appel,et al.  Oracle Semantics for Concurrent Separation Logic , 2008, ESOP.

[64]  Philippa Gardner,et al.  From Separation Logic to First-Order Logic , 2005, FoSSaCS.

[65]  Peter W. O'Hearn,et al.  Symbolic Execution with Separation Logic , 2005, APLAS.

[66]  Anuj Dawar,et al.  Adjunct Elimination Through Games in Static Ambient Logic , 2004, FSTTCS.

[67]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

[68]  Torben Amtoft,et al.  A logic for information flow in object-oriented programs , 2006, POPL '06.

[69]  Suresh Jagannathan,et al.  Modular reasoning for deterministic parallelism , 2011, POPL '11.

[70]  Peter W. O'Hearn,et al.  A Decidable Fragment of Separation Logic , 2004, FSTTCS.

[71]  Ganesh Gopalakrishnan,et al.  Precise Dynamic Analysis for Slack Elasticity: Adding Buffering without Adding Bugs , 2010, EuroMPI.

[72]  Peter W. O'Hearn,et al.  Local Reasoning about Programs that Alter Data Structures , 2001, CSL.

[73]  Tevfik Bultan,et al.  Analyzing singularity channel contracts , 2009, ISSTA.

[74]  Philippa Gardner,et al.  Context logic as modal logic: completeness and parametric inexpressivity , 2007, POPL '07.