BibSLEIGH — Tomas

Travelled to:

1 × Austria
1 × Cyprus
1 × Estonia
1 × Italy
1 × Korea
1 × Russia
2 × France
2 × Hungary
3 × United Kingdom
5 × USA

Collaborated with:

L.Holík P.Habermehl P.Peringer A.Bouajjani K.Dudka P.Müller O.Lengál R.Iosif P.A.Abdulla J.Simácek A.Rogalewicz L.Kaati P.Moro M.Bozga Y.Chen R.Mayr T.Fiedor V.Havlena F.Konecný T.Touili Petr Janku A.W.Lin P.Rümmer M.Hruska M.C.0002 J.Matyás V.Mrazek L.Sekanina Z.Vasícek L.Clemente C.Hong

Talks about:

automata (12) tree (8) contribut (6) competit (6) verif (6) program (5) manipul (5) predat (5) base (5) structur (4)

Person: Tomás Vojnar

DBLP: Vojnar:Tom=aacute=s

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2009

2008

2006

2005

2004

2018

2019

2018

Wrote 28 papers:

TACAS-2015-FiedorHLV #anti: Nested Antichains for WS1S (TF, LH, OL, TV), pp. 658–674.
TACAS-2015-HolikHLRSV #analysis #automaton #contest #named #using: Forester: Shape Analysis Using Tree Automata — (Competition Contribution) (LH, MH, OL, AR, JS, TV), pp. 432–435.
TACAS-2015-MullerPV #contest: Predator Hunting Party (Competition Contribution) (PM, PP, TV), pp. 443–446.
TACAS-2014-DudkaPV #contest #graph #memory management #named: Predator: A Shape Analyzer Based on Symbolic Memory Graphs — (Competition Contribution) (KD, PP, TV), pp. 412–414.
TACAS-2014-MullerV #contest #named: CPAlien: Shape Analyzer for CPAChecker — (Competition Contribution) (PM, TV), pp. 395–397.
CAV-2013-HolikLRSV #analysis #automation #automaton: Fully Automated Shape Analysis Based on Forest Automata (LH, OL, AR, JS, TV), pp. 740–755.
SAS-2013-DudkaPV #low level #verification: Byte-Precise Verification of Low-Level List Manipulation (KD, PP, TV), pp. 215–237.
TACAS-2013-DudkaMPV #contest #low level #named #verification: Predator: A Tool for Verification of Low-Level List Manipulation — (Competition Contribution) (KD, PM, PP, TV), pp. 627–629.
TACAS-2012-DudkaMPV #contest #data type #linked data #named #open data #source code #verification: Predator: A Verification Tool for Programs with Dynamic Linked Data Structures — (Competition Contribution) (KD, PM, PP, TV), pp. 545–548.
TACAS-2012-LengalSV #automaton #library #named #nondeterminism #performance: VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.
CAV-2011-DudkaPV #data type #logic #named #using: Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic (KD, PP, TV), pp. 372–378.
CAV-2011-HabermehlHRSV #automaton #verification: Forest Automata for Verification of Heap Manipulation (PH, LH, AR, JS, TV), pp. 424–440.
CAV-2010-AbdullaCCHHMV #automaton #simulation #testing: Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing (PAA, YFC, LC, LH, CDH, RM, TV), pp. 132–147.
TACAS-2010-AbdullaCHMV #anti #simulation: When Simulation Meets Antichains (PAA, YFC, LH, RM, TV), pp. 158–174.
CAV-2009-BozgaHIKV #array #automation #integer #source code #verification: Automatic Verification of Integer Array Programs (MB, PH, RI, FK, TV), pp. 157–172.
CIAA-2008-AbdullaBHKV #automaton #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 212–222.
CIAA-2008-BouajjaniHHTV #automaton #finite #nondeterminism #testing: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata (AB, PH, LH, TT, TV), pp. 57–67.
CIAA-J-2008-AbdullaBHKV09 #automaton #bisimulation: Composed Bisimulation for Tree Automata (PAA, AB, LH, LK, TV), pp. 685–700.
FoSSaCS-2008-HabermehlIV #array #decidability #integer #question #what: What Else Is Decidable about Integer Arrays? (PH, RI, TV), pp. 474–489.
TACAS-2008-AbdullaBHKV #automaton #simulation: Computing Simulations over Tree Automata (PAA, AB, LH, LK, TV), pp. 93–108.
CAV-2006-BouajjaniBHIMV #automaton #source code: Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.
SAS-2006-BouajjaniHRV #data type #model checking: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (AB, PH, AR, TV), pp. 52–70.
TACAS-2006-HabermehlIV #source code #verification: Automata-Based Verification of Programs with Tree Updates (PH, RI, TV), pp. 350–364.
TACAS-2005-BouajjaniHMV #model checking #source code #verification: Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking (AB, PH, PM, TV), pp. 13–29.
CAV-2004-BouajjaniHV #model checking: Abstract Regular Model Checking (AB, PH, TV), pp. 372–386.
CAV-2018-CeskaMMSVV #approximate #automation #design #named: ADAC: Automated Design of Approximate Circuits (MC0, JM, VM, LS, ZV, TV), pp. 612–620.
CADE-2019-HavlenaHLV #automaton #lazy evaluation: Automata Terms in a Lazy WSkS Decision Procedure (VH, LH, OL, TV), pp. 300–318.
POPL-2018-HolikJLRV #constraints #string #transducer: String constraints with concatenation and transducers solved efficiently (LH, PJ, AWL, PR, TV), p. 32.