Pages that link to "Item:Q5465888"
From MaRDI portal
The following pages link to FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465888):
Displaying 40 items.
- On the almighty wand (Q418137) (← links)
- Verifying pointer safety for programs with unknown calls (Q604389) (← links)
- Quantitative separation logic and programs with lists (Q707740) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Formal verification of C systems code. Structured types, separation logic and theorem proving (Q835768) (← links)
- Resources, concurrency, and local reasoning (Q879368) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Unifying separation logic and region logic to allow interoperability (Q1798668) (← links)
- Contributed papers. Restriction on cut in cyclic proof system for symbolic heaps (Q2039937) (← links)
- Strong-separation logic (Q2233486) (← links)
- Compositional satisfiability solving in separation logic (Q2234106) (← links)
- Extended transitive separation logic (Q2347905) (← links)
- Automated mutual induction proof in separation logic (Q2414251) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Transitive Separation Logic (Q2915132) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
- Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic (Q3179308) (← links)
- A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
- Disproving Inductive Entailments in Separation Logic via Base Pair Approximation (Q3455777) (← links)
- On the Almighty Wand (Q3540188) (← links)
- On Model Checking Boolean BI (Q3644756) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- (Q4989410) (← links)
- Local Reasoning for Global Graph Properties (Q5041096) (← links)
- A First-Order Logic with Frames (Q5041109) (← links)
- Decision Procedure for Entailment of Symbolic Heaps with Arrays (Q5055997) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- (Q5111651) (← links)
- On Symbolic Heaps Modulo Permission Theories (Q5136317) (← links)
- (Q5155678) (← links)
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures (Q5452601) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Automatically verifying temporal properties of pointer programs with cyclic proof (Q5919481) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- Make flows small again: revisiting the flow framework (Q6535380) (← links)
- Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
- Restriction on cut rule in cyclic-proof system for symbolic heaps (Q6633582) (← links)
