2236 search results - page 371 / 448 » Language Independence and Language Tolerance in Logic Progra... |
158
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
144
Voted
POPL
2012
ACM
13 years 11 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
128
Voted
ECOOP
2008
Springer
15 years 5 months ago
2008
Springer
Rather than upgrading a software system to the next version by installing a new binary, software systems could be updated "on-thefly" during their execution. We are devel...
172
Voted
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with "strangers". This makes ...
128
click to vote
ASPLOS
2009
ACM
15 years 10 months ago
2009
ACM
This paper explores the architectural implications of integrating computation and molecular probes to form nanoscale sensor processors (nSP). We show how nSPs may enable new compu...