Sciweavers

4469 search results - page 392 / 894
» Dynamic Program Slicing
Sort
View
CC
2010
Springer
150views System Software» more  CC 2010»
16 years 1 months ago
Practical Extensions to the IFDS Algorithm
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
Nomair A. Naeem, Ondrej Lhoták, Jonathan Ro...
ASPLOS
2006
ACM
16 years 26 days ago
HeapMD: identifying heap-based bugs using anomaly detection
We present the design, implementation, and evaluation of HeapMD, a dynamic analysis tool that finds heap-based bugs using anomaly detection. HeapMD is based upon the observation ...
Trishul M. Chilimbi, Vinod Ganapathy
185
Voted
SRDS
2003
IEEE
16 years 4 days ago
Transparent Runtime Randomization for Security
A large class of security attacks exploit software implementation vulnerabilities such as unchecked buffers. This paper proposes Transparent Runtime Randomization (TRR), a general...
Jun Xu, Zbigniew Kalbarczyk, Ravishankar K. Iyer
SIGADA
1998
Springer
15 years 11 months ago
Looking into Safety with the Safety and Security Rapporteur Group
The requirements of High Integrity safety-critical, secure and mission-critical Software force developers to use specialised development techniques. Often the choice of computer l...
Stephen Michell, Mark Saaltink, Brian A. Wichmann
ICFP
1997
ACM
15 years 11 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves