Sciweavers

2218 search results - page 149 / 444
» Testing Expressibility Is Hard
Sort
View
OOPSLA
2010
Springer
13 years 7 months ago
The two-state solution: native and serializable continuations accord
Continuation-based Web servers provide advantages over traditional Web application development through the increase of expressive power they allow. This leads to fewer errors and ...
Jay A. McCarthy
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 7 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
ICSE
2007
IEEE-ACM
14 years 9 months ago
Automated Inference of Pointcuts in Aspect-Oriented Refactoring
Software refactoring is the process of reorganizing the internal structure of code while preserving the external behavior. Aspect-Oriented Programming (AOP) provides new modulariz...
Prasanth Anbalagan, Tao Xie
IVA
2009
Springer
14 years 3 months ago
Methodologies for the User Evaluation of the Motion of Virtual Humans
Abstract. Virtual humans are employed in many interactive applications, including (serious) games. Their motion should be natural and allow interaction with its surroundings and ot...
Sander E. M. Jansen, Herwin van Welbergen
FOCS
2008
IEEE
14 years 3 months ago
Two Query PCP with Sub-Constant Error
We show that the NP-Complete language 3SAT has a PCP verifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1). The ver...
Dana Moshkovitz, Ran Raz