Sciweavers

4485 search results - page 374 / 897
» Equivalences on Observable Processes
Sort
View
VLSID
2004
IEEE
147views VLSI» more  VLSID 2004»
16 years 7 months ago
Computing Silent Gate Models for Noise Analysis from Slew and Delay Tables
Abstract--In this paper, we present a new approach to calculate the steady state resistance values for CMOS library gates. These resistances are defined as simple equivalent models...
Shabbir H. Batterywala, Narendra V. Shenoy
STOC
2006
ACM
159views Algorithms» more  STOC 2006»
16 years 7 months ago
Learning a circuit by injecting values
d Abstract] Dana Angluin James Aspnes Jiang Chen Yinghua Wu We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned ...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu
POPL
2010
ACM
16 years 4 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
STACS
2009
Springer
16 years 1 months ago
Strong Completeness of Coalgebraic Modal Logics
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
Lutz Schröder, Dirk Pattinson
MICRO
2005
IEEE
114views Hardware» more  MICRO 2005»
16 years 12 days ago
Address-Indexed Memory Disambiguation and Store-to-Load Forwarding
This paper describes a scalable, low-complexity alternative to the conventional load/store queue (LSQ) for superscalar processors that execute load and store instructions speculat...
Sam S. Stone, Kevin M. Woley, Matthew I. Frank