1322 search results - page 1 / 265 » Unsound Theorem Proving |
CSL
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
FAC
2010
13 years 4 months ago
2010
Data refinement is a common approach to reasoning about programs, based on establishing that te program indeed satisfies all the required properties imposed by an intended abstract...
JCST
2010
13 years 2 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such ...
SIGMOD
2009
ACM
14 years 7 months ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...