research
∙
03/02/2023
A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report)
Case split is a core proof rule in current decision procedures for the t...
share
research
∙
01/05/2023
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)
Complementation of nondeterministic Büchi automata (BAs) is an important...
research
∙
12/05/2022
Word Equations in Synergy with Regular Constraints (Technical Report)
When eating spaghetti, one should have the sauce and noodles mixed inste...
research
∙
06/04/2022
Complementing Büchi Automata with Ranker (Technical Report)
We present the tool Ranker for complementing Büchi automata (BAs). Ranke...
research
∙
10/19/2021
Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report)
We propose several heuristics for mitigating one of the main causes of c...
research
∙
10/15/2020
Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)
This paper provides several optimizations of the rank-based approach for...
research
∙
05/21/2019
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report)
We propose a lazy decision procedure for the logic WSkS. It builds a ter...
research
∙
05/17/2019
Simulations in Rank-Based Büchi Automata Complementation
The long search for an optimal complementation construction for Büchi au...
research
∙
04/24/2019
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata
Deep packet inspection via regular expression (RE) matching is a crucial...
research
∙
10/24/2017
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection (Technical Report)
We consider the problem of approximate reduction of non-deterministic au...
research
∙
10/24/2017