Sciweavers

10 search results - page 2 / 2
» Eliminating Array Bound Checking Through Dependent Types
Sort
View
FLOPS
2008
Springer
13 years 6 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
PEPM
2009
ACM
15 years 4 months ago
Static Consistency Checking for Verilog Wire Interconnects
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
Cherif Salama, Gregory Malecha, Walid Taha, Jim Gr...
PLDI
2006
ACM
13 years 10 months ago
SAFECode: enforcing alias analysis for weakly typed languages
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve
ESOP
2001
Springer
13 years 9 months ago
Typestate Checking of Machine Code
We check statically whether it is safe for untrusted foreign machine code to be loaded into a trusted host system. (Here “safety” means that the program abides by a memory-acc...
Zhichen Xu, Thomas W. Reps, Barton P. Miller
ESOP
2005
Springer
13 years 10 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow