Zobrazeno 1 - 10
of 56
pro vyhledávání: '"John Regehr"'
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-24
Superoptimization is a compilation strategy that uses search to improve code quality, rather than relying on a canned sequence of transformations, as traditional optimizing compilers do. This search can be seen as a program synthesis problem: from un
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-25
Compilers should not crash and they should not miscompile applications. Random testing is an effective method for finding compiler bugs that have escaped other kinds of testing. This paper presents Yet Another Random Program Generator (YARPGen), a ra
Publikováno v:
PLDI
We designed, implemented, and deployed Alive2: a bounded translation validation tool for the LLVM compiler’s intermediate representation (IR). It limits resource consumption by, for example, unrolling loops up to some bound, which means there are c
Publikováno v:
Proceedings of the ACM on Programming Languages. 2:1-28
LLVM miscompiles certain programs in C, C++, and Rust that use low-level language features such as raw pointers in Rust or conversion between integers and pointers in C or C++. The problem is that it is difficult for the compiler to implement aggress
Publikováno v:
CGO
Static analyses compute properties of programs that are true in all executions, and compilers use these properties to justify optimizations such as dead code elimination. Each static analysis in a compiler should be as precise as possible while remai
Publikováno v:
Communications of the ACM. 61:84-91
Compilers should not miscompile. Peephole optimizations, which perform local rewriting of the input program to improve the efficiency of generated code, are a persistent source of compiler bugs. We created Alive, a domain-specific language for writin
Autor:
John Regehr, Peter Bailis
Publikováno v:
Queue. 15:80-84
This installment of Research for Practice features a special curated selection from John Regehr, who takes us on a tour of great debates in academic computer science research. In case you thought flame wars were reserved for Usenet mailing lists and
Autor:
Peter Bailis, John Regehr
Publikováno v:
Communications of the ACM. 60:48-50
Expert-curated guides to the best of CS research.
Publikováno v:
ACM Transactions on Software Engineering and Methodology. 25:1-29
Integer overflow bugs in C and C++ programs are difficult to track down and may lead to fatal errors or exploitable vulnerabilities. Although a number of tools for finding these bugs exist, the situation is complicated because not all overflows are b
Publikováno v:
Software Testing, Verification and Reliability. 26:40-68
What is a test case for? Sometimes, to expose a fault. Tests can also exercise code, use memory or time, or produce desired output. Given a desired effect, a test case can be seen as a cause, and its components divided into essential required for eff