Sciweavers

575 search results - page 18 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
CAV
2008
Springer
96views Hardware» more  CAV 2008»
13 years 9 months ago
Implied Set Closure and Its Application to Memory Consistency Verification
Hangal et. al. [3] have developed a procedure to check if an instance of the execution of a shared memory multiprocessor program, is consistent with the Total Store Order (TSO) mem...
Surender Baswana, Shashank K. Mehta, Vishal Powar
RTSS
1997
IEEE
13 years 11 months ago
On-the-fly symbolic model checking for real-time systems
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
Ahmed Bouajjani, Stavros Tripakis, Sergio Yovine
ICPR
2008
IEEE
14 years 8 months ago
On efficient Viterbi decoding for hidden semi-Markov models
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
Bonnie K. Ray, Jianying Hu, Ritendra Datta
JCP
2006
116views more  JCP 2006»
13 years 7 months ago
Building a Virtual Hierarchy for Managing Trust Relationships in a Hybrid Architecture
Trust models provide a framework to create and manage trust relationships among the different entities of a Public Key Infrastructure (PKI). These trust relationships are verified ...
Cristina Satizábal, Rafael Páez, Jor...
FM
2009
Springer
104views Formal Methods» more  FM 2009»
14 years 2 months ago
A Metric Encoding for Bounded Model Checking
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...