Sciweavers

184 search results - page 17 / 37
» Testing Distributed Systems Through Symbolic Model Checking
Sort
View
FMICS
2006
Springer
13 years 11 months ago
SAT-Based Verification of LTL Formulas
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Wenhui Zhang
SBMF
2009
Springer
105views Formal Methods» more  SBMF 2009»
14 years 2 months ago
Verifying Compiled File System Code
Abstract. This paper presents a case study on retrospective verication of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
Jan Tobias Mühlberg, Gerald Lüttgen
ARTS
1997
Springer
13 years 11 months ago
The Verus Language: Representing Time Efficiently with BDDs
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
Sérgio Vale Aguiar Campos, Edmund M. Clarke
WOSP
2004
ACM
14 years 1 months ago
Early performance testing of distributed software applications
Performance characteristics, such as response time, throughput and scalability, are key quality attributes of distributed applications. Current practice, however, rarely applies s...
Giovanni Denaro, Andrea Polini, Wolfgang Emmerich
FMSD
2006
119views more  FMSD 2006»
13 years 7 months ago
Feature interaction detection by pairwise analysis of LTL properties - A case study
A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL. Interactio...
Muffy Calder, Alice Miller