Sciweavers

4716 search results - page 295 / 944
» Iterative-free program analysis
Sort
View
RTA
2007
Springer
16 years 22 days ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
PADL
2004
Springer
15 years 12 months ago
Improved Compilation of Prolog to C Using Moded Types and Determinism Information
We describe the current status of and provide performance results for a prototype compiler of Prolog to C, ciaocc. ciaocc is novel in that it is designed to accept different kinds...
José F. Morales, Manuel Carro, Manuel V. He...
ICS
1994
Tsinghua U.
15 years 10 months ago
Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
Kathryn S. McKinley
CADE
2010
Springer
15 years 7 months ago
A Slice-Based Decision Procedure for Type-Based Partial Orders
Automated software verification and path-sensitive program analysis require the ability to distinguish executable program paths from those that are infeasible. To achieve this, pro...
Elena Sherman, Brady J. Garvin, Matthew B. Dwyer
189
Voted
POPL
2012
ACM
14 years 2 months ago
Syntactic control of interference for separation logic
Separation Logic has witnessed tremendous success in recent years in reasoning about programs that deal with heap storage. Its success owes to the fundamental principle that one s...
Uday S. Reddy, John C. Reynolds