1054 search results - page 103 / 211 » A Formalization of the Turing Test |
134
click to vote
HICSS
2008
IEEE
16 years 26 days ago
2008
IEEE
This study extends the concept of weak and strong ties to the relationship between an individual and a project, in the context of a formal review process. Using data collected fro...
152
click to vote
SAS
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the des...
190
click to vote
SAS
2005
Springer
15 years 12 months ago
2005
Springer
We show that the idea of predicates on heap objects can be cast in the framework of predicate abstraction. This leads to an alternative view on the underlying concepts of three-val...
162
click to vote
UML
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we propose a verification methodology for System-OnChip (SoC) design using Unified Modeling Language (UML). We introduce UML as a formal model to analyze a...
152
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...