You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the Second International Conference on Interactive Theorem proving, ITP 2011, held in Berg en Dal, The Netherlands, in August 2011. The 25 revised full papers presented were carefully reviewed and selected from 50 submissions. Among the topics covered are counterexample generation, verification, validation, term rewriting, theorem proving, computability theory, translations from one formalism to another, and cooperation between tools. Several verification case studies were presented, with applications to computational geometry, unification, real analysis, etc.
This book constitutes the thoroughly refereed revised selected papers of the 19th International Symposium on Trends in Functional Programming, TFP 2018, held in Gothenburg, Sweden, in June 2018. The 7 revised full papers were selected from 13 submissions and present papers in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions, described in draft papers submitted prior to the symposium.
This volume contains the proceedings of the third working conference on Verified Software: Theories, Tools, and Experiments, VSTTE 2010, held in Edinburgh, UK, in August 2010. The 11 papers presented together with 3 invited talks were carefully revised and selected for inclusion in the book. This third conference is part of the Verified Software Initiative (VSI), which is a 15 year international project that focuses on the scientific and technical challenges of producing verified software. The goal of VSTTE 2010 was to advance the state of the art in the science and technology of software verification through the interaction of theory development, tool evolution, and experimental validation. The accepted papers represent work on verification techniques, specification languages, formal calculi, verification tools, solutions to challenge problems, software design methods, reusable components, refinement methodologies, and requirements modeling.
This book constitutes the thoroughly refereed proceedings of the Third International Conference on Interactive Theorem Proving, ITP 2012, held in Princeton, NJ, USA, in August 2012. The 21 revised full papers presented together with 4 rough diamond papers, 3 invited talks, and one invited tutorial were carefully reviewed and selected from 40 submissions. Among the topics covered are formalization of mathematics; program abstraction and logics; data structures and synthesis; security; (non-)termination and automata; program verification; theorem prover development; reasoning about program execution; and prover infrastructure and modeling styles.
Part I of this book is a practical introduction to working with the Isabelle proof assistant. It teaches you how to write functional programs and inductive definitions and how to prove properties about them in Isabelle’s structured proof language. Part II is an introduction to the semantics of imperative languages with an emphasis on applications like compilers and program analysers. The distinguishing feature is that all the mathematics has been formalised in Isabelle and much of it is executable. Part I focusses on the details of proofs in Isabelle; Part II can be read even without familiarity with Isabelle’s proof language, all proofs are described in detail but informally. The book teaches the reader the art of precise logical reasoning and the practical use of a proof assistant as a surgical tool for formal proofs about computer science artefacts. In this sense it represents a formal approach to computer science, not just semantics. The Isabelle formalisation, including the proofs and accompanying slides, are freely available online, and the book is suitable for graduate students, advanced undergraduate students, and researchers in theoretical computer science and logic.
This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Fundamentals of Software Engineering, FSEN 2019, held in Tehran, Iran, in May 2019. The 14 full papers and 3 short papers presented in this volume were carefully reviewed and selected from 47 submissions. The topics of interest in FSEN span over all aspects of formal methods, especially those related to advancing the application of formal methods in the software industry and promoting their integration with practical engineering techniques. The papers are organized in topical sections on agent based systems, theorem proving, learning, verification, distributed algorithms, and program analysis.
In order to solve a long-standing problem with list fusion, a new compiler transformation, "Call Arity" is developed and implemented in the Haskell compiler GHC. It is formally proven to not degrade program performance; the proof is machine-checked using the interactive theorem prover Isabelle. To that end, a formalization of Launchbury's Natural Semantics for Lazy Evaluation is modelled in Isabelle, including a correctness and adequacy proof.
This book constitutes the refereed proceedings of the 18th International Conference on Compiler Construction, CC 2009, held in York, UK, in March 2009 as part of ETAPS 2009, the European Joint Conferences on Theory and Practice of Software. Following a very thorough review process, 18 full research papers were selected from 72 submissions. Topics covered include traditional compiler construction, compiler analyses, runtime systems and tools, programming tools, techniques for specific domains, and the design and implementation of novel language constructs.
This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 – April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic. The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers. The papers are organized in topical sections as follows: Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication. Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.
This book constitutes the refereed proceedings of the 17th European Symposium on Programming, ESOP 2008, held in Budapest, Hungary, in March/April 2008, as part of ETAPS 2008, the European Joint Conferences on Theory and Practice of Software. The 25 revised full papers presented together with the abstract of one invited talk and two tool presentations were carefully reviewed and selected from 104 submissions and address fundamental issues in the specification, analysis, and implementation of programming languages and sytems. The papers are organized in topical sections on static analysis, security, concurrency and program verification.