Sciweavers

251 search results - page 48 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
AADEBUG
2005
Springer
14 years 27 days ago
Experimental evaluation of using dynamic slices for fault location
Dynamic slicing algorithms have been considered to aid in debugging for many years. However, as far as we know, no detailed studies on evaluating the benefits of using dynamic sl...
Xiangyu Zhang, Haifeng He, Neelam Gupta, Rajiv Gup...
VSTTE
2005
Springer
14 years 25 days ago
Model Checking: Back and Forth between Hardware and Software
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
Edmund M. Clarke, Anubhav Gupta, Himanshu Jain, He...
CODES
2003
IEEE
14 years 20 days ago
Accurate estimation of cache-related preemption delay
Multitasked real-time systems often employ caches to boost performance. However the unpredictable dynamic behavior of caches makes schedulability analysis of such systems difficul...
Hemendra Singh Negi, Tulika Mitra, Abhik Roychoudh...
CP
2001
Springer
13 years 12 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi