Sciweavers

1210 search results - page 214 / 242
» Formal Techniques for Java Programs
Sort
View
POPL
2006
ACM
16 years 2 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
POPL
2006
ACM
16 years 2 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
PLDI
2006
ACM
15 years 8 months ago
SAFECode: enforcing alias analysis for weakly typed languages
Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized ...
Dinakar Dhurjati, Sumant Kowshik, Vikram S. Adve
SIGSOFT
2000
ACM
15 years 6 months ago
Implicit context: easing software evolution and reuse
Software systems should consist of simple, conceptually clean software components interacting along narrow, well-defined paths. All too often, this is not reality: complex compon...
Robert J. Walker, Gail C. Murphy
BMCBI
2010
108views more  BMCBI 2010»
15 years 2 months ago
Confronting two-pair primer design for enzyme-free SNP genotyping based on a genetic algorithm
Background: Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) method produces allelespecific DNA bands of different lengths by adding four designed primers an...
Cheng-Hong Yang, Yu-Huei Cheng, Li-Yeh Chuang, Hsu...