295 search results - page 5 / 59 » Simultaneous Quantifier Elimination |
LPAR
2010
Springer
13 years 6 months ago
2010
Springer
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
IJCAI
2001
13 years 10 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
CSL
2009
Springer
14 years 7 hour ago
2009
Springer
The aim of this paper is to understand the interplay between intersection, universally quantified, and reference types. Putting together the standard typing rules for intersection,...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We develop a new notion of security against timing attacks where the attacker is able to simultaneously observe the execution time of a program and the probability of the values of...
CSCLP
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...