Sciweavers

198 search results - page 19 / 40
» Lightweight reasoning about program correctness
Sort
View
POPL
2007
ACM
14 years 9 months ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ICFP
2009
ACM
14 years 9 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...
ICSE
2010
IEEE-ACM
13 years 10 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
CONCUR
2004
Springer
14 years 2 months ago
A Semantics for Concurrent Separation Logic
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
Stephen D. Brookes
ESOP
2000
Springer
14 years 6 days ago
A Kleene Analysis of Mobile Ambients
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv