1054 search results - page 39 / 211 » A Formalization of the Turing Test |
169
click to vote
FM
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. This paper details a collaboration between Aalborg University and NOVO Nordisk in developing an automatic model-based test generation tool for system testing of the graph...
131
click to vote
FORTE
2004
15 years 5 months ago
2004
In this paper, we present an approach for modeling an existing web application using communicating finite automata model based on the userdefined properties to be validated. We ela...
141
click to vote
MSWIM
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
167
click to vote
IANDC
2007
15 years 4 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
131
click to vote
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
15 years 4 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...