523 search results - page 50 / 105 » On the Power of Quantum Proofs |
144
click to vote
SAC
2006
ACM
16 years 2 days ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
161
click to vote
FM
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents the formal verification of a compiler front-end that translates a subset of the C language into the Cminor intermediate language. The semantics of the source an...
186
click to vote
FASE
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
160
click to vote
AAAI
2004
15 years 7 months ago
2004
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
181
click to vote
JOLLI
2002
15 years 5 months ago
2002
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...