Sciweavers

90 search results - page 17 / 18
» From Pre-historic to Post-modern Symbolic Model Checking
Sort
View
117
Voted
POPL
2011
ACM
14 years 28 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 1 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
QEST
2007
IEEE
15 years 4 months ago
GRIP: Generic Representatives in PRISM
We give an overview of GRIP, a symmetry reduction tool for the probabilistic model checker PRISM, together with experimental results for a selection of example specifications. 1 ...
Alastair F. Donaldson, Alice Miller, David Parker
FROCOS
2005
Springer
15 years 3 months ago
Sociable Interfaces
Interface formalisms are able to model both the input requirements and the output behavior of system components; they support both bottom-up component-based design, and top-down de...
Luca de Alfaro, Leandro Dias da Silva, Marco Faell...
DCC
2010
IEEE
15 years 3 months ago
Tanner Graph Based Image Interpolation
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework, which regards each pixel in an image as a variab...
Ruiqin Xiong, Wen Gao