Sciweavers

STTT
2010
116views more  STTT 2010»
13 years 7 months ago
LTL satisfiability checking
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
Kristin Y. Rozier, Moshe Y. Vardi
IANDC
2011
127views more  IANDC 2011»
13 years 7 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
CASCON
2010
225views Education» more  CASCON 2010»
13 years 9 months ago
Monitoring and Recovery of Web Service Applications
For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. However, web services are dis...
Jocelyn Simmonds, Shoham Ben-David, Marsha Chechik
IPPS
2010
IEEE
13 years 9 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
ICST
2009
IEEE
13 years 10 months ago
Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking
Bounded model checking--as well as symbolic equivalence checking--are highly successful techniques in the hardware domain. Recently, bit-vector bounded model checkers like CBMC ha...
Hendrik Post, Carsten Sinz
QEST
2010
IEEE
13 years 10 months ago
Rare Event Simulation for Highly Dependable Systems with Fast Repairs
Stochastic model checking has been used recently to assess, among others, dependability measures for a variety of systems. However, the employed numerical methods, as, e.g., suppor...
Daniël Reijsbergen, Pieter-Tjerk de Boer, Wer...
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
13 years 10 months ago
Efficient state space exploration: Interleaving stateless and state-based model checking
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
Malay K. Ganai, Chao Wang, Weihong Li
FSTTCS
2010
Springer
13 years 10 months ago
Model Checking Concurrent Programs with Nondeterminism and Randomization
For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound an...
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
FSTTCS
2010
Springer
13 years 10 months ago
Model checking time-constrained scenario-based specifications
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
S. Akshay, Paul Gastin, Madhavan Mukund, K. Naraya...
TPDS
2010
142views more  TPDS 2010»
13 years 10 months ago
Toward Optimal Network Fault Correction in Externally Managed Overlay Networks
—We consider an end-to-end approach of inferring probabilistic data-forwarding failures in an externally managed overlay network, where overlay nodes are independently operated b...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein