Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
A Discipline of Programming
Executional abstraction; The role of programming languages; States and their characterization; The characterization of semantics; The semantic characterization of a programming language; Two theorems; On the design of properly terminating; Euclid's algorithm revisited; The formal treatment of some small examples; The linear search theorem; The problem of the next permutation.
Edsger Wybe Dijkstra
Edsger Wybe Dijkstra (1930–2002) was one of the most influential researchers in the history of computer science, making fundamental contributions to both the theory and practice of computing. Early in his career, he proposed the single-source shortest path algorithm, now commonly referred to as Dijkstra’s algorithm. He wrote (with Jaap Zonneveld) the first ALGOL 60 compiler, and designed and implemented with his colleagues the influential THE operating system. Dijkstra invented the field of concurrent algorithms, with concepts such as mutual exclusion, deadlock detection, and synchronization. A prolific writer and forceful proponent of the concept of structured programming, he convincing...
Selected Writings on Computing: A personal Perspective
Since the summer of 1973, when I became a Burroughs Research Fellow, my life has been very different from what it had been before. The daily routine changed: instead of going to the University each day, where I used to spend most of my time in the company of others, I now went there only one day a week and was most of the time -that is, when not travelling!- alone in my study. In my solitude, mail and the written word in general became more and more important. The circumstance that my employer and I had the Atlantic Ocean between us was a further incentive to keep a fairly complete record of what I was doing. The public part of that output found its place in what became known as "the EWD ser...
Beauty Is Our Business
More than anything else, this book is a tribute to Edsger W. Dijkstra, on the occasion of his sixtieth birthday, by just a few of those fortunate enough to be influenced by him and his work and to be called his friend or relation, his master, colleague, or pupil. This book contains fifty-four technical contributions in different areas of endeavor, although many of them deal with an area of particular concern to Dijkstra: programming. Each contribution is relatively short and could be digested in one sitting. Together, they form a nice cross section of the discipline of programming at the beginning of the nineties. While many know of Dijkstra's technical contributions, they may not be aware o...
Predicate Calculus and Program Semantics
This booklet presents a reasonably self-contained theory of predicate trans former semantics. Predicate transformers were introduced by one of us (EWD) as a means for defining programming language semantics in a way that would directly support the systematic development of programs from their formal specifications. They met their original goal, but as time went on and program derivation became a more and more formal activity, their informal introduction and the fact that many of their properties had never been proved became more and more unsatisfactory. And so did the original exclusion of unbounded nondeterminacy. In 1982 we started to remedy these shortcomings. This little monograph is a result of that work. A possible -and even likely- criticism is that anyone sufficiently versed in lattice theory can easily derive all of our results himself. That criticism would be correct but somewhat beside the point. The first remark is that the average book on lattice theory is several times fatter (and probably less self contained) than this booklet. The second remark is that the predicate transformer semantics provided only one of the reasons for going through the pains of publication.
The Origin of Concurrent Programming
An essential reader containing 19 important papers on the invention and early development of concurrent programming and its relevance to computer science and computer engineering. All of them are written by the pioneers in concurrent programming, including Brinch Hansen himself, and have introductions added that summarize the papers and put them in perspective. The editor provides an overview chapter and neatly places all developments in perspective with chapter introductions and expository apparatus. Essential resource for graduates, professionals, and researchers in CS with an interest in concurrent programming principles. A familiarity with operating system principles is assumed.
Control Flow and Data Flow: Concepts of Distributed Programming
In a time of multiprocessor machines, message switching networks and process control programming tasks, the foundations of programming distributed systems are among the central challenges for computing sci enti sts. The foundati ons of di stributed programming compri se all the fasci nating questions of computing science: the development of adequate com putational , conceptual and semantic model s for distributed systems, specification methods, verification techniques, transformation rules, the development of suitable representations by programming languages, evaluation and execution of programs describing distributed systems. Being the 7th in a series of ASI Summer Schools at Marktoberdorf,...
The Dawn of Software Engineering
Contrary to what many believe, Alan Turing is not the father of the all-purpose computer. Engineers were, independently of Turing, already building such machines during World War II. Turing's influence was felt more in programming after his death than in computer building during his lifetime. The first person to receive a Turing award was a programmer, not a computer builder. Logicians and programmers recast Turing's notions of machine and universality. Gradually, these recast notions helped programmers to see the bigger picture of what they were accomplishing. Later, problems unsolvable with a computer influenced experienced programmers, including Edsger W. Dijkstra. Dijkstra's pioneering work shows that both unsolvability and aesthetics have practical relevance in software engineering. But to what extent did Dijkstra and others depend on Turing's accomplishments? This book presents a revealing synthesis for the modern software engineer and, by doing so, deromanticizes Turing's role in the history of computing.
