Sciweavers

980 search results - page 20 / 196
» A Sequential Reduction Strategy
Sort
View
GLVLSI
2010
IEEE
178views VLSI» more  GLVLSI 2010»
15 years 2 months ago
Improving the testability and reliability of sequential circuits with invariant logic
In this paper, we investigate dual applications for logic implications, which can provide both online error detection capabilities and improve the testing efficiency of an integr...
Nuno Alves, Kundan Nepal, Jennifer Dworak, R. Iris...
CDES
2006
96views Hardware» more  CDES 2006»
14 years 11 months ago
Semi-Contiguous Memory Allocation for Efficient Sequential-Access
Many algorithms have been devised and studied for dynamic contiguous memory allocation. In the absence of enough contiguous memory to satisfy a particular request, one approach is...
Elias G. Khalaf, Ralph Tucci
CSL
2005
Springer
15 years 3 months ago
L-Nets, Strategies and Proof-Nets
We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying...
Pierre-Louis Curien, Claudia Faggian
92
Voted
ALP
1997
Springer
15 years 1 months ago
Perpetuality and Uniform Normalization
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
Zurab Khasidashvili, Mizuhito Ogawa
92
Voted
CORR
2009
Springer
109views Education» more  CORR 2009»
14 years 7 months ago
Extensional and Intensional Strategies
on of abstract strategies which is extensional in the sense that a strategy is defined explicitly of derivations of an abstract reduction system. We then move to a more intensional...
Tony Bourdier, Horatiu Cirstea, Daniel J. Doughert...