2076 search results - page 205 / 416 » Functional logic overloading |
176
click to vote
SEFM
2003
IEEE
15 years 11 months ago
2003
IEEE
Despite the advances in software engineering since 1968, current methods for going from a set of functional requirements to a design are not as direct, repeatable and constructive...
156
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
Recent research results have shown that the traditional structural testing for delay and crosstalk faults may result in over-testing due to the non-trivial number of such faults t...
167
click to vote
FLOPS
2008
Springer
15 years 8 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
176
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
145
click to vote
ARC
2009
Springer
16 years 1 months ago
2009
Springer
The parallel branching program machine (PBM128) consists of 128 branching program machines (BMs) and a programmable interconnection. To represent logic functions on BMs, we use qua...