Sciweavers

529 search results - page 72 / 106
» Simple Random Logic Programs
Sort
View
SIGSOFT
2010
ACM
13 years 7 months ago
An effective dynamic analysis for detecting generalized deadlocks
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
Pallavi Joshi, Mayur Naik, Koushik Sen, David Gay
TIME
2005
IEEE
14 years 3 months ago
A Local Method for Prioritized Fusion of Temporal Information
Information often comes from different sources and merging these sources usually leads to the apparition of inconsistencies. Fusion is the operation which consists in restoring th...
Mahat Khelfallah, Belaid Benhamou
CODES
2008
IEEE
13 years 11 months ago
Specification-based compaction of directed tests for functional validation of pipelined processors
Functional validation is a major bottleneck in microprocessor design methodology. Simulation is the widely used method for functional validation using billions of random and biase...
Heon-Mo Koo, Prabhat Mishra
SLP
1994
121views more  SLP 1994»
13 years 11 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
AGP
2003
IEEE
14 years 1 months ago
Advanced Backjumping Techniques for Rule Instantiations
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
Simona Perri, Francesco Scarcello