59 search results - page 1 / 12 » Lifting abstract interpreters to quantified logical domains |
POPL
2008
ACM
14 years 4 months ago
2008
ACM
CONCUR
2006
Springer
13 years 6 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
SAS
1995
Springer
13 years 8 months ago
1995
Springer
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
META
1992
13 years 8 months ago
1992
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
AAAI
2004
13 years 5 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...