Sciweavers

608 search results - page 27 / 122
» Tests, Proofs and Refinements
Sort
View
FATES
2003
Springer
14 years 29 days ago
Using a Software Testing Technique to Improve Theorem Proving
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
Reiner Hähnle, Angela Wallenburg
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
14 years 1 months ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 2 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
SEFM
2007
IEEE
14 years 2 months ago
Supporting Proof in a Reactive Development Environment
Reactive integrated development environments for software engineering have lead to an increase in productivity and quality of programs produced. They have done so by replacing the...
Farhad Mehta
ENTCS
2007
92views more  ENTCS 2007»
13 years 7 months ago
A Duality in Proof Systems for Recursive Type Equality and for Bisimulation Equivalence on Cyclic Term Graphs
This paper is concerned with a proof-theoretic observation about two kinds of proof systems for regular cyclic objects. It is presented for the case of two formal systems that are...
Clemens Grabmayer