Sciweavers

503 search results - page 25 / 101
» Verifying Quantitative Properties Using Bound Functions
Sort
View
BMCBI
2006
195views more  BMCBI 2006»
14 years 9 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
CORR
2010
Springer
47views Education» more  CORR 2010»
14 years 9 months ago
Lower bounds for the error decay incurred by coarse quantization schemes
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
Felix Krahmer, Rachel Ward
ICSE
2010
IEEE-ACM
14 years 11 months ago
SMT-based bounded model checking for multi-threaded software in embedded systems
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
Lucas Cordeiro
WWW
2003
ACM
15 years 10 months ago
Content extraction signatures using XML digital signatures and custom transforms on-demand
Content Extraction Signatures (CES) enable selective disclosure of verifiable content, provide privacy for blinded content, and enable the signer to specify the content the docume...
David Squire, Laurence Bull, Peter Stañski
DEDS
2006
111views more  DEDS 2006»
14 years 9 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux