1941 search results - page 212 / 389 » Reasoning about Computations Using Two-Levels of Logic |
106
click to vote
VLSID
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
135
click to vote
TACAS
1999
Springer
15 years 8 months ago
1999
Springer
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
117
click to vote
UC
2009
Springer
15 years 10 months ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
102
click to vote
ICLP
1989
Springer
15 years 7 months ago
1989
Springer
The generation of efficient code for Prolog programs requires sophisticated code transformation and optimization systems. Much of the recent work in this area has focussed on hig...
116
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...