27 search results - page 5 / 6 » Computing Preferred Extensions for Argumentation Systems wit... |
SIGSOFT
2003
ACM
14 years 6 months ago
2003
ACM
Writes via unchecked pointer dereferences rank high among vulnerabilities most often exploited by malicious code. The most common attacks use an unchecked string copy to cause a b...
LPNMR
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
POPL
2010
ACM
14 years 3 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
ICS
2010
Tsinghua U.
14 years 3 months ago
2010
Tsinghua U.
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...