Sciweavers

198 search results - page 3 / 40
» Lightweight reasoning about program correctness
Sort
View
POPL
2006
ACM
14 years 8 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
APLAS
2008
ACM
13 years 10 months ago
Certified Reasoning in Memory Hierarchies
Abstract. Parallel programming is rapidly gaining importance as a vector to develop high performance applications that exploit the improved capabilities of modern computer architec...
Gilles Barthe, César Kunz, Jorge Luis Sacch...
ENTCS
2008
120views more  ENTCS 2008»
13 years 8 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
ISSTA
2009
ACM
14 years 3 months ago
SideTrack: generalizing dynamic atomicity analysis
Atomicity is a key correctness specification for multithreaded programs. Prior dynamic atomicity analyses include precise tools, which report an error if and only if the observed...
Jaeheon Yi, Caitlin Sadowski, Cormac Flanagan
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 6 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent