118 search results - page 11 / 24 » Word-Level Sequential Memory Abstraction for Model Checking |
71
Voted
HIPC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
LICS
2007
IEEE
15 years 3 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...
EMSOFT
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. This paper presents our experience implementing the memory management extensions in the Real-Time Specification for Java. These extensions are designed to given real-tim...
TACAS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
ACTA
2006
14 years 9 months ago
2006
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...