1204 search results - page 141 / 241 » Termination of Polynomial Programs |
206
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
100
click to vote
VMCAI
2005
Springer
15 years 6 months ago
2005
Springer
When a system fails to satisfy its specification, the model checker produces an error trace (or counter-example) that demonstrates an undesirable behavior, which is then used in d...
185
Voted
CC
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
103
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
110
Voted
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...