Sciweavers

332 search results - page 14 / 67
» A Direct Algorithm for Multi-valued Bounded Model Checking
Sort
View
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
15 years 5 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
AAAI
2008
15 years 2 months ago
Reasoning with Cardinal Directions: An Efficient Algorithm
Direction relations between extended spatial objects are important commonsense knowledge. Recently, Goyal and Egenhofer proposed a formal model, called Cardinal Direction Calculus...
Xiaotong Zhang, Weiming Liu, Sanjiang Li, Mingshen...
DEDS
2006
111views more  DEDS 2006»
14 years 11 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
15 years 5 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...
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
15 years 3 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...