Sequence theories are an extension of theories of strings with an infini...
In deductive verification and software model checking, dealing with cert...
We present RETA (Relative Timing Analysis), a differential timing analys...
This paper describes an ongoing effort to develop an optimizing version ...
Learning program semantics from raw source code is challenging due to th...
Theories over strings are among the most heavily researched logical theo...
CHC-COMP-21 is the fourth competition of solvers for Constrained Horn
Cl...
Constrained Horn Clauses (CHCs) are an intermediate program representati...
Probabilistic bisimulation is a fundamental notion of process equivalenc...
String analysis is the problem of reasoning about how strings are manipu...
CHC-COMP-20 is the third competition of solvers for Constrained Horn Cla...
Strings are widely used in programs, especially in web applications. Int...
In this contribution we revisit regular model checking, a powerful frame...
Monadic decomposability is a notion of variable independence, which asks...
The design and implementation of decision procedures for checking path
f...
Recursive algebraic data types (term algebras, ADTs) are one of the most...