Sciweavers

1192 search results - page 7 / 239
» Computing Weakest Readings
Sort
View
SIGCSE
2003
ACM
293views Education» more  SIGCSE 2003»
15 years 5 months ago
Creating a computer science canon: a course of "classic" readings in computer science
Computer science has a reputation of being a discipline in a perpetual state of accelerated progress—a discipline in which our techniques, our hardware, our software systems, an...
Michael Eisenberg
DAM
1998
88views more  DAM 1998»
14 years 11 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
TCS
2010
14 years 10 months ago
Alternating states for dual nondeterminism in imperative programming
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
Wim H. Hesselink
SPIN
2009
Springer
15 years 6 months ago
Symbolic Analysis via Semantic Reinterpretation
Abstract. The paper presents a novel technique to create implementations of the basic primitives used in symbolic program analysis: forward symbolic evaluation, weakest liberal pre...
Junghee Lim, Akash Lal, Thomas W. Reps
IJET
2006
43views more  IJET 2006»
14 years 11 months ago
An investigation of using the computer for reading and writing in the English classroom in secondary schools in the UK
This paper presents an investigation of using the computer in English teaching at the secondary school in the UK, particularly in respect of reading and writing skills. Many studie...
Bin Zou