You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Traditionally, models and methods for the analysis of the functional correctness of reactive systems, and those for the analysis of their performance (and - pendability) aspects, have been studied by di?erent research communities. This has resulted in the development of successful, but distinct and largely unrelated modeling and analysis techniques for both domains. In many modern systems, however, the di?erence between their functional features and their performance properties has become blurred, as relevant functionalities become inextricably linked to performance aspects, e.g. isochronous data transfer for live video tra- mission. During the last decade, this trend has motivated an increa...
ICALP 2009, the 36th edition of the International Colloquium on Automata, Languages and Programming, was held on the island of Rhodes, July 6–10, 2009. ICALP is a series of annual conferences of the European Association for Theoretical Computer Science (EATCS) which ?rst took place in 1972. This year, the ICALP program consisted of the established track A (focusing on algorithms, complexity and games) and track B (focusing on logic, automata, semantics and theory of programming), and of the recently introduced track C (in 2009 focusing on foundations of networked computation). In response to the call for papers, the Program Committee received 370 s- missions: 223 for track A, 84 for track B and 63 for track C. Out of these, 108 papers were selected for inclusion in the scienti?c program: 62 papers for track A, 24 for track B and 22 for track C. The selection was made by the Program Committees based on originality, quality, and relevance to theoretical computer science. The quality of the manuscripts was very high indeed, and many dese- ing papers could not be selected. ICALP 2009 consisted of ?ve invited lectures and the contributed papers.
AMAST’s goal is to advance awareness of algebraic and logical methodology as part of the fundamental basis of software technology. Ten years and seven conferences after the start of the AMAST movement, I believe we are attaining this. The movement has propagated throughout the world, assembling many enthusiastic specialists who have participated not only in the conferences, which are now annual, but also in the innumerable other activities that AMAST promotes and supports. We are now facing the Seventh International Conference on Algebraic Methodology and Software Technology (AMAST’98). The previous meetings were held in Iowa City, USA (1989 and 1991), in Enschede, The Netherlands (1993)...
Collects the Latest Research Involving the Application of Process Algebra to ComputingExploring state-of-the-art applications, Process Algebra for Parallel and Distributed Processing shows how one formal method of reasoning-process algebra-has become a powerful tool for solving design and implementation challenges of concurrent systems. Parallel Pr
Static analysis of software with deductive methods is a highly dynamic field of research on the verge of becoming a mainstream technology in software engineering. It consists of a large portfolio of - mostly fully automated - analyses: formal verification, test generation, security analysis, visualization, and debugging. All of them are realized in the state-of-art deductive verification framework KeY. This book is the definitive guide to KeY that lets you explore the full potential of deductive software verification in practice. It contains the complete theory behind KeY for active researchers who want to understand it in depth or use it in their own work. But the book also features fully self-contained chapters on the Java Modeling Language and on Using KeY that require nothing else than familiarity with Java. All other chapters are accessible for graduate students (M.Sc. level and beyond). The KeY framework is free and open software, downloadable from the book companion website which contains also all code examples mentioned in this book.
This book constitutes the refereed proceedings of the Second International Conference on Integrated Formal Methods, IFM 2000, held in Dagstuhl, Germany in November 2000. The 22 revised full papers presented together with the abstracts of two invited talks were carefully reviewed and selected from 58 submissions. The papers are grouped together in topical sections on linking and extending notations, methodology, foundation of one formalism by another, semantics, and verification and validation.
This book constitutes the refereed proceedings of the 5th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2007. It covers work on foundations and semantics of timed systems; examines techniques, algorithms, data structures, and software tools for analyzing timed systems and resolving temporal constraints; and details applications like real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication.
This book constitutes the refereed proceedings of the 16th International Conference on Concurreny Theory, CONCUR 2005, held in San Francisco, CA, USA in August 2005. The 38 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 100 submissions. Among the topics covered are concurrency related aspects of models of computation, Petri nets, model checking, game semantics, process algebras, real-time systems, verification techniques, secrecy and authenticity, refinement, distributed programming, constraint logic programming, typing systems and algorithms, case studies, tools, and environment for programming and verification.
This book constitutes the proceedings of the 12th International Symposium on NASA Formal Methods, NFM 2020, held in Moffett Field, CA, USA, in May 2020.* The 20 full and 5 short papers presented in this volume were carefully reviewed and selected from 62 submissions. The papers are organized in the following topical sections: learning and formal synthesis; formal methods for DNNs; high assurance systems; requirement specification and testing; validation and solvers; solvers and program analysis; verification and times systems; autonomy and other applications; and hybrid and cyber-physical systems. *The conference was held virtually due to the COVID-19 pandemic. The chapter “Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
The refereed proceedings of the 14th International Conference on Rewriting Techniques and Applications, RTA 2003, held in Valencia, Spain in June 2003. The 26 revised regular papers and 6 system descriptions presented together with 3 invited contributions were carefully reviewed and selected from 61 submissions. All current aspects of rewriting are addressed.