Lukás Holík

Jirí Simácek

CoRR, 2023

Chain-Free String Constraints (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2023

Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2023

Fast Matching of Regular Patterns with Synchronizing Counting.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2023

Word Equations in Synergy with Regular Constraints.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods - 25th International Symposium, 2023

Reasoning About Regular Properties: A Comparative Study.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 29, 2023

2022

Low-Level Bi-Abduction (Artifact).

[BibT_eX]

[DOI]

Dagstuhl Artifacts Ser., 2022

Word Equations in Synergy with Regular Constraints (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2022

Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers.

[BibT_eX]

[DOI]

Proceedings of the 31st USENIX Security Symposium, 2022

Low-Level Bi-Abduction.

[BibT_eX]

[DOI]

Proceedings of the 36th European Conference on Object-Oriented Programming, 2022

2021

Correction to: An integrated specification and verification technique for highly concurrent data structures.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2021

Automata Terms in a Lazy WSkS Decision Procedure.

[BibT_eX]

[DOI]

J. Autom. Reason., 2021

Towards Efficient Shape Analysis with Tree Automata.

[BibT_eX]

[DOI]

Martin Hruska

Proceedings of the Networked Systems - 9th International Conference, 2021

Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata.

[BibT_eX]

[DOI]

Petr Matousek

Vojtech Havlena

Proceedings of the 17th IFIP/IEEE International Symposium on Integrated Network Management, 2021

Simplifying Alternating Automata for Emptiness Testing.

[BibT_eX]

[DOI]

Pavol Vargovcík

Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

Solving Not-Substring Constraint withFlat Abstraction.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2020

Approximate reduction of finite automata for high-speed network intrusion detection.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2020

Regex matching with counting-set automata.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2020

Abstraction refinement and antichains for trace inclusion of infinite state systems.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2020

String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2020

Efficient handling of string-number conversion.

[BibT_eX]

[DOI]

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Antiprenexing for WSkS: A Little Goes a Long Way.

[BibT_eX]

[DOI]

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019

Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2019

Automata Terms in a Lazy WSkS Decision Procedure (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2019

Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata.

[BibT_eX]

[DOI]

CoRR, 2019

Nested antichains for WS1S.

[BibT_eX]

[DOI]

Acta Informatica, 2019

Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2019

Chain-Free String Constraints.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2019

Succinct Determinisation of Counting Automata via Sphere Construction.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

J-ReCoVer: Java Reducer Commutativity Verifier.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018

String constraints with concatenation and transducers solved efficiently.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2018

Simulation Algorithms for Symbolic Automata (Technical Report).

[BibT_eX]

[DOI]

CoRR, 2018

From Shapes to Amortized Complexity.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Trau: SMT solver for string constraints.

[BibT_eX]

[DOI]

Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

Simulation Algorithms for Symbolic Automata.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2018

2017

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

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2017

Effect Summaries for Thread-Modular Analysis.

[BibT_eX]

[DOI]

CoRR, 2017

Simulations and Antichains for Efficient Handling of Finite Automata.

[BibT_eX]

[DOI]

CoRR, 2017

Counterexample Validation and Interpolation-Based Refinement for Forest Automata.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

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

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Lazy Automata Techniques for WS1S.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 24th International Symposium, 2017

Flatten and conquer: a framework for efficient analysis of string constraints.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Towards Smaller Invariants for Proving Coverability.

[BibT_eX]

[DOI]

Lenka Turonová

Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

2016

Parameterized verification through view abstraction.

[BibT_eX]

[DOI]

Int. J. Softw. Tools Technol. Transf., 2016

Antichains for Inclusion Games.

[BibT_eX]

[DOI]

Roland Meyer

Sebastian Muskalla

CoRR, 2016

Verification of heap manipulating programs with ordered data by extended forest automata.

[BibT_eX]

[DOI]

Acta Informatica, 2016

Pointer Race Freedom.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

From Low-Level Pointers to High-Level Containers.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Run Forester, Run Backwards! - (Competition Contribution).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Reduction of Nondeterministic Tree Automata.

[BibT_eX]

[DOI]

Ricardo Almeida

Richard Mayr

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Predator Shape Analysis Tool Suite.

[BibT_eX]

[DOI]

Proceedings of the Hardware and Software: Verification and Testing, 2016

Summaries for Context-Free Games.

[BibT_eX]

[DOI]

Roland Meyer

Sebastian Muskalla

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).

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

View Abstraction - A Tutorial (Invited Paper).

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Synthesis of Complex Parameters, 2015

Antichains for the Verification of Recursive Programs.

[BibT_eX]

[DOI]

Roland Meyer

Proceedings of the Networked Systems - Third International Conference, 2015

Norn: An SMT Solver for String Constraints.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

Mediator Synthesis in a Component Algebra with Data.

[BibT_eX]

[DOI]

Malte Isberner

Bengt Jonsson

Proceedings of the Correct System Design, 2015

2014

Mediating for reduction (on minimizing alternating Büchi automata).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Block Me If You Can! - Context-Sensitive Parameterized Verification.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 21st International Symposium, 2014

String Constraints for Verification.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013

All for the Price of Few.

[BibT_eX]

[DOI]