The following pages link to Cristiano Calcagno (Q964497):
Displaying 27 items.
- Adjunct elimination in context logic for trees (Q964499) (← links)
- Two-level languages for program optimization (Q1826626) (← links)
- Syntactic type soundness results for the region calculus (Q1854515) (← links)
- Program logic and equivalence in the presence of garbage collection. (Q1874283) (← links)
- (Q2754131) (← links)
- (Q2769428) (← links)
- Certificates and Separation Logic (Q2830040) (← links)
- (Q2852352) (← links)
- Local Reasoning about Data Update (Q2864149) (← links)
- Freefinement (Q2942853) (← links)
- Context logic as modal logic (Q3189791) (← links)
- Cyclic proofs of program termination in separation logic (Q3189830) (← links)
- Deciding validity in a spatial logic for trees (Q3367666) (← links)
- Adjunct Elimination in Context Logic for Trees (Q3498442) (← links)
- Scalable Shape Analysis for Systems Code (Q3512506) (← links)
- Classical BI: Its Semantics and Proof Theory (Q3575307) (← links)
- Modular Safety Checking for Fine-Grained Concurrency (Q3612005) (← links)
- Beyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic (Q3613386) (← links)
- Automatic Parallelization with Separation Logic (Q3617713) (← links)
- (Q4472540) (← links)
- (Q4474211) (← links)
- Stratified operational semantics for safety and correctness of the region calculus (Q5178882) (← links)
- Compositional shape analysis by means of bi-abduction (Q5261525) (← links)
- Classical BI (Q5261530) (← links)
- Permission accounting in separation logic (Q5276151) (← links)
- Context logic and tree update (Q5276152) (← links)
- Programming Languages and Systems (Q5308690) (← links)
