Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jirí Simácek

dblp:10/9861 · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 7Theory of computation · 4Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Program analysis · 72% Program verification · 28%
Theoretical computer science
2 papers
Automata and formal languages · 100%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program analysis › static analysis › pointer analysis
shape analysis
0.212013
Fully Automated Shape Analysis Based on Forest Automata · CAV 2013
Program analysis
static analysis
0.212013
Fully Automated Shape Analysis Based on Forest Automata · CAV 2013

Methods — techniques the papers use, named apart from their topics

forest automata · 0.3
YearPublicationVenuePosition
2017 Forester: From Heap Shapes to Automata Predicates - (Competition Contribution)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
TACAS (2)5
2016 Run Forester, Run Backwards! - (Competition Contribution)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
TACAS5
2015 Forester: Shape Analysis Using Tree Automata - (Competition Contribution)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
TACAS5
2013 The Tree Width of Separation Logic with Recursive Definitions
Radu Iosif, Adam Rogalewicz, Jirí Simácek
CADE3
2013 Fully Automated Shape Analysis Based on Forest Automata
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
CAV4
2012 VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
Ondrej Lengál, Jirí Simácek, Tomás Vojnar
TACAS2
2012 Forest automata for verification of heap manipulation
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Formal Methods Syst. Des.4
2011 Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata
Lukás Holík, Ondrej Lengál, Jirí Simácek, Tomás Vojnar
ATVA3
2011 Forest Automata for Verification of Heap Manipulation
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
CAV4