Sciweavers

50 search results - page 9 / 10
» Undecidability Results for Finite Interactive Systems
Sort
View
SIGSOFT
2008
ACM
14 years 8 months ago
Semi-automating small-scale source code reuse via structural correspondence
Developers perform small-scale reuse tasks to save time and to increase the quality of their code, but due to their small scale, the costs of such tasks can quickly outweigh their...
Rylan Cottrell, Robert J. Walker, Jörg Denzin...
SIGSOFT
2003
ACM
14 years 8 months ago
ARCHER: using symbolic, path-sensitive analysis to detect memory access errors
Memory corruption errors lead to non-deterministic, elusive crashes. This paper describes ARCHER (ARray CHeckER) a static, effective memory access checker. ARCHER uses path-sensit...
Yichen Xie, Andy Chou, Dawson R. Engler
JNS
2010
107views more  JNS 2010»
13 years 2 months ago
Ground States and Critical Points for Aubry-Mather Theory in Statistical Mechanics
We consider statistical mechanics systems defined on a set with some symmetry properties (namely, the set admits an action by a group, which is finitely generated and residually fi...
Rafael de La Llave, Enrico Valdinoci
CAV
2009
Springer
206views Hardware» more  CAV 2009»
14 years 8 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...
RT
2000
Springer
13 years 11 months ago
Fast Global Illumination Including Specular Effects
Rapidly simulating global illumination, including diffuse and glossy light transport is a very difficult problem. Finite element or radiosity approaches can achieve interactive si...
Xavier Granier, George Drettakis, Bruce Walter