The following pages link to Adam Rogalewicz (Q2225469):
Displaying 12 items.
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- (Q2852015) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- From Shapes to Amortized Complexity (Q3296329) (← links)
- Deciding Entailments in Inductive Separation Logic with Tree Automata (Q3457790) (← links)
- Proving Termination of Tree Manipulating Programs (Q3510793) (← links)
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (Q3613378) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- (Q4610086) (← links)
- The Tree Width of Separation Logic with Recursive Definitions (Q4928426) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919243) (← links)
