Sciweavers

16 search results - page 2 / 4
» ABCD: eliminating array bounds checks on demand
Sort
View
PLDI
1990
ACM
13 years 9 months ago
A Fresh Look at Optimizing Array Bound Checking
- This paper describes techniques for optimizing range checks performed to detect array bound violations. In addition to the elimination of range check:s, the optimizations discuss...
Rajiv Gupta
CL
2000
Springer
13 years 9 months ago
Certification of Compiler Optimizations Using Kleene Algebra with Tests
We use Kleene algebra with tests to verify a wide assortment of common compiler optimizations, including dead code elimination, common subexpression elimination, copy propagation,...
Dexter Kozen, Maria-Christina Patron
FLOPS
2008
Springer
13 years 7 months ago
On-Demand Refinement of Dependent Types
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
Hiroshi Unno, Naoki Kobayashi
ICFP
2001
ACM
14 years 5 months ago
A Dependently Typed Assembly Language
We present a dependently typed assembly language (DTAL) in which the type system supports the use of a restricted form of dependent types, reaping some benefits of dependent types...
Hongwei Xi, Robert Harper
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 9 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...