4066 search results - page 175 / 814 » Almost Complete Sets |
139
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
214
click to vote
SAS
1991
Springer
15 years 10 months ago
1991
Springer
d Abstract) Marcelo Fiore1 Chung-Kil Hur2,3 Computer Laboratory University of Cambridge Cambridge, UK We introduce an abstract general notion of system of equations between terms,...
143
click to vote
AAAI
2007
15 years 8 months ago
2007
The automated planning community has traditionally focused on the efficient synthesis of plans given a complete domain theory. In the past several years, this line of work met wi...
170
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
122
click to vote
AAAI
1990
15 years 7 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...