6554 search results - page 364 / 1311 » Constraint Logic Programming |
167
click to vote
AHS
2007
IEEE
16 years 1 months ago
2007
IEEE
Since their invention in the 1980s, the logic density of FPGAs has increased exponentially with time. This increase of logic density first led to the development of synthesisable ...
186
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
As the sizes of general and special purpose processors increase rapidly, generating high quality manufacturing tests which can be run at native speeds is becoming a serious proble...
179
click to vote
CHI
2005
ACM
16 years 7 months ago
2005
ACM
Recent years have seen the evolution of networks of tiny low power computing blocks, known as sensor networks. In one class of sensor networks, a non-expert user, who has little o...
183
click to vote
SAT
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
204
click to vote
ESOP
2010
Springer
16 years 4 months ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...