Sciweavers

4722 search results - page 406 / 945
» Encoding Program Executions
Sort
View
FMCAD
2009
Springer
16 years 1 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
RSP
2007
IEEE
141views Control Systems» more  RSP 2007»
16 years 27 days ago
Rapid Prototyping of Intrusion Detection Systems
Designing security softwares that evolve as quickly as threats is a truthful challenge. In addition, current software becomes increasingly more complex and difficult to handle ev...
Fabrice Kordon, Jean-Baptiste Voron
PADL
2007
Springer
16 years 22 days ago
Partial Evaluation of Pointcuts
Abstract. In aspect-oriented programming, pointcuts are usually compiled by identifying a set of shadows — that is, places in the code whose execution is potentially relevant for...
Karl Klose, Klaus Ostermann, Michael Leuschel
ECOOP
2005
Springer
16 years 4 days ago
Lightweight Defect Localization for Java
A common method to localize defects is to compare the coverage of passing and failing program runs: A method executed only in failing runs, for instance, is likely to point to the ...
Valentin Dallmeier, Christian Lindig, Andreas Zell...
ECOOP
2005
Springer
16 years 4 days ago
Expressive Pointcuts for Increased Modularity
Abstract. In aspect-oriented programming, pointcuts are used to describe crossstructure. Pointcuts that abstract over irrelevant implementation details are clearly desired to bette...
Klaus Ostermann, Mira Mezini, Christoph Bockisch