Sciweavers

4224 search results - page 780 / 845
» Reasoning about Choice
Sort
View
87
Voted
POPL
2010
ACM
15 years 8 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
POPL
2010
ACM
15 years 8 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
PPOPP
2010
ACM
15 years 8 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
ICDE
2010
IEEE
434views Database» more  ICDE 2010»
15 years 8 months ago
Progressive Result Generation for Multi-Criteria Decision Support Queries
— Multi-criteria decision support (MCDS) is crucial in many business and web applications such as web searches, B2B portals and on-line commerce. Such MCDS applications need to r...
Elke A. Rundensteiner, Venkatesh Raghavan
90
Voted
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
15 years 8 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu