Sciweavers

967 search results - page 107 / 194
» Cycle spaces in topological spaces
Sort
View
APLAS
2010
ACM
15 years 20 days ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann
73
Voted
FMSD
2006
103views more  FMSD 2006»
15 years 13 days ago
Compositional SCC Analysis for Language Emptiness
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita...
129
Voted
CIDR
2011
223views Algorithms» more  CIDR 2011»
14 years 4 months ago
No bits left behind
One of the key tenets of database system design is making efficient use of storage and memory resources. However, existing database system implementations are actually extremely ...
Eugene Wu 0002, Carlo Curino, Samuel Madden
SEFM
2008
IEEE
15 years 6 months ago
A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
Tuan-Hung Pham, Anh-Hoang Truong, Ninh-Thuan Truon...
IPC
2007
IEEE
15 years 6 months ago
A Rapid Development Approach for Signal Strength Based Location Systems
Location systems are core technologies for enabling pervasive computing smart spaces. Signal Strength based location estimation offers economical viability and sufficient accurac...
Uzair Ahmad, Andrey Gavrilov, Sungyoung Lee, Young...