Sciweavers

110 search results - page 14 / 22
» Tuning SAT Checkers for Bounded Model Checking
Sort
View
ENTCS
2006
103views more  ENTCS 2006»
13 years 9 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
CSFW
1999
IEEE
14 years 1 months ago
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
Dawn Xiaodong Song
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
13 years 7 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
DFG
2004
Springer
14 years 27 days ago
Modeling and Formal Verification of Production Automation Systems
This paper presents the real-time model checker RAVEN and related theoretical background. RAVEN augments the efficiency of traditional symbolic model checking with possibilities to...
Jürgen Ruf, Roland J. Weiss, Thomas Kropf, Wo...
ICFEM
2004
Springer
14 years 2 months ago
Verifying the On-line Help System of SIEMENS Magnetic Resonance Tomographs
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
Carsten Sinz, Wolfgang Küchlin