297 search results - page 39 / 60 » ATS: A Language That Combines Programming with Theorem Provi... |
135
click to vote
ESOP
2010
Springer
15 years 10 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
CP
2005
Springer
15 years 6 months ago
2005
Springer
The aggregation of individuals’ preferences into a single group outcome is both well-studied and fundamental within decision theory. Historically, though, a pervasive simplifica...
118
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
190
click to vote
ESOP
2011
Springer
14 years 4 months ago
2011
Springer
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...
160
click to vote
ESOP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...