Pages that link to "Item:Q2643337"
From MaRDI portal
The following pages link to A logic of reachable patterns in linked data-structures (Q2643337):
Displaying 13 items.
- Reachability predicates for graph assertions (Q1708656) (← links)
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems (Q2408742) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
- Simulating reachability using first-order logic with applications to verification of linked data structures (Q3636811) (← links)
- Interactive and automated proofs for graph transformations (Q4585009) (← links)
- PDL for structured data: a graph-calculus approach (Q4644610) (← links)
- An Efficient Decision Procedure for Imperative Tree Data Structures (Q5200043) (← links)
- Computer Aided Verification (Q5312907) (← links)
- Implication and Axiomatization of Functional Constraints on Patterns with an Application to the RDF Data Model (Q5404959) (← links)
- Static Analysis (Q5466571) (← links)
- Computer Aided Verification (Q5716590) (← links)
- Foundations of Software Science and Computation Structures (Q5899082) (← links)