Sciweavers

4218 search results - page 304 / 844
» Complete sets of cooperations
Sort
View
ICCAD
1997
IEEE
53views Hardware» more  ICCAD 1997»
15 years 10 months ago
A quantitative approach to functional debugging
We introduce a novel cut-based debugging paradigm. It coordinates design emulation and simulation and enables fast transition from one to another. Emulation or functional implemen...
Darko Kirovski, Miodrag Potkonjak
ITC
1989
IEEE
70views Hardware» more  ITC 1989»
15 years 10 months ago
The Pseudo-Exhaustive Test of Sequential Circuits
: The concept of a pseudo-exhaustive test for sequential circuits is introduced in a similar way as it is used for combinational networks. Instead of test sets one has to apply pse...
Sybille Hellebrand, Hans-Joachim Wunderlich
164
Voted
ITP
2010
172views Mathematics» more  ITP 2010»
15 years 10 months ago
Equations: A Dependent Pattern-Matching Compiler
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
Matthieu Sozeau
RTA
2010
Springer
15 years 10 months ago
Order-Sorted Unification with Regular Expression Sorts
Abstract. We extend first-order order-sorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is ...
Temur Kutsia, Mircea Marin
FOSSACS
2004
Springer
15 years 10 months ago
Unifying Recursive and Co-recursive Definitions in Sheaf Categories
In this paper we present a theorem for defining fixed-points in categories of sheaves. This result gives a unifying and general account of most techniques used in computer science ...
Pietro Di Gianantonio, Marino Miculan