Sciweavers

251 search results - page 44 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
MMB
2010
Springer
185views Communications» more  MMB 2010»
13 years 11 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
ACSD
2007
IEEE
93views Hardware» more  ACSD 2007»
13 years 11 months ago
SAT-based Unbounded Model Checking of Timed Automata
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
Wojciech Penczek, Maciej Szreter
DSN
2008
IEEE
13 years 11 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
ECAI
2008
Springer
13 years 11 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...
STRINGOLOGY
2004
13 years 11 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...