Sciweavers

797 search results - page 124 / 160
» Eliminating Proofs from Programs
Sort
View
CPP
2011
107views more  CPP 2011»
12 years 9 months ago
Simple, Functional, Sound and Complete Parsing for All Context-Free Grammars
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
Tom Ridge
ISSTA
2006
ACM
14 years 3 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
FASE
2006
Springer
14 years 1 months ago
Argus: Online Statistical Bug Detection
Statistical debugging is a powerful technique for identifying bugs that do not violate programming rules or program invariants. Previously known statistical debugging techniques ar...
Long Fei, Kyungwoo Lee, Fei Li, Samuel P. Midkiff
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
14 years 1 months ago
Streamlining Data Cache Access with Fast Address Calculation
For many programs, especially integer codes, untolerated load instruction latencies account for a significant portion of total execution time. In this paper, we present the desig...
Todd M. Austin, Dionisios N. Pnevmatikatos, Gurind...
IACR
2011
115views more  IACR 2011»
12 years 9 months ago
Multi-Server Oblivious RAM
Secure two-party computation protocol allows two players, Alice with secret input x and Bob with secret input y, to jointly execute an arbitrary program π(x, y) such that only th...
Steve Lu, Rafail Ostrovsky