You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book is about the verification of reactive systems. A reactive system is a system that maintains an ongoing interaction with its environment, as opposed to computing some final value on termination. The family of reactive systems includes many classes of programs whose correct and reliable construction is con sidered to be particularly challenging, including concurrent programs, embedded and process control programs, and operating systems. Typical examples of such systems are an air traffic control system, programs controlling mechanical devices such as a train, or perpetually ongoing processes such as a nuclear reactor. With the expanding use of computers in safety-critical areas, wher...
Reactive systems are computing systems which are interactive, such as real-time systems, operating systems, concurrent systems, control systems, etc. They are among the most difficult computing systems to program. Temporal logic is a formal tool/language which yields excellent results in specifying reactive systems. This volume, the first of two, subtitled Specification, has a self-contained introduction to temporal logic and, more important, an introduction to the computational model for reactive programs, developed by Zohar Manna and Amir Pnueli of Stanford University and the Weizmann Institute of Science, Israel, respectively.
This volume is dedicated to the memory of the 1996 Turing Award winner Amir Pnueli, who passed away in November 2009. The Festschrift contains 15 scientific articles written by leading scientists who were close to Amir Pnueli either as former students, colleagues or friends. The topics covered span the entire breadth of the scientific work of Amir Pnueli, with a focus on the development and the application of formal methods. Also included is the first chapter of the unpublished Volume III of Zohar Manna and Amir Pnueli’s work on the verification of reactive systems using temporal logic techniques.
This book constitutes the thoroughly refereed post-proceedings of the Third International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2005, held in Uppsala, Sweden in September 2005 in conjunction with ARTIST2 summer school on Component Modelling, Testing and Verification, and Static analysis of embedded systems. The 19 revised full papers presented together with the abstracts of 3 invited talks were carefully selected from 43 submissions. The papers cover work on semantics and modeling of timed systems, formalisms for modeling and verification including timed automata, hybrid automata, and timed petri nets, games for verification and synthesis, model-checking, case studies and issues related to implementation, security and performance analysis.
Computation is ubiquitous: modern life would be inconceivable without it.Written as a series of conversations with influential computer scientists, mathematicians and physicists, this book provides access to the inner thinking of those who have made essential contributions to the development of computing and its applications. You will learn about the interviewees' education, career path, influences, methods of work, how they cope with failure and success, how they relax, how they see the future, and much more.The conversations are presented in jargon-free language suitable for a general audience, but with enough technical detail for more specialized readers. The aim of the book is not only to inform and entertain, but also to motivate and stimulate.
This Festschrift volume, published in honor of Nissim Francez on the occasion of his 65th birthday, contains 15 papers, written by friends and colleagues, many of whom congregated at a celebratory symposium held on May 2009, in Haifa, Israel.
This volume contains the proceedings of the 21st international conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), organized under the auspices of the Indian Association for Research in Computing Science (IARCS). This year’s conference attracted 73 submissions from 20 countries. Each s- mission was reviewed by at least three independent referees. In a departure from previous conferences, the ?nal selection of the papers making up the program was done through an electronic discussion spanning two weeks, without a physical meeting of the Program Committee (PC). Since the PC of FSTTCS is distributed across the globe, it is very di?cult to ?x a ...
By presenting state-of-the-art research results on various aspects of formal and visual modeling of software and systems, this book commemorates the 60th birthday of Hartmut Ehrig. The 24 invited reviewed papers are written by students and collaborators of Hartmut Ehrig who are established researchers in their fields. Reflecting the scientific interest and work of Hartmut Ehrig, the papers fall into three main parts on graph transformation, algebraic specification and logic, and formal and visual modeling.
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...
This book constitutes the refereed proceedings of the 12th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2003, held in L'Aquila, Italy in October 2003. The 24 revised full papers and 8 short papers presented were carefully reviewed and selected from 65 submissions. The papers are organized in topical sections on software verification, automata based methods, processor verification, specification methods, theorem proving, bounded model checking, and model checking and applications.