Sciweavers

4940 search results - page 31 / 988
» On the Complexity of Universal Programs
Sort
View
120
Voted
HINC
2003
Springer
15 years 7 months ago
Early Curricula in Computer Science at the University of Iceland
With the acquisition of the first computer in 1964 programming was introduced into the engineering curriculum at the University of Iceland. Subsequently applied mathematics curricu...
Oddur Benediktsson
110
Voted
WORDS
2002
IEEE
15 years 6 months ago
Writing Temporally Predictable Code
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
Peter P. Puschner, Alan Burns
IPPS
1997
IEEE
15 years 6 months ago
Interoperability of Data Parallel Runtime Libraries
This paper describes a framework for providing the ability to use multiple specialized data parallel libraries and/or languages within a single application. The ability to use mul...
Guy Edjlali, Alan Sussman, Joel H. Saltz
JAC
2008
15 years 3 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
POPL
2011
ACM
14 years 4 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu