Sciweavers

620 search results - page 22 / 124
» Concrete Abstractions
Sort
View
ACTA
2006
108views more  ACTA 2006»
13 years 10 months ago
Refinement verification of the lazy caching algorithm
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...
Wim H. Hesselink
OOPSLA
1995
Springer
14 years 1 months ago
How and Why to Encapsulate Class Trees
eusable framework, pattern or module interface usually is represented by abstract They form an abstract design and leave the implementation to concrete subclasses. ract design is ...
Dirk Riehle
TACAS
2010
Springer
221views Algorithms» more  TACAS 2010»
14 years 4 months ago
Trace-Based Symbolic Analysis for Atomicity Violations
Abstract. We propose a symbolic algorithm to accurately predict atomicity violations by analyzing a concrete execution trace of a concurrent program. We use both the execution trac...
Chao Wang, Rhishikesh Limaye, Malay K. Ganai, Aart...
UC
2007
Springer
14 years 4 months ago
Taming Non-compositionality Using New Binders
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
Frédéric Prost
VMCAI
2009
Springer
14 years 4 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman