699 search results - page 122 / 140 » The KGP Model of Agency for Global Computing: Computational ... |
ISSTA
2010
ACM
13 years 9 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
AAAI
2004
13 years 9 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
ACSAC
2009
IEEE
13 years 11 months ago
2009
IEEE
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
DCC
2009
IEEE
14 years 8 months ago
2009
IEEE
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...
PLDI
2003
ACM
14 years 22 days ago
2003
ACM
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...