140 search results - page 8 / 28 » Orderings and Constraints: Theory and Practice of Proving Te... |
103
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— We present a tool for the static analysis of XPath queries and XML Schemas. The tool introduces techniques used in the field of verification (such as binary decision diagrams...
CONSTRAINTS
2010
14 years 9 months ago
2010
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
87
Voted
CADE
2007
Springer
15 years 12 months ago
2007
Springer
This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using se...
96
Voted
CSL
2007
Springer
15 years 5 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
133
Voted
PTS
2010
14 years 9 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...