Sciweavers

1159 search results - page 203 / 232
» Binary Decision Graphs
Sort
View
KBSE
2007
IEEE
14 years 4 months ago
Effective memory protection using dynamic tainting
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...
James A. Clause, Ioannis Doudalis, Alessandro Orso...
IPPS
2006
IEEE
14 years 4 months ago
Memory minimization for tensor contractions using integer linear programming
This paper presents a technique for memory optimization for a class of computations that arises in the field of correlated electronic structure methods such as coupled cluster and...
A. Allam, J. Ramanujam, Gerald Baumgartner, P. Sad...
SRDS
2006
IEEE
14 years 4 months ago
Reliably Executing Tasks in the Presence of Untrusted Entities
In this work we consider a distributed system formed by a master processor and a collection of n processors (workers) that can execute tasks; worker processors are untrusted and m...
Antonio Fernández, Luis López, Agust...
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 4 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 3 months 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...