The following pages link to Computer Science Logic (Q5311254):
Displaying 19 items.
- On decidability of the theory with the transitive closure operator (Q266242) (← links)
- Verification of multi-linked heaps (Q439948) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- Doomed program points (Q633286) (← links)
- Decidable fragments of many-sorted logic (Q1041587) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- (Q3177929) (← links)
- Bounded Quantifier Instantiation for Checking Inductive Invariants (Q3303891) (← links)
- Verifying Heap-Manipulating Programs in an SMT Framework (Q3510799) (← links)
- On the Decidability of Bounded Valuedness for Transducers (Q3599160) (← links)
- SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability (Q3638278) (← links)
- Interactive and automated proofs for graph transformations (Q4585009) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Decidability of weak logics with deterministic transitive closure (Q4635613) (← links)
- Local Reasoning for Global Graph Properties (Q5041096) (← links)
- An Efficient Decision Procedure for Imperative Tree Data Structures (Q5200043) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures (Q5452601) (← links)
