Sciweavers

2119 search results - page 155 / 424
» Structure-Preserving Model Reduction
Sort
View
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
15 years 8 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
116
Voted
ICTCS
2003
Springer
15 years 8 months ago
A Calculus for Dynamic Linking
We define a calculus for modeling dynamic linking independently of the details of a particular programming environment. The calculus distinguishes at the language level the notion...
Davide Ancona, Sonia Fagorzi, Elena Zucca
ASP
2001
Springer
15 years 7 months ago
Useful Transformations in Answer set programming
We define a reduction system Ë¿ which preserves the stable semantics. This system includes two types of transformation rules. One type (which we call ˾) preserves the stable...
Mauricio Osorio, Juan Carlos Nieves, Chris Giannel...
ICCAD
1998
IEEE
96views Hardware» more  ICCAD 1998»
15 years 7 months ago
Test set compaction algorithms for combinational circuits
This paper presents two new algorithms, Redundant Vector Elimination(RVE) and Essential Fault Reduction (EFR), for generating compact test sets for combinational circuits under th...
Ilker Hamzaoglu, Janak H. Patel
DATE
2009
IEEE
64views Hardware» more  DATE 2009»
15 years 7 months ago
Speculative reduction-based scalable redundancy identification
The process of sequential redundancy identification is the cornerstone of sequential synthesis and equivalence checking frameworks. The scalability of the proof obligations inhere...
Hari Mony, Jason Baumgartner, Alan Mishchenko, Rob...