Sciweavers

963 search results - page 18 / 193
» Escape Analysis on Lists
Sort
View
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
15 years 1 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
CAV
2007
Springer
126views Hardware» more  CAV 2007»
15 years 4 months ago
Shape Analysis for Composite Data Structures
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
Josh Berdine, Cristiano Calcagno, Byron Cook, Dino...
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
15 years 4 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
ICCD
2006
IEEE
133views Hardware» more  ICCD 2006»
15 years 6 months ago
Patching Processor Design Errors
— Microprocessors can have design errors that escape the test and validation process. The cost to rectify these errors after shipping the processors can be very expensive as it m...
Satish Narayanasamy, Bruce Carneal, Brad Calder
INFOCOM
2006
IEEE
15 years 3 months ago
A Quasi-Species Approach for Modeling the Dynamics of Polymorphic Worms
— Polymorphic worms can change their byte sequence as they replicate and propagate, thwarting the traditional signature analysis techniques used by many intrusion detection syste...
Bradley Stephenson, Biplab Sikdar