Sciweavers

3441 search results - page 192 / 689
» Parallel Logic Programming Systems
Sort
View
ICFP
2009
ACM
16 years 3 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ASPLOS
2011
ACM
14 years 6 months ago
DoublePlay: parallelizing sequential logging and replay
Deterministic replay systems record and reproduce the execution of a hardware or software system. In contrast to replaying execution on uniprocessors, deterministic replay on mult...
Kaushik Veeraraghavan, Dongyoon Lee, Benjamin West...
CADE
2010
Springer
15 years 4 months ago
MUNCH - Automated Reasoner for Sets and Multisets
This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multi...
Ruzica Piskac, Viktor Kuncak
CONCUR
2008
Springer
15 years 4 months ago
A Model of Dynamic Separation for Transactional Memory
Abstract. Dynamic separation is a new programming discipline for systems with transactional memory. We study it formally in the setting of a small calculus with transactions. We pr...
Martín Abadi, Tim Harris, Katherine F. Moor...
CORR
2004
Springer
123views Education» more  CORR 2004»
15 years 2 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui