Sciweavers

2138 search results - page 329 / 428
» Logics for the Relational Syllogistic
Sort
View
POPL
2006
ACM
14 years 9 months ago
Small bisimulations for reasoning about higher-order imperative programs
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
Vasileios Koutavas, Mitchell Wand
POPL
2006
ACM
14 years 9 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
ICCAD
2004
IEEE
125views Hardware» more  ICCAD 2004»
14 years 6 months ago
Temporal floorplanning using the T-tree formulation
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang
ICDAR
2009
IEEE
14 years 4 months ago
User-Guided Wrapping of PDF Documents Using Graph Matching Techniques
There are a number of established products on the market for wrapping—semi-automatic navigation and extraction of data—from web pages. These solutions make use of the inherent...
Tamir Hassan
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
14 years 3 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller