2236 search results - page 193 / 448 » Language Independence and Language Tolerance in Logic Progra... |
158
click to vote
ICFP
2003
ACM
16 years 6 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
145
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...
181
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
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...
141
click to vote
IPSN
2010
Springer
16 years 1 months ago
2010
Springer
We present SQUIRREL, a stream-oriented programming framework for storage-centric sensor networks. The storagecentric paradigm—where storage operations prevail over communication...
214
click to vote
CC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...