Sciweavers

525 search results - page 11 / 105
» Using Checkable Types in Automatic Protocol Analysis
Sort
View
PLDI
2006
ACM
14 years 1 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
PLDI
2009
ACM
14 years 8 months ago
Automatic generation of library bindings using static analysis
High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, timetested, meritorious code that are impractical...
Tristan Ravitch, Steve Jackson, Eric Aderhold, Ben...
IFIP
2004
Springer
14 years 1 months ago
Complementing Computational Protocol Analysis with Formal Specifications
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchco...
SAC
2006
ACM
14 years 1 months ago
Decoupling classes with inferred interfaces
Using small, context-specific interfaces in variable declarations serves the decoupling of classes and increases a program’s flexibility. To minimize its interface, a thorough a...
Friedrich Steimann, Philip Mayer, Andreas Meissner
EUROSYS
2007
ACM
14 years 4 months ago
Melange: creating a "functional" internet
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scot...