608 search results - page 4 / 122 » Tests, Proofs and Refinements |
QSIC
2008
IEEE
14 years 2 months ago
2008
IEEE
In the context of open source development or software evolution, developers are often faced with test suites which have been developed with no apparent rationale and which may nee...
CSL
1994
Springer
13 years 11 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
FUIN
2000
13 years 7 months ago
2000
We study the notion of class refinement in a concurrent object-oriented setting. Our model is based on a combination of action systems and classes. An action system describes the b...
TAP
2010
Springer
14 years 22 days ago
2010
Springer
Abstract. We consider the problem of test generation for Boolean combinational circuits. We use a novel approach based on the idea of treating tests as a proof encoding rather than...