10 search results - page 1 / 2 » Latch Inference for Equivalence Checking |
RECOSOC
2007
13 years 6 months ago
2007
A method for inferring latches from combinational loops in a netlist using boolean equations is proposed in this paper. The method takes advantage of the solutions structure of th...
WFLP
2009
Springer
13 years 11 months ago
2009
Springer
This paper shows that type-checking and type-inference problems are equivalent in domain-free lambda calculi with existential types, that is, type-checking problem is Turing reduci...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
DLOG
2011
12 years 8 months ago
2011
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
KBSE
2005
IEEE
13 years 10 months ago
2005
IEEE
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. Two common kinds of concurrency errors are data races and atomicity violation...