32 search results - page 3 / 7 » Interpolation, Definability and Fixed Points in Interpretabi... |
CAV
2010
Springer
13 years 7 months ago
2010
Springer
We define and study a new abstract domain which is a fine-grained combination of zonotopes with (sub-)polyhedric domains such as the interval, ocinear template or polyhedron domain...
POPL
1997
ACM
13 years 11 months ago
1997
ACM
Defining the collecting semantics is usually the first crucial step in adapting the general methodology of abstract interpretation to the semantic framework or programming languag...
ZUM
2000
Springer
13 years 11 months ago
2000
Springer
Unlike Z, Object-Z allows schemas to be defined recursively. This enables mutual and self recursive structures, commonly occurring in object-oriented programs, to be readily specif...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In ...