Sciweavers

2076 search results - page 205 / 416
» Functional logic overloading
Sort
View
133
Voted
SEFM
2003
IEEE
15 years 8 months ago
From Requirements to Design: Formalizing the Key Steps
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...
R. Geoff Dromey
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
15 years 5 months ago
Constraint extraction for pseudo-functional scan-based delay testing
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...
Yung-Chieh Lin, Feng Lu, Kai Yang, Kwang-Ting Chen...
128
Voted
FLOPS
2008
Springer
15 years 5 months ago
Rewriting and Call-Time Choice: The HO Case
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...
Francisco Javier López-Fraguas, Juan Rodr&i...
131
Voted
DAC
2004
ACM
16 years 4 months ago
A recursive paradigm to solve Boolean relations
A recursive algorithm for solving Boolean relations is presented. It provides several features: wide exploration of solutions, parametrizable cost function and efficiency. The exp...
David Bañeres, Jordi Cortadella, Michael Ki...
106
Voted
ARC
2009
Springer
102views Hardware» more  ARC 2009»
15 years 10 months ago
A Parallel Branching Program Machine for Emulation of Sequential Circuits
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...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura,...