Sciweavers

114 search results - page 18 / 23
» On the structure of compatible rational functions
Sort
View
FOAL
2009
ACM
14 years 1 months ago
A machine-checked model of safe composition
Programs of a software product line can be synthesized by composing features which implement some unit of program functionality. In most product lines, only some combination of fe...
Benjamin Delaware, William R. Cook, Don S. Batory
DATE
2008
IEEE
111views Hardware» more  DATE 2008»
14 years 1 months ago
A Formal Approach To The Protocol Converter Problem
In the absence of a single module interface standard, integration of pre-designed modules in System-on-Chip design often requires the use of protocol converters. Existing approach...
Karin Avnit, Vijay D'Silva, Arcot Sowmya, S. Rames...
DSN
2007
IEEE
14 years 1 months ago
Fault Tolerant Approaches to Nanoelectronic Programmable Logic Arrays
Programmable logic arrays (PLA), which can implement arbitrary logic functions in a two-level logic form, are promising as platforms for nanoelectronic logic due to their highly r...
Wenjing Rao, Alex Orailoglu, Ramesh Karri
ICFP
1999
ACM
13 years 11 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
IACR
2011
113views more  IACR 2011»
12 years 7 months ago
GNUC: A New Universal Composability Framework
We put forward a framework for the modular design and analysis of multi-party protocols. Our framework is called “GNUC” (with the recursive meaning “GNUC’s Not UC”), alr...
Dennis Hofheinz, Victor Shoup