Sciweavers

112 search results - page 16 / 23
» Ordered Binary Decision Diagrams and the Davis-Putnam Proced...
Sort
View
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
14 years 1 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
ECAI
2010
Springer
13 years 8 months ago
Knowledge Compilation Using Interval Automata and Applications to Planning
Knowledge compilation [6, 5, 14, 8] consists in transforming a problem offline into a form which is tractable online. In this paper, we introduce new structures, based on the notio...
Alexandre Niveau, Hélène Fargier, C&...
CHARME
2005
Springer
176views Hardware» more  CHARME 2005»
14 years 1 months ago
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
Abstract. Model checking is a formal technique for automatically verifying that a finite-state model satisfies a temporal property. In model checking, generally Binary Decision D...
Nina Amla, Xiaoqun Du, Andreas Kuehlmann, Robert P...
DSN
2008
IEEE
13 years 9 months ago
Convicting exploitable software vulnerabilities: An efficient input provenance based approach
Software vulnerabilities are the root cause of a wide range of attacks. Existing vulnerability scanning tools are able to produce a set of suspects. However, they often suffer fro...
Zhiqiang Lin, Xiangyu Zhang, Dongyan Xu
CORR
2008
Springer
158views Education» more  CORR 2008»
13 years 8 months ago
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell
This paper is an exploration in a functional programming framework of isomorphisms between elementary data types (natural numbers, sets, finite functions, permutations binary deci...
Paul Tarau