Sciweavers

251 search results - page 20 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
TPHOL
2003
IEEE
14 years 20 days ago
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
Hasan Amjad
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 7 months ago
Algorithms for Analysing Firewall and Router Access Lists
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...
Scott Hazelhurst
WER
2010
Springer
13 years 5 months ago
A Tool for Formal Feature Modeling Based on BDDs and Product Families Algebra
Feature models are commonly used to capture the commonality and the variability of product families. There are several feature model notations that correspondingly depict the conce...
Fadil Alturki, Ridha Khedri
CAD
2008
Springer
13 years 7 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
UAI
2004
13 years 8 months ago
Case-Factor Diagrams for Structured Probabilistic Modeling
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
David A. McAllester, Michael Collins, Fernando Per...