858 search results - page 145 / 172 » Formal Verification of Digital Systems |
84
Voted
ICFP
2004
ACM
15 years 10 months ago
2004
ACM
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
103
Voted
AI50
2006
15 years 2 months ago
2006
I analyze some of the attacks against the Physical Symbol System Hypothesis--attacks based on the presumed need for symbolgrounding and non-symbolic processing for intelligent beha...
95
Voted
PPDP
2007
Springer
15 years 4 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
PODS
2010
ACM
15 years 3 months ago
2010
ACM
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
100
click to vote
SAC
2009
ACM
15 years 3 months ago
2009
ACM
This paper presents a novel software engineering approach for developing a dynamic web interface that meets the quality criterion of “WYDIWYS” - What You Do Is What You See. T...