2084 search results - page 163 / 417 » Set Constraints in Logic Programming |
124
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
160
click to vote
CONCUR
2005
Springer
15 years 9 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
161
click to vote
ESOP
2010
Springer
16 years 1 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
136
click to vote
ETS
2009
IEEE
15 years 1 months ago
2009
IEEE
We optimize the full-response diagnostic fault dictionary from a given test set. The smallest set of vectors is selected without loss of diagnostic resolution of the given test se...
135
Voted
IEEEPACT
2002
IEEE
15 years 9 months ago
2002
IEEE
Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines ...