The following pages link to Tomáš Vojnar (Q300413):
Displaying 50 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- Programs with lists are counter automata (Q537953) (← links)
- Mediating for reduction (on minimizing alternating Büchi automata) (Q740970) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- Forest automata for verification of heap manipulation (Q2441715) (← links)
- Verification of parametric concurrent systems with prioritised FIFO resource management (Q2481584) (← links)
- Generalised multi-pattern-based verification of programs with linear linked structures (Q2642987) (← links)
- Satisfiability solving meets evolutionary optimisation in designing approximate circuits (Q2661373) (← links)
- (Q2723329) (← links)
- Compositional Entailment Checking for a Fragment of Separation Logic (Q2789053) (← links)
- From Low-Level Pointers to High-Level Containers (Q2796068) (← links)
- Monotonic abstraction for programs with multiply-linked structures (Q2841994) (← links)
- Regular model checking using inference of regular languages (Q2851061) (← links)
- Abstract regular tree model checking (Q2852015) (← links)
- Pattern-based verification of programs with extended linear linked data structures (Q2863858) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (Q2894267) (← links)
- Mediating for reduction (on minimizing alternating Büchi automata) (Q2920108) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- Monotonic Abstraction for Programs with Multiply-Linked Structures (Q3172870) (← links)
- Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata (Q3172918) (← links)
- From Shapes to Amortized Complexity (Q3296329) (← links)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- COMPOSED BISIMULATION FOR TREE AUTOMATA (Q3395139) (← links)
- Deciding Entailments in Inductive Separation Logic with Tree Automata (Q3457790) (← links)
- Proving Termination of Tree Manipulating Programs (Q3510793) (← links)
- When Simulation Meets Antichains (Q3557075) (← links)
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (Q3602801) (← links)
- Composed Bisimulation for Tree Automata (Q3602816) (← links)
- Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (Q3613378) (← links)
- Automatic Verification of Integer Array Programs (Q3636859) (← links)
- (Q4433968) (← links)
- Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata (Q5166690) (← links)
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata (Q5170274) (← links)
- Nested Antichains for WS1S (Q5194965) (← links)
- Computer Aided Verification (Q5312914) (← links)
- Computing Simulations over Tree Automata (Q5458323) (← links)
- What Else Is Decidable about Integer Arrays? (Q5458380) (← links)
- Correct Hardware Design and Verification Methods (Q5493250) (← links)
- A Logic of Singly Indexed Arrays (Q5505581) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703767) (← links)
- Programs with Lists Are Counter Automata (Q5756740) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5899069) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900565) (← links)
- Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure (Q5918382) (← 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)
