Sciweavers

4731 search results - page 532 / 947
» Securing Interactive Programs
Sort
View
KBSE
2007
IEEE
16 years 1 months ago
Effective memory protection using dynamic tainting
Programs written in languages that provide direct access to memory through pointers often contain memory-related faults, which may cause non-deterministic failures and even securi...
James A. Clause, Ioannis Doudalis, Alessandro Orso...
OOPSLA
2007
Springer
16 years 1 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley
OOPSLA
2007
Springer
16 years 1 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
CCS
2005
ACM
16 years 13 days ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
ANCS
2007
ACM
15 years 11 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos