Sciweavers

82 search results - page 8 / 17
» Selected Methods of Model Checking Using SAT and SMT-Solvers
Sort
View
74
Voted
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
15 years 4 months ago
Utilizing don't care states in SAT-based bounded sequential problems
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
Sean Safarpour, Görschwin Fey, Andreas G. Ven...
ICFEM
2004
Springer
15 years 3 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
MEMOCODE
2006
IEEE
15 years 4 months ago
Mixed symbolic representations for model checking software programs
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
Zijiang Yang, Chao Wang, Aarti Gupta, Franjo Ivanc...
ATAL
2005
Springer
15 years 3 months ago
Bounded model checking knowledge and branching time in synchronous multi-agent systems
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
Xiangyu Luo, Kaile Su, Abdul Sattar, Qingliang Che...
FM
2008
Springer
152views Formal Methods» more  FM 2008»
14 years 12 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid