1226 search results - page 130 / 246 » Proofs, Programs and Abstract Complexity |
132
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
139
Voted
IEEECIT
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--The size, heterogeneity and dynamism of the execution platforms of scientific applications, like computational grids, make using those platforms complex. Furthermore, tod...
137
Voted
SIGCSE
2009
ACM
15 years 10 months ago
2009
ACM
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
123
Voted
FOSSACS
2008
Springer
15 years 5 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
122
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...