Sciweavers

506 search results - page 1 / 102
» Proving Properties about Lists Using Containers
Sort
View
FLOPS
2008
Springer
13 years 6 months ago
Proving Properties about Lists Using Containers
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
Rawle Prince, Neil Ghani, Conor McBride
POPL
2006
ACM
14 years 5 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 8 months ago
Formal Verification of a Lazy Concurrent List-Based Set Algorithm
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
Robert Colvin, Lindsay Groves, Victor Luchangco, M...
DGCI
2008
Springer
13 years 6 months ago
About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
In this paper we prove that the function giving the frequency of a class of patterns of digital planes with respect to the slopes of the plane is continuous and piecewise affine, m...
Alain Daurat, Mohamed Tajine, Mahdi Zouaoui
CEFP
2007
Springer
13 years 11 months ago
Proving Properties of Lazy Functional Programs with Sparkle
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...