Sciweavers

685 search results - page 6 / 137
» Closure Operators for Order Structures
Sort
View
LICS
2009
IEEE
15 years 6 months ago
Substructural Operational Semantics as Ordered Logic Programming
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...
Frank Pfenning, Robert J. Simmons
ICCAD
2001
IEEE
97views Hardware» more  ICCAD 2001»
15 years 8 months ago
Addressing the Timing Closure Problem by Integrating Logic Optimization and Placement
Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation...
Wilsin Gosti, Sunil P. Khatri, Alberto L. Sangiova...
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 3 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
BIRTHDAY
2004
Springer
15 years 5 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 8 months ago
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
Huan Ren, Shantanu Dutt