Separation Logic Adapted for Proofs by Rewriting

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-14052-5_34
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Cyclic Proofs for Linear Temporal Logic

English

Logic Programming as Hypergraph Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Separation Logic

Communications of the ACM
Computer Science
2019English

A Rewriting Logic Approach to Operational Semantics

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2009English

Translating Logic Programs Into Conditional Rewriting Systems

1997English

Combining Unification and Rewriting in Proofs for Modal Logics With First-Order Undefinable Frames

2017English

Proof Automation for Functional Correctness in Separation Logic

Journal of Logic and Computation
ArtsHumanitiesHardwareArchitectureLogicTheoretical Computer ScienceSoftware
2014English

Permission-Based Separation Logic for Multithreaded Java Programs

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Permission-Based Separation Logic for Message-Passing Concurrency

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy