Sciweavers

923 search results - page 157 / 185
» Factorizing Languages
Sort
View
ESOP
2000
Springer
15 years 3 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
WWW
2009
ACM
16 years 14 days ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
POPL
2009
ACM
16 years 13 days ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
ASPLOS
2009
ACM
16 years 13 days ago
TwinDrivers: semi-automatic derivation of fast and safe hypervisor network drivers from guest OS drivers
In a virtualized environment, device drivers are often run inside a virtual machine (VM) rather than in the hypervisor, for reasons of safety and reduction in software engineering...
Aravind Menon, Simon Schubert, Willy Zwaenepoel
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
15 years 12 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...