Sciweavers

261 search results - page 51 / 53
» Can Flash Memory Help in Model Checking
Sort
View
CAL
2010
13 years 4 months ago
SMT-Directory: Efficient Load-Load Ordering for SMT
Memory models like SC, TSO, and PC enforce load-load ordering, requiring that loads from any single thread appear to occur in program order to all other threads. Out-of-order execu...
A. Hilton, A. Roth
IANDC
2011
129views more  IANDC 2011»
13 years 2 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
JCSS
2008
81views more  JCSS 2008»
13 years 7 months ago
A simulator for adaptive parallel applications
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
NPIV
1999
ACM
142views Visualization» more  NPIV 1999»
13 years 11 months ago
ALMOST: Exploring Program Traces
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...
Manos Reniers, Steven P. Reis
CCS
2009
ACM
14 years 8 months ago
Hidden credential retrieval from a reusable password
We revisit the venerable question of access credentials management, which concerns the techniques that we, humans with limited memory, must employ to safeguard our various access ...
Xavier Boyen