Sciweavers

2878 search results - page 246 / 576
» Model Checking FTA
Sort
View
116
Voted
ASPDAC
2007
ACM
139views Hardware» more  ASPDAC 2007»
15 years 8 months ago
Deeper Bound in BMC by Combining Constant Propagation and Abstraction
ound in BMC by Combining Constant Propagation and Abstraction Roy Armoni, Limor Fix1 , Ranan Fraer1 , Tamir Heyman1,3 , Moshe Vardi2 , Yakir Vizel1 , Yael Zbar1 1 Logic and Validat...
Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, ...
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
15 years 8 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
151
Voted
VMCAI
2010
Springer
16 years 1 months 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
ENC
2005
IEEE
15 years 10 months ago
Using Alloy to model-check visual design notations
This paper explores the process of validation for the syntax of a graphical notation. We define a unified specification for five of the UML diagrams used by the Discovery Method a...
Anthony J. H. Simons, Carlos Alberto Fernán...
155
Voted
WLP
2004
Springer
15 years 10 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
Misa Keinänen, Ilkka Niemelä