research
∙
07/31/2023
Decision Procedures for Sequence Theories (Technical Report)
Sequence theories are an extension of theories of strings with an infini...
share
research
∙
05/18/2022
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Automatic structures are infinite structures that are finitely represent...
research
∙
12/11/2021
CertiStr: A Certified String Solver (technical report)
Theories over strings are among the most heavily researched logical theo...
research
∙
07/19/2021
Rational Verification for Probabilistic Systems
Rational verification is the problem of determining which temporal logic...
research
∙
05/27/2021
Learning Union of Integer Hypercubes with Queries (Technical Report)
We study the problem of learning a finite union of integer (axis-aligned...
research
∙
11/04/2020
Probabilistic Bisimulation for Parameterized Systems (Technical Report)
Probabilistic bisimulation is a fundamental notion of process equivalenc...
research
∙
10/29/2020
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report)
String analysis is the problem of reasoning about how strings are manipu...
research
∙
10/05/2020
Complexity Analysis of Tree Share Structure
The tree share structure proposed by Dockins et al. is an elegant model ...
research
∙
09/28/2020
Parameterized Synthesis with Safety Properties
Parameterized synthesis offers a solution to the problem of constructing...
research
∙
05/03/2020
Regular Model Checking Revisited (Technical Report)
In this contribution we revisit regular model checking, a powerful frame...
research
∙
12/07/2018
CSS Minification via Constraint Solving (Technical Report)
Minification is a widely-accepted technique which aims at reducing the s...
research
∙
11/07/2018
Decision Procedures for Path Feasibility of String-Manipulating Programs with Complex Operations
The design and implementation of decision procedures for checking path f...
research
∙
05/17/2018
Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility
Word equations are a crucial element in the theoretical foundation of co...
research
∙
11/09/2017
What Is Decidable about String Constraints with the ReplaceAll Function
Recently, it was shown that any theory of strings containing the string-...
research
∙
10/30/2017
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized ...
research
∙
09/21/2017
