Sciweavers

1054 search results - page 95 / 211
» Abstract Regular Model Checking
Sort
View
IPPS
2010
IEEE
13 years 6 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
FM
2005
Springer
112views Formal Methods» more  FM 2005»
14 years 2 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
VLDB
2005
ACM
133views Database» more  VLDB 2005»
14 years 2 months ago
Caching with 'Good Enough' Currency, Consistency, and Completeness
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a dat...
Hongfei Guo, Per-Åke Larson, Raghu Ramakrish...
TOPNOC
2008
13 years 9 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...
ALGORITHMICA
2002
97views more  ALGORITHMICA 2002»
13 years 9 months ago
Testing and Spot-Checking of Data Streams
Abstract. We consider the tasks of testing and spot-checking for data streams. These testers and spotcheckers are potentially useful in real-time or near real-time applications tha...
Joan Feigenbaum, Sampath Kannan, Martin Strauss, M...