The following pages link to Ondřej Lengál (Q300411):
Displaying 22 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- A symbolic algorithm for the case-split rule in string constraint solving (Q2038090) (← links)
- Compositional Entailment Checking for a Fragment of Separation Logic (Q2789053) (← links)
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (Q2894267) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (Q3172918) (← links)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- (Q5144658) (← links)
- Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata (Q5166690) (← links)
- Nested Antichains for WS1S (Q5194965) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5919501) (← links)
- Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation (Q6134248) (← links)
- Complementing Büchi Automata with Ranker (Q6487336) (← links)
- Modular mix-and-match complementation of Büchi automata (Q6535356) (← links)
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation (Q6535611) (← links)
- Simulations in rank-based Büchi automata complementation (Q6536321) (← links)
- Succinct determinisation of counting automata via sphere construction (Q6536322) (← links)
- Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata" (Q6697729) (← links)
