Sciweavers

239 search results - page 18 / 48
» Data Abstraction and Constraint Solving for Conformance Test...
Sort
View
TVLSI
2008
140views more  TVLSI 2008»
14 years 10 months ago
A Novel Mutation-Based Validation Paradigm for High-Level Hardware Descriptions
We present a Mutation-based Validation Paradigm (MVP) technology that can handle complete high-level microprocessor implementations and is based on explicit design error modeling, ...
Jorge Campos, Hussain Al-Asaad
ECAI
2004
Springer
15 years 4 months ago
Using Constraints with Memory to Implement Variable Elimination
Abstract. Adaptive consistency is a solving algorithm for constraint networks. Its basic step is variable elimination: it takes a network as input, and producesan equivalent networ...
Martí Sánchez, Pedro Meseguer, Javie...
CP
2007
Springer
15 years 2 months ago
Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
Alfonso Gerevini, Alessandro Saetti
89
Voted
ICFEM
2004
Springer
15 years 4 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
ICPR
2002
IEEE
15 years 3 months ago
High-Resolution Reconstruction of Sparse Data from Dense Low-Resolution Spatio-Temporal Data
Abstract—A novel approach for reconstruction of sparse highresolution data from lower-resolution dense spatio-temporal data is introduced. The basic idea is to compute the dense ...
Qing Yang, Bahram Parvin