Lukás Holík

According to our database1, Lukás Holík authored at least 40 papers between 2008 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
String constraints with concatenation and transducers solved efficiently.
PACMPL, 2018

From Shapes to Amortized Complexity.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Simulation Algorithms for Symbolic Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures.
STTT, 2017

Counterexample Validation and Interpolation-Based Refinement for Forest Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Forester: From Heap Shapes to Automata Predicates - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Lazy Automata Techniques for WS1S.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic.
Proceedings of the Static Analysis - 24th International Symposium, 2017

Flatten and conquer: a framework for efficient analysis of string constraints.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Towards Smaller Invariants for Proving Coverability.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

2016
Parameterized verification through view abstraction.
STTT, 2016

Pointer Race Freedom.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

From Low-Level Pointers to High-Level Containers.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Run Forester, Run Backwards! - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Reduction of Nondeterministic Tree Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Predator Shape Analysis Tool Suite.
Proceedings of the Hardware and Software: Verification and Testing, 2016

Summaries for Context-Free Games.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015
Forester: Shape Analysis Using Tree Automata - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Nested Antichains for WS1S.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

View Abstraction - A Tutorial (Invited Paper).
Proceedings of the 2nd International Workshop on Synthesis of Complex Parameters, 2015

Antichains for the Verification of Recursive Programs.
Proceedings of the Networked Systems - Third International Conference, 2015

Norn: An SMT Solver for String Constraints.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Mediator Synthesis in a Component Algebra with Data.
Proceedings of the Correct System Design, 2015

2014
Block Me If You Can! - Context-Sensitive Parameterized Verification.
Proceedings of the Static Analysis - 21st International Symposium, 2014

String Constraints for Verification.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
All for the Price of Few.
Proceedings of the Verification, 2013

An Integrated Specification and Verification Technique for Highly Concurrent Data Structures.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Fully Automated Shape Analysis Based on Forest Automata.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2011
Advanced Ramsey-Based Büchi Automata Inclusion Testing.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Forest Automata for Verification of Heap Manipulation.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2010
When Simulation Meets Antichains.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2010

Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing.
Proceedings of the Computer Aided Verification, 22nd International Conference, 2010

2009
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata.
Electr. Notes Theor. Comput. Sci., 2009

Mediating for Reduction (on Minimizing Alternating Büchi Automata).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
Proceedings of the Implementation and Applications of Automata, 2008

Composed Bisimulation for Tree Automata.
Proceedings of the Implementation and Applications of Automata, 2008

Computing Simulations over Tree Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008


  Loading...