632 search results - page 37 / 127 » Combining programming with theorem proving |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
ACL2
2006
ACM
14 years 1 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
GPCE
2007
Springer
14 years 2 months ago
2007
Springer
Modular Monadic Semantics (MMS) is a well-known mechanism for structuring modular denotational semantic definitions for programming languages. The principal attraction of MMS is ...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
— Previous works have shown that neural branch prediction techniques achieve far lower misprediction rate than traditional approaches. We propose a neural predictor based on two ...