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...
Lian Yu, Wei Zhao, Xiaofeng Di, Changzhu Kong, Wen...
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...
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 ...
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...
: 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...