Sciweavers

577 search results - page 41 / 116
» Model Checking Based on Simultaneous Reachability Analysis
Sort
View
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 3 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
DAC
2004
ACM
14 years 10 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
IPPS
2006
IEEE
14 years 3 months ago
Analysis of checksum-based execution schemes for pipelined processors
The performance requirements for contemporary microprocessors are increasing as rapidly as their number of applications grows. By accelerating the clock, performance can be gained...
Bernhard Fechner
IJISEC
2008
101views more  IJISEC 2008»
13 years 9 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
DSRT
2008
IEEE
14 years 3 months ago
Observability Checking to Enhance Diagnosis of Real Time Electronic Systems
This paper describes a new property checking approach in order to enhance the diagnosis ability of an electronic embedded system, included in an automotive application. We conside...
Manel Khlif, Mohamed Shawky