Sciweavers

193 search results - page 22 / 39
» Reasoning about Memory Layouts
Sort
View
WDAG
2005
Springer
90views Algorithms» more  WDAG 2005»
14 years 3 months ago
Proving Atomicity: An Assertional Approach
Atomicity (or linearizability) is a commonly used consistency criterion for distributed services and objects. Although atomic object implementations are abundant, proving that algo...
Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Jos...
EMSOFT
2007
Springer
14 years 1 months ago
Verification of device drivers and intelligent controllers: a case study
The soundness of device drivers generally cannot be verified in isolation, but has to take into account the reactions of the hardware devices. In critical embedded systems, interf...
David Monniaux
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
14 years 3 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
TIME
1999
IEEE
14 years 2 months ago
TALplanner: An Empirical Investigation of a Temporal Logic-Based Forward Chaining Planner
We present a new forward chaining planner, TALplanner, based on ideas developed by Bacchus [5] and Kabanza [11], where domain-dependent search control knowledge represented as tem...
Patrick Doherty, Jonas Kvarnström
CADE
1998
Springer
14 years 2 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...