Vojtech Havlena

According to our database1, Vojtech Havlena authored at least 29 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Solving String Constraints with Lengths by Stabilization.
Proc. ACM Program. Lang., October, 2023

A symbolic algorithm for the case-split rule in solving word constraints with extensions.
J. Syst. Softw., July, 2023

Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication.
IEEE Trans. Smart Grid, May, 2023

Mata, a Fast and Simple Finite Automata Library (Technical Report).
CoRR, 2023

Z3-Noodler: An Automata-based String Solver (Technical Report).
CoRR, 2023

A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report).
CoRR, 2023

Modular Mix-and-Match Complementation of Büchi Automata (Technical Report).
CoRR, 2023

Modular Mix-and-Match Complementation of Büchi Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Word Equations in Synergy with Regular Constraints.
Proceedings of the Formal Methods - 25th International Symposium, 2023

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

Complementing Büchi Automata with Ranker (Technical Report).
CoRR, 2022

Sky Is Not the Limit - Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Complementing Büchi Automata with Ranker.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Automata Terms in a Lazy WSkS Decision Procedure.
J. Autom. Reason., 2021

Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report).
CoRR, 2021

Deciding S1S: Down the Rabbit Hole and Through the Looking Glass.
Proceedings of the Networked Systems - 9th International Conference, 2021

Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata.
Proceedings of the 17th IFIP/IEEE International Symposium on Integrated Network Management, 2021

Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Approximate reduction of finite automata for high-speed network intrusion detection.
Int. J. Softw. Tools Technol. Transf., 2020

Flow based monitoring of ICS communication in the smart grid.
J. Inf. Secur. Appl., 2020

Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report).
CoRR, 2020

Antiprenexing for WSkS: A Little Goes a Long Way.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving.
Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

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

Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata.
CoRR, 2019

Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata.
Proceedings of the 27th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2019

Simulations in Rank-Based Büchi Automata Complementation.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2016
A Note on One Less Known Class of Generated Residual Implications.
Proceedings of the Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2016

2015
Fitting Aggregation Operators.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2015


  Loading...