Sciweavers

2257 search results - page 200 / 452
» Secure program partitioning
Sort
View
137
Voted
CORR
1999
Springer
145views Education» more  CORR 1999»
15 years 13 days ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
ICARIS
2010
Springer
14 years 11 months ago
A Developmental and Immune-Inspired Dynamic Task Allocation Algorithm for Microprocessor Array Systems
Abstract. This paper presents a high level dynamic task allocation algorithm that is inspired by the biological development process and the immune system. For a microprocessor (µP...
Yang Liu, Jon Timmis, Omer Qadir, Gianluca Tempest...
223
Voted
POPL
2006
ACM
16 years 1 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
120
Voted
ACSAC
2004
IEEE
15 years 4 months ago
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors)
Buffer overflow vulnerabilities are caused by programming errors that allow an attacker to cause the program to write beyond the bounds of an allocated memory block to corrupt oth...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
DRM
2007
Springer
15 years 7 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...