Pages that link to "Item:Q5276151"
From MaRDI portal
The following pages link to Permission accounting in separation logic (Q5276151):
Displayed 22 items.
- A verifiable low-level concurrent programming model based on colored Petri nets (Q350966) (← links)
- Formal verification of concurrent programs with Read-write locks (Q351980) (← links)
- Inter-process buffers in separation logic with rely-guarantee (Q613139) (← links)
- Fine-grained concurrency with separation logic (Q763473) (← links)
- Certifying low-level programs with hardware interrupts and preemptive threads (Q835764) (← links)
- A semantics for concurrent separation logic (Q879367) (← links)
- Resources, concurrency, and local reasoning (Q879368) (← links)
- Weak updates and separation logic (Q1758657) (← links)
- On the relation between concurrent separation logic and concurrent Kleene algebra (Q2347904) (← links)
- On assertion-based encapsulation for object invariants and simulations (Q2643129) (← links)
- Automatic Inference of Access Permissions (Q2891412) (← links)
- A Program Construction and Verification Tool for Separation Logic (Q2941173) (← links)
- Refinement to Imperative/HOL (Q2945637) (← links)
- Verified Software Toolchain (Q3000569) (← links)
- Barriers in Concurrent Separation Logic (Q3000585) (← links)
- The Relationship between Separation Logic and Implicit Dynamic Frames (Q3000593) (← links)
- Types, Maps and Separation Logic (Q3183535) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
- Polymorphic Fractional Capabilities (Q3392918) (← links)
- Separation Logic Semantics for Communicating Processes (Q5415605) (← links)
- Footprints in Local Reasoning (Q5458360) (← links)
- Separation Logic Contracts for a Java-Like Language with Fork/Join (Q5505424) (← links)