394 search results - page 75 / 79 » Formal polytypic programs and proofs |
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...
FSTTCS
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. Transactions are commonly described as being ACID: Allor-nothing, Consistent, Isolated and Durable. However, although these words convey a powerful intuition, the ACID pr...
FSTTCS
1999
Springer
14 years 6 days ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
TCS
2010
13 years 6 months ago
2010
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...