73 search results - page 15 / 15 » Tight Bounds on the Descriptional Complexity of Regular Expr... |
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
OOPSLA
2007
Springer
13 years 11 months ago
2007
Springer
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
ICDT
2012
ACM
11 years 8 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...