Jirí Simácek

发表

Fully Automated Shape Analysis Based on Forest Automata

Lukás Holík, Tomás Vojnar, Ondrej Lengál, 2013, CAV.

Harnessing Forest Automata for Verification of Heap Manipulating Programs. (Vérification de programmes avec structures de données complexes)

Jirí Simácek, Jirí Simácek, 2012 .

Run Forester, Run Backwards! - (Competition Contribution)

Lukás Holík, Tomás Vojnar, Ondrej Lengál, 2016, TACAS.

VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata

Tomás Vojnar, Ondrej Lengál, Jirí Simácek, 2012, TACAS.

The Tree Width of Separation Logic with Recursive Definitions

Radu Iosif, Adam Rogalewicz, Jirí Simácek, 2013, CADE.

Forest Automata for Verification of Heap Manipulation

Lukás Holík, Tomás Vojnar, Peter Habermehl, 2011, CAV.

Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars

Alexander Meduna, Tomás Masopust, Jirí Simácek, 2008, Acta Cybern..

Forest automata for verification of heap manipulation

Lukás Holík, Tomás Vojnar, Peter Habermehl, 2012, Formal Methods Syst. Des..

Evolutionary Design of Reconfiguration Strategies to Reduce the Test Application Time

Lukás Sekanina, Jirí Simácek, Lukás Starecek, 2010, ICES.

Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata

Lukás Holík, Tomás Vojnar, Ondrej Lengál, 2011, ATVA.

Forester: Shape Analysis Using Tree Automata - (Competition Contribution)

Lukás Holík, Tomás Vojnar, Ondrej Lengál, 2015, TACAS.

Forester: From Heap Shapes to Automata Predicates - (Competition Contribution)

Lukás Holík, Tomás Vojnar, Ondrej Lengál, 2017, TACAS.