Sciweavers

548 search results - page 74 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
FPCA
1995
15 years 5 months ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
LFCS
2009
Springer
15 years 8 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
ISCA
2009
IEEE
199views Hardware» more  ISCA 2009»
15 years 8 months ago
SigRace: signature-based data race detection
Detecting data races in parallel programs is important for both software development and production-run diagnosis. Recently, there have been several proposals for hardware-assiste...
Abdullah Muzahid, Darío Suárez Graci...
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 2 days ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
GCB
2009
Springer
180views Biometrics» more  GCB 2009»
15 years 8 months ago
2D Projections of RNA Folding Landscapes
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...
Ronny Lorenz, Christoph Flamm, Ivo L. Hofacker