Verification of a Transactional Memory Manager under Hardware Failures and Restarts

Marić, Ognjen; Sprenger, Christoph

doi:10.1007/978-3-319-06410-9_31

Cited by 6 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It may be fruitful to investigate a Cogent backend for this work. Maric & Sprenger (2014) investigate the issue of crash tolerance in file systems, and previously Andronick (2006) formally analysed similar issues for tearing in smart cards with persistent storage. Cogent does not provide any special handling for crash tolerance, but the generated executable specifications are detailed enough to facilitate reasoning about it.…”

Section: Safe File Systemsmentioning

confidence: 99%

Cogent: uniqueness types and certifying compilation

O’Connor¹,

Chen²,

Rizkallah³

et al. 2021

J. Funct. Prog.

View full text Add to dashboard Cite

This paper presents a framework aimed at significantly reducing the cost of proving functional correctness for low-level operating systems components. The framework is designed around a new functional programming language, Cogent. A central aspect of the language is its uniqueness type system, which eliminates the need for a trusted runtime or garbage collector while still guaranteeing memory safety, a crucial property for safety and security. Moreover, it allows us to assign two semantics to the language: The first semantics is imperative, suitable for efficient C code generation, and the second is purely functional, providing a user-friendly interface for equational reasoning and verification of higher-level correctness properties. The refinement theorem connecting the two semantics allows the compiler to produce a proof via translation validation certifying the correctness of the generated C code with respect to the semantics of the Cogent source program. We have demonstrated the effectiveness of our framework for implementation and for verification through two file system implementations.

show abstract

Section: Safe File Systemsmentioning

confidence: 99%

Cogent: uniqueness types and certifying compilation

O’Connor¹,

Chen²,

Rizkallah³

et al. 2021

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…The latter work has produced the FSCQ file system that is verified with Coq. Marić and Sprenger [15] model crashes by exceptions that are triggered nondeterministically in the write operations of the hardware model to verify a redundant storage system. We have addressed this issue by a fine-grained semantics of programs in [10] which computes the crash condition symbolically.…”

Section: Related Workmentioning

confidence: 99%

Modular Verification of Order-Preserving Write-Back Caches

Pfähler

Ernst

Bodenmüller

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

File systems not only have to be functionally correct, they also have to be crash-safe: a power cut while an operation is running must be guaranteed to lead to a consistent state after restart that loses as little information as possible. Specification and verification of crashsafety is particularly difficult for non-redundant write-back caches. This paper defines a novel crash-safety criterion that facilitates specification and verification of order-preserving caches. A power cut is basically observationally equivalent to a retraction of a few of the last executed operations. The approach is modular: It gives simple proof obligations for each individual component and for each refinement in the development. The theory is supported by our interactive theorem prover KIV and proof obligations for crash-safety have been verified for the Flashix flash file system.

show abstract

“…On the applications side, it would be interesting to address case studies such as that of [18], the verification of a persistent memory manager (in IBM's 4765 secure coprocessor) in face of restarts and hardware failures, using probabilistic component algebra. As the authors of [18] write, the inclusion of hardware failures incurs a significant jump in system complexity.…”

Section: Strong Monads In Relational/linear Algebramentioning

confidence: 99%

Preparing Relational Algebra for “Just Good Enough” Hardware

Oliveira

2014

Relational and Algebraic Methods in Computer Science

View full text Add to dashboard Cite

Device miniaturization is pointing towards tolerating imperfect hardware provided it is "good enough". Software design theories will have to face the impact of such a trend sooner or later. A school of thought in software design is relational : it expresses specifications as relations and derives programs from specifications using relational algebra. This paper proposes that linear algebra be adopted as an evolution of relational algebra able to cope with the quantification of the impact of imperfect hardware on (otherwise) reliable software. The approach is illustrated by developing a monadic calculus for component oriented software construction with a probabilistic dimension quantifying (by linear algebra) the propagation of imperfect behaviour from lower to upper layers of software systems.

show abstract

Verification of a Transactional Memory Manager under Hardware Failures and Restarts

Cited by 6 publications

References 14 publications

Cogent: uniqueness types and certifying compilation

Cogent: uniqueness types and certifying compilation

Modular Verification of Order-Preserving Write-Back Caches

Preparing Relational Algebra for “Just Good Enough” Hardware

Contact Info

Product

Resources

About