47 search results - page 3 / 10 » Shallow Lazy Proofs |
BIRTHDAY
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating wellfoundedness of unions of relations. To that en...
TYPES
2004
Springer
13 years 12 months ago
2004
Springer
Abstract Within a framework of correct code-generation from HOLspeciļ¬cations, we present a particular instance concerned with the optimized compilation of a lazy language (called...
FROCOS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
CAV
2006
Springer
13 years 10 months ago
2006
Springer
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 ...
PPDP
2000
Springer
13 years 10 months ago
2000
Springer
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...