Sciweavers

268 search results - page 10 / 54
» Using Second Life in Programming's Communities of Practice
Sort
View
ICSE
2009
IEEE-ACM
14 years 7 months ago
Automatically finding patches using genetic programming
Automatic repair of programs has been a longstanding goal in software engineering, yet debugging remains a largely manual process. We introduce a fully automated method for locati...
Westley Weimer, ThanhVu Nguyen, Claire Le Goues, S...
CHES
2010
Springer
187views Cryptology» more  CHES 2010»
13 years 7 months ago
Garbled Circuits for Leakage-Resilience: Hardware Implementation and Evaluation of One-Time Programs - (Full Version)
The power of side-channel leakage attacks on cryptographic implementations is evident. Today's practical defenses are typically attack-specific countermeasures against certain...
Kimmo Järvinen, Vladimir Kolesnikov, Ahmad-Re...
ICASSP
2008
IEEE
14 years 1 months ago
Blind separation of non-negative sources by convex analysis: Effective method using linear programming
We recently reported a criterion for blind separation of non-negative sources, using a new concept called convex analysis for mixtures of non-negative sources (CAMNS). Under some ...
Tsung-Han Chan, Wing-Kin Ma, Chong-Yung Chi, Yue W...
ICSE
1999
IEEE-ACM
13 years 11 months ago
Dynamically Discovering Likely Program Invariants to Support Program Evolution
ÐExplicitly stated program invariants can help programmers by identifying program properties that must be preserved when modifying code. In practice, however, these invariants are...
Michael D. Ernst, Jake Cockrell, William G. Griswo...
EC
1998
112views ECommerce» more  EC 1998»
13 years 6 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley