Sciweavers

1355 search results - page 67 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
CONCUR
2006
Springer
13 years 9 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 1 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
CAV
2005
Springer
99views Hardware» more  CAV 2005»
14 years 1 months ago
Automated Assume-Guarantee Reasoning for Simulation Conformance
Abstract. We address the issue of efficiently automating assume-guarantee reasoning for simulation conformance between finite state systems and specifications. We focus on a non...
Sagar Chaki, Edmund M. Clarke, Nishant Sinha, Pras...
IPPS
2008
IEEE
14 years 2 months ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
BMCBI
2007
139views more  BMCBI 2007»
13 years 7 months ago
Significance analysis of microarray transcript levels in time series experiments
Background: Microarray time series studies are essential to understand the dynamics of molecular events. In order to limit the analysis to those genes that change expression over ...
Barbara Di Camillo, Gianna Toffolo, Sreekumaran K....