Substructural logic

Results: 34



#Item
1Consequence relations and admissible rules Rosalie Iemhoff∗ Department of Philosophy Utrecht University, The Netherlands  June 10, 2016

Consequence relations and admissible rules Rosalie Iemhoff∗ Department of Philosophy Utrecht University, The Netherlands June 10, 2016

Add to Reading List

Source URL: www.phil.uu.nl

Language: English - Date: 2016-06-10 10:25:19
2Superficially Substructural Types (Technical Appendix) Neelakantan R. Krishnaswami MPI-SWS

Superficially Substructural Types (Technical Appendix) Neelakantan R. Krishnaswami MPI-SWS

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2012-08-29 08:54:52
3Program Logics for Certified Compilers

Program Logics for Certified Compilers

Add to Reading List

Source URL: vst.cs.princeton.edu

Language: English - Date: 2013-05-31 14:00:42
4Oracle Semantics for Concurrent Separation Logic (Extended Version) Aquinas Hobor1⋆ Andrew W. Appel1⋆ 1

Oracle Semantics for Concurrent Separation Logic (Extended Version) Aquinas Hobor1⋆ Andrew W. Appel1⋆ 1

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2008-01-04 15:33:28
5Rely-Guarantee References for Refinement Types over Aliased Mutable Data Colin S. Gordon, Michael D. Ernst, and Dan Grossman University of Washington PLDI 2013

Rely-Guarantee References for Refinement Types over Aliased Mutable Data Colin S. Gordon, Michael D. Ernst, and Dan Grossman University of Washington PLDI 2013

Add to Reading List

Source URL: homes.cs.washington.edu

Language: English - Date: 2013-10-24 14:36:30
6A Case for Behavior-Preserving Actions in Separation Logic David Costanzo and Zhong Shao Yale University  Abstract. Separation Logic is a widely-used tool that allows for local

A Case for Behavior-Preserving Actions in Separation Logic David Costanzo and Zhong Shao Yale University Abstract. Separation Logic is a widely-used tool that allows for local

Add to Reading List

Source URL: flint.cs.yale.edu

Language: English - Date: 2015-11-04 16:38:45
7Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee IMDEA Software Institute, Spain {ilya.sergey, aleks.nanevski, anindya.banerjee}@imdea.

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee IMDEA Software Institute, Spain {ilya.sergey, aleks.nanevski, anindya.banerjee}@imdea.

Add to Reading List

Source URL: ilyasergey.net

Language: English - Date: 2016-03-01 06:31:32
8Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity Extended version Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee IMDEA Software Institute, Spain {ilya.sergey, aleks.nanevski, anindya

Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity Extended version Ilya Sergey, Aleksandar Nanevski, and Anindya Banerjee IMDEA Software Institute, Spain {ilya.sergey, aleks.nanevski, anindya

Add to Reading List

Source URL: ilyasergey.net

Language: English - Date: 2016-03-01 06:31:32
9COMPUTER SCIENCE TRIPOS Part II – 2013 – Paper 8 8 Hoare Logic (MOM) Use notation from logic (∀, ∃, etc.) in your answers to the questions below. (a) Define the semantics of the partial correctness Hoare triple,

COMPUTER SCIENCE TRIPOS Part II – 2013 – Paper 8 8 Hoare Logic (MOM) Use notation from logic (∀, ∃, etc.) in your answers to the questions below. (a) Define the semantics of the partial correctness Hoare triple,

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2014-06-09 10:18:42