Compositionality In The Temporal Logic Of Concurrent Systems
Download Compositionality In The Temporal Logic Of Concurrent Systems full books in PDF, epub, and Kindle. Read online free Compositionality In The Temporal Logic Of Concurrent Systems ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Willem-Paul de Roever |
| Publisher | : Springer |
| Total Pages | : 655 |
| Release | : 2003-05-20 |
| Genre | : Computers |
| ISBN | : 3540492135 |
This book originates from the International Symposium on Compositionality, COMPOS'97, held in Bad Malente, Germany in September 1997. The 25 chapters presented in revised full version reflect the current state of the art in the area of compositional reasoning about concurrency. The book is a valuable reference for researchers and professionals interested in formal systems design and analysis; it also is well suited for self study and use in advanced courses.
| Author | : Antony Galton |
| Publisher | : |
| Total Pages | : 264 |
| Release | : 1987 |
| Genre | : Computers |
| ISBN | : |
FROM THE PREFACE: This book has risen from a conference on Temporal Logic and Its Applications held at the University of Leeds in January 1986, under the auspices of the then newly-created Centre for Theoretical Computer Science. Temporal logic is a field which, having originated within philosophy, has now proved to be of relevance to several distinct areas in computer science. In this publication, all of the aspects of temporal logic are treated together, hopefully providing a stimulus to further inter-disciplinary collaboration, not only as regards temporal logic itself but also in connection with other logical and philosophical issues, which lie at the interface between computing and philosophy.
| Author | : Zohar Manna |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 432 |
| Release | : 2012-12-06 |
| Genre | : Computers |
| ISBN | : 1461209315 |
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.
| Author | : Job Zwiers |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 284 |
| Release | : 1989-02-22 |
| Genre | : Computers |
| ISBN | : 9783540508458 |
The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes.
| Author | : Fred Kröger |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 440 |
| Release | : 2008-03-27 |
| Genre | : Computers |
| ISBN | : 3540674012 |
Temporal logic has developed over the last 30 years into a powerful formal setting for the specification and verification of state-based systems. Based on university lectures given by the authors, this book is a comprehensive, concise, uniform, up-to-date presentation of the theory and applications of linear and branching time temporal logic; TLA (Temporal Logic of Actions); automata theoretical connections; model checking; and related theories. All theoretical details and numerous application examples are elaborated carefully and with full formal rigor, and the book will serve as a basic source and reference for lecturers, graduate students and researchers.
| Author | : Jozef Hooman |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 254 |
| Release | : 1991-11-27 |
| Genre | : Computers |
| ISBN | : 9783540549475 |
The research described in this monograph concerns the formal specification and compositional verification of real-time systems. A real-time programminglanguage is considered in which concurrent processes communicate by synchronous message passing along unidirectional channels. To specifiy functional and timing properties of programs, two formalisms are investigated: one using a real-time version of temporal logic, called Metric Temporal Logic, and another which is basedon extended Hoare triples. Metric Temporal Logic provides a concise notationto express timing properties and to axiomatize the programming language, whereas Hoare-style formulae are especially convenient for the verification of sequential constructs. For both approaches a compositional proof system has been formulated to verify that a program satisfies a specification. To deduce timing properties of programs, first maximal parallelism is assumed, modeling the situation in which each process has itsown processor. Next, this model is generalized to multiprogramming where several processes may share a processor and scheduling is based on priorities. The proof systems are shown to be sound and relatively complete with respect to a denotational semantics of the programming language. The theory is illustrated by an example of a watchdog timer.
| Author | : Dennis Dams |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 383 |
| Release | : 2010-02-24 |
| Genre | : Computers |
| ISBN | : 364211511X |
This Festschrift volume, published in honor of Willem-Paul de Roever, contains 19 detailed papers written by the friends and colleagues of the honoree, all eminent scientists in their own right. These are preceded by a detailed bibliography and rounded off, at the end of the book, with a gallery of photographs. The theme under which the papers have been collected is Concurrency, Compositionality, and Correctness, reflecting the focus of Willem-Paul de Roever's research career. Topics addressed include model checking, computer science and state machines, ontology and mereology of domains, game theory, compiler correctness, fair scheduling and encryption algorithms.
| Author | : Eric Y.T. Juan |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 210 |
| Release | : 2012-12-06 |
| Genre | : Computers |
| ISBN | : 1461510090 |
With the rapid growth of networking and high-computing power, the demand for large-scale and complex software systems has increased dramatically. Many of the software systems support or supplant human control of safety-critical systems such as flight control systems, space shuttle control systems, aircraft avionics control systems, robotics, patient monitoring systems, nuclear power plant control systems, and so on. Failure of safety-critical systems could result in great disasters and loss of human life. Therefore, software used for safety critical systems should preserve high assurance properties. In order to comply with high assurance properties, a safety-critical system often shares resources between multiple concurrently active computing agents and must meet rigid real-time constraints. However, concurrency and timing constraints make the development of a safety-critical system much more error prone and arduous. The correctness of software systems nowadays depends mainly on the work of testing and debugging. Testing and debugging involve the process of de tecting, locating, analyzing, isolating, and correcting suspected faults using the runtime information of a system. However, testing and debugging are not sufficient to prove the correctness of a safety-critical system. In contrast, static analysis is supported by formalisms to specify the system precisely. Formal verification methods are then applied to prove the logical correctness of the system with respect to the specification. Formal verifica tion gives us greater confidence that safety-critical systems meet the desired assurance properties in order to avoid disastrous consequences.
| Author | : Krzysztof R. Apt |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 494 |
| Release | : 2013-03-08 |
| Genre | : Computers |
| ISBN | : 3642824536 |
The cooperation test [Apt, Francez & de Roever] was originally conceived to capture the proof theoretical analogue of distributed message exchange between disjoint processes, as opposed to the interference freedom test [Owicki & Gries], being the proof theoretical analogue of concurrent communication by means of interference through jointly shared variables. Some authors ([Levin & Gries, Lamport & Schneider, Schlichting and Schneider]) stress that both forms of communication can be proof theoretically characterized using interference freedom only, since proofs for both ultimately amount to an invariance proof of a big global assertion [Ashcroft], invariance of whose parts amounts to interference freedom. Yet I feel that the characteristic nature of the cooperation test is still preserved in the analysis of these authors, because in their analysis of CSP the part dealing with interference freedom specializes to maintenance of a global invariant, the expression of which requires per process the introduction of auxiliary variables which are updated in that process only, thus preserving the concept of disjointness (as opposed to sharing), since now all variables from different processes are disjoint. The cooperation test has been applied to characterize concurrent communication as occurring in Hoare's Communicating Sequential Processes (CSP) [Hoare 2], Ichbiah's ADA [ARM], and Brinch Hansen's Distributed Processes (DP) [Brinch Hansen]. This characterization has been certified through soundness and completeness proofs [Apt 2, Gerth]. As in the interference freedom test this characterization consists of two stages, a local sequential stage and a global stage.
| Author | : Eddy Odijk |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 460 |
| Release | : 1989-06-05 |
| Genre | : Computers |
| ISBN | : 9783540512851 |
Proceedings -- Parallel Computing.
