Sciweavers

5964 search results - page 221 / 1193
» A theory of speculative computation
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
Decidable Expansions of Labelled Linear Orderings
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
Alexis Bès, Alexander Rabinovich
JCSS
2007
75views more  JCSS 2007»
15 years 7 months ago
Undecidability of the structure of the Solovay degrees of c.e. reals
We show that the elementary theory of the structure of the Solovay degrees of computably enumerable reals is undecidable.
Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey L...
DAC
2000
ACM
16 years 8 months ago
Formal verification of iterative algorithms in microprocessors
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
Mark Aagaard, Robert B. Jones, Roope Kaivola, Kath...
CHI
2009
ACM
16 years 7 months ago
Finding causes of program output with the Java Whyline
Debugging and diagnostic tools are some of the most important software development tools, but most expect developers choose the right code to inspect. Unfortunately, this rarely o...
Andrew Jensen Ko, Brad A. Myers
HPCA
2008
IEEE
16 years 7 months ago
PEEP: Exploiting predictability of memory dependences in SMT processors
Simultaneous Multithreading (SMT) attempts to keep a dynamically scheduled processor's resources busy with work from multiple independent threads. Threads with longlatency st...
Samantika Subramaniam, Milos Prvulovic, Gabriel H....