Sciweavers

5109 search results - page 296 / 1022
» On Learning Limiting Programs
Sort
View
JAR
2006
94views more  JAR 2006»
15 years 6 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
BMCBI
2005
98views more  BMCBI 2005»
15 years 6 months ago
DCD - a novel plant specific domain in proteins involved in development and programmed cell death
Background: Recognition of microbial pathogens by plants triggers the hypersensitive reaction, a common form of programmed cell death in plants. These dying cells generate signals...
Raimund Tenhaken, Tobias Doerks, Peer Bork
PPOPP
2011
ACM
14 years 9 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
ICFP
2008
ACM
16 years 6 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
POPL
2009
ACM
16 years 1 months ago
Declarative aspects of memory management in the concurrent collections parallel programming model
Concurrent Collections (CnC)[8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level comput...
Zoran Budimlic, Aparna Chandramowlishwaran, Kathle...