Sciweavers

3653 search results - page 309 / 731
» On Recognizable Timed Languages
Sort
View
POPL
2001
ACM
16 years 7 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe
SIGMOD
2003
ACM
126views Database» more  SIGMOD 2003»
16 years 7 months ago
Issues in data stream management
Traditional databases store sets of relatively static records with no pre-defined notion of time, unless timestamp attributes are explicitly added. While this model adequately rep...
Lukasz Golab, M. Tamer Özsu
ICFP
2007
ACM
16 years 6 months ago
Stream fusion: from lists to streams to nothing at all
This paper presents an automatic deforestation system, stream fusion, based on equational transformations, that fuses a wider range of functions than existing short-cut fusion sys...
Duncan Coutts, Roman Leshchinskiy, Don Stewart
DCC
2007
IEEE
16 years 6 months ago
Type-Based Compression of XML Data
The extensible markup language XML has become indispensable in many areas, but a significant disadvantage is its size: tagging a set of data increases the space needed to store it...
Christopher League, Kenjone Eng
POPL
2010
ACM
16 years 4 months ago
Verified just-in-time compiler on x86
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
Magnus O. Myreen