Sciweavers

30 search results - page 1 / 6
» Increasing the Robustness of Bounded Model Checking by Compu...
Sort
View
FMCAD
2004
Springer
13 years 9 months ago
Increasing the Robustness of Bounded Model Checking by Computing Lower Bounds on the Reachable States
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
Mohammad Awedh, Fabio Somenzi
AUTOMATICA
2008
94views more  AUTOMATICA 2008»
13 years 3 months ago
Reachability analysis of continuous-time piecewise affine systems
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
Abdullah Hamadeh, Jorge Goncalves
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
13 years 1 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
VMCAI
2010
Springer
14 years 26 days ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
DAC
2009
ACM
14 years 4 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...