Sciweavers

26 search results - page 5 / 6
» sas 2010
Sort
View
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 7 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
83
Voted
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
14 years 7 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
IPPS
2010
IEEE
14 years 7 months ago
Exploiting inter-thread temporal locality for chip multithreading
Multi-core organizations increasingly support multiple threads per core. Threads on a core usually share a single first-level data cache, so thread schedulers must try to minimize ...
Jiayuan Meng, Jeremy W. Sheaffer, Kevin Skadron
BMCBI
2010
153views more  BMCBI 2010»
14 years 9 months ago
MimoSA: a system for minimotif annotation
Background: Minimotifs are short peptide sequences within one protein, which are recognized by other proteins or molecules. While there are now several minimotif databases, they a...
Jay Vyas, Ronald J. Nowling, Thomas Meusburger, Da...
SCN
2010
Springer
232views Communications» more  SCN 2010»
14 years 7 months ago
Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...
Stanislaw Jarecki, Nitesh Saxena