10715 search results - page 110 / 2143 » From Tests to Proofs |
COMPSAC
2009
IEEE
13 years 7 months ago
2009
IEEE
1 The paper proposes a new test model, Call-For-Testing (CFT), and applies it to User Acceptance Testing (UAT) of Web Applications. Different from traditional approaches, UAT in th...
ITICSE
2005
ACM
14 years 3 months ago
2005
ACM
The complexity of languages like Java and C++ can make introductory programming classes in these languages extremely challenging for many students. Part of the complexity comes fr...
COCO
2010
Springer
14 years 27 days ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
SAC
2009
ACM
14 years 4 months ago
2009
ACM
This paper presents a methodology for interoperability testing based on contextual signatures and passive testing with invariants. The concept of contextual signature offers a fra...
JUCS
2007
13 years 9 months ago
2007
: In this paper we obtain new effective results on the Halpern iterations of nonexpansive mappings using methods from mathematical logic or, more specifically, proof-theoretic te...