2062 search results - page 110 / 413 » Derivatives of Logical Formulas |
156
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In the context of deductive program verification, supporting floatingpoint computations is tricky. We propose an expressive language to formally specify behavioral proper...
135
click to vote
JAIR
2006
15 years 3 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
109
click to vote
DAC
2007
ACM
16 years 5 months ago
2007
ACM
Satisfiability (SAT) solvers often benefit from a preprocessing of the formula to be decided. For formulae in conjunctive normal form (CNF), subsumed clauses may be removed or par...
120
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
148
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...