Sciweavers

602 search results - page 20 / 121
» Program Calculation in Coq
Sort
View
ESOP
2011
Springer
13 years 1 months ago
Barriers in Concurrent Separation Logic
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...
Aquinas Hobor, Cristian Gherghina
COMPSAC
2009
IEEE
13 years 11 months ago
Modular Certification of Low-Level Intermediate Representation Programs
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
Yuan Dong, Shengyuan Wang, Liwei Zhang, Ping Yang
FUIN
2010
103views more  FUIN 2010»
13 years 7 months ago
Automation for Dependently Typed Functional Programming
Abstract. Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is diff...
Sean Wilson, Jacques D. Fleuriot, Alan Smaill
POPL
2010
ACM
14 years 7 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
MPC
1995
Springer
125views Mathematics» more  MPC 1995»
14 years 1 months ago
Synthesizing Proofs from Programs in the Calculus of Inductive Constructions
We want to prove \automatically" that a program is correct with respect to a set of given properties that is a speci cation. Proofs of speci cations contain logical parts and ...
Catherine Parent