Sciweavers

1054 search results - page 71 / 211
» A Formalization of the Turing Test
Sort
View
SEW
2007
IEEE
15 years 11 months ago
Testing Patterns
: After over a decade of use, design patterns continue to find new areas of application. In previous work, we presented a contract formalism for specifying patterns precisely, and...
Neelam Soundarajan, Jason O. Hallstrom, Adem Delib...
172
Voted
FM
2005
Springer
156views Formal Methods» more  FM 2005»
15 years 10 months ago
Testing Concurrent Object-Oriented Systems with Spec Explorer
Abstract Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson, Wolfram Schulte, Nikolai Tillmann, and Margus Veanes Microsoft Research, Redmond, WA, USA Abstract. We describe a pract...
Colin Campbell, Wolfgang Grieskamp, Lev Nachmanson...
FM
2006
Springer
133views Formal Methods» more  FM 2006»
15 years 8 months ago
Enforcer - Efficient Failure Injection
Non-determinism of the thread schedule is a well-known problem in concurrent programming. However, other sources of non-determinism exist which cannot be controlled by an applicati...
Cyrille Artho, Armin Biere, Shinichi Honiden
132
Voted
VLDB
2004
ACM
99views Database» more  VLDB 2004»
15 years 10 months ago
Query Languages and Data Models for Database Sequences and Data Streams
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments ...
Yan-Nei Law, Haixun Wang, Carlo Zaniolo
ACL
1997
15 years 6 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans