Reiner Hähnle – författare
Visar alla böcker från författaren Reiner Hähnle. Handla med fri frakt och snabb leverans.
17 produkter
17 produkter
Del 10 - International Series of Monographs on Computer Science
Automated Deduction in Multiple-Valued Logics
Inbunden, Engelska, 1994
1 663 kr
Skickas inom 7-10 vardagar
This book constitutes a self-contained and unified approach to automated reasoning in multiple-valued logics (MVL) developed by the author. Moreover, it contains a virtually complete account of other approaches to automated reasoning in MVL. This is the first overview of this subfield of automated reasoning ever given. Finally, a variety of applications of automated reasoning in MVL including several short case studies are listed.Automated reasoning in non-classical logics is an essential subtask of many AI applications. Applications of MVL in particular include, for instance, hardware and software verification, reasoning with incomplete or inconsistent knowledge, and natural language processing.Therefore, efficient theorem proving methods in MVL are essential. In the historical part of the book it is demonstrated why existing approaches are inadequate. In the original part a simple, but powerful, concept called 'sets-as-signs' is introduced in the context of semantic tableaux, and subsequently is applied to a variety of calculi including resolution and dissolution. It is shown that 'sets-as-signs' yields a many-valued extension of the well-known relationship between classical logic and integer programming. As a consequence, automated reasoning in infinitely-valued logics can be done uniformly and efficiently for the first time.
2 115 kr
Skickas inom 10-15 vardagar
There are several types of proof-theoretical methodologies, Hilbert style, Gentzen style, goal directed, labelled deductive system, as well as many others. One of the most popular is the analytic tableaux methodology, first proposed by Beth and Hintikka and later perfected by Smullyan and Fitting. The style is semantically based and very intuitive. It is the first style taught to students in many universities. The late-1990s have seen interest in tableaux become more widespread, and leading members of the "tableau community" here present a broad coverage of tableau systems for a variety of logics.
726 kr
Skickas inom 3-6 vardagar
771 kr
Skickas inom 5-8 vardagar
550 kr
Skickas inom 10-15 vardagar
This book is Open Access under a CC BY licence.This book constitutes the proceedings of the 22nd International Conference on Fundamental Approaches to Software Engineering, FASE 2019, which took place in Prague, Czech Republic in April 2019, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019.The 24 papers presented in this volume were carefully reviewed and selected from 94 submissions. The papers are organized in topical sections named: software verification; model-driven development and model transformation; software evolution and requirements engineering; specification, design, and implementation of particular classes of systems; and software testing.
Del 12345 - Lecture Notes in Computer Science
Deductive Software Verification: Future Perspectives
Reflections on the Occasion of 20 Years of KeY
Häftad, Engelska, 2020
550 kr
Skickas inom 10-15 vardagar
This book presents reflections on the occasion of 20 years on the KeY project that focuses on deductive software verification.Since the inception of the KeY project two decades ago, the area of deductive verification has evolved considerably.
Del 14360 - Lecture Notes in Computer Science
Active Object Languages: Current Research Trends
Häftad, Engelska, 2024
821 kr
Skickas inom 10-15 vardagar
Active Objects are a programming paradigm that supports a non-competitive, data-driven concurrency model. This renders active object languages to be well-suited for simulation, data race-free programming, and formal verification.
Del 8483 - Lecture Notes in Computer Science
Formal Methods for Executable Software Models
14th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2014, Bertinoro, Italy, June 16-20, 2014, Advanced Lectures
Häftad, Engelska, 2014
550 kr
Skickas inom 10-15 vardagar
This book presents 8 tutorial lectures given by leading researchers at the 14th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2014, held in Bertinoro, Italy, in June 2014.SFM 2014 was devoted to executable software models and covered topics such as variability models, automated analysis techniques, deductive verification, and runtime assessment and testing. The papers collected in the two parts (first part: modeling and verification; second part: run-time assessment and testing) of this volume represent the broad range of topics of the school.
Del 10001 - Lecture Notes in Computer Science
Deductive Software Verification – The KeY Book
From Theory to Practice
Häftad, Engelska, 2016
1 310 kr
Skickas inom 10-15 vardagar
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.
Del 11026 - Lecture Notes in Computer Science
Machine Learning for Dynamic Software Analysis: Potentials and Limits
International Dagstuhl Seminar 16172, Dagstuhl Castle, Germany, April 24-27, 2016, Revised Papers
Häftad, Engelska, 2018
637 kr
Skickas inom 10-15 vardagar
Machine learning of software artefacts is an emerging area of interaction between the machine learning and software analysis communities. These require new software analysis techniques based on machine learning, such as learning-based software testing, invariant generation or code synthesis.
Theorem Proving with Analytic Tableaux and Related Methods
4th International Workshop, TABLEAUX-95, Schloß Rheinfels, St. Goar, Germany, May 7 - 10, 1995. Proceedings
Häftad, Engelska, 1995
534 kr
Skickas inom 10-15 vardagar
This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schlob Rheinfels, St. Goar, Germany in May 1995. Originally tableau calculi and their relatives were favored primarily as a pedagogical device because of their advantages at the presentation level. The 23 full revised papers in this book bear witness that these methods have now gained fundamental importance in theorem proving, particularly as competitors for resolution methods. The book is organized in sections on extensions, modal logic, intuitionistic logic, the connection method and model elimination, non-clausal proof procedures, linear logic, higher-order logic, and applications
Verification of Object-Oriented Software. The KeY Approach
Foreword by K. Rustan M. Leino
Häftad, Engelska, 2007
1 093 kr
Skickas inom 10-15 vardagar
The ultimate goal of program verification is not the theory behind the tools or the tools themselves, but the application of the theory and tools in the software engineering process. Our society relies on the correctness of a vast and growing amount of software. Improving the software engineering process is an important, long-term goal with many steps. Two of those steps are the KeY tool and this KeY book. The material is presented on an advanced level suitable for graduate courses and, of course, active researchers with an interest in verification. The underlying verification paradigm is deductive verification in an expressive program logic. The logic used for reasoning about programs is not a minimalist version suitable for theoretical investigations, but an industrial-strength version. The first-order part is equipped with a type system for modelling of object hierarchies, with underspecification, and with various built-in theories. The program logic covers full Java Card (plus a bit more such as multi-dimensional arrays, characters, and long integers).A lot of emphasis is thereby put on specification, including two widely-used object-oriented specification languages (OCL and JML) and even an interface to natural language generation.The generation of proof obligations from specified code is discussed at length. The book is rounded off by two substantial case studies that are included and presented in detail.
Tests and Proofs
Second International Conference, TAP 2008, Prato, Italy, April 9-11, 2008, Proceedings
Häftad, Engelska, 2008
550 kr
Skickas inom 10-15 vardagar
This volume contains the research papers, invited papers, and abstracts of - torials presented at the Second International Conference on Tests and Proofs (TAP 2008) held April 9–11, 2008 in Prato, Italy. TAP was the second conference devoted to the convergence of proofs and tests. It combines ideas from both areasfor the advancement of softwarequality. To provethe correctnessof a programis to demonstrate, through impeccable mathematical techniques, that it has no bugs; to test a programis to run it with the expectation of discovering bugs. On the surface, the two techniques seem contradictory: if you have proved your program, it is fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on anyhope of proving its correctness.Accordingly,proofs and tests have,since the onset of software engineering research, been pursued by distinct communities using rather di?erent techniques and tools. And yet the development of both approaches leads to the discovery of c- mon issues and to the realization that each may need the other. The emergence of model checking has been one of the ?rst signs that contradiction may yield to complementarity, but in the past few years an increasing number of research e?orts have encountered the need for combining proofs and tests, dropping e- lier dogmatic views of their incompatibility and taking instead the best of what each of these software engineering domains has to o?er.
Automated Reasoning
5th International Joint Conference, IJCAR 2010, Edinburgh, UK, July 16-19, 2010, Proceedings
Häftad, Engelska, 2010
1 093 kr
Skickas inom 10-15 vardagar
This volume contains the proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR 2010). IJCAR 2010 was held during July 16-19 as part of the 2010 Federated Logic Conference, hosted by the School of Informatics at the University ofEdinburgh,Scotland. Support by the conference sponsors – EPSRC, NSF, Microsoft Research, Association for Symbolic Logic, CADE Inc. , Google, Hewlett-Packard, Intel – is gratefully acknowledged. IJCARisthepremierinternationaljointconferenceonalltopicsinautomated reasoning, including foundations, implementations, and applications. Previous IJCAR conferences were held at Siena (Italy) in 2001, Cork (Ireland) in 2004, Seattle (USA) in 2006, and Sydney (Australia) in 2008. IJCAR comprises s- eral leading conferences and workshops. In 2010, IJCAR was the fusion of the following events: –CADE: International Conference on Automated Deduction –FroCoS: International Symposium on Frontiers of Combining Systems –FTP: International Workshop on First-Order Theorem Proving – TABLEAUX: InternationalConferenceonAutomatedReasoningwith- alytic Tableaux and Related Methods There were 89 submissions (63 regular papers and 26 system descriptions) of which 40 were accepted (28 regular papers and 12 system descriptions). Each submission was assigned to at least three Program Committee members, who carefully reviewed the papers, with the help of 92 external referees. Afterwards, the submissions were discussed by the ProgramCommittee during two weeks by means of Andrei Voronkov’s EasyChair system. We want to thank Andrei very much for providing his system, which was very helpful for the management of the submissions and reviews and for the discussion of the Program Committee.
Del 336 - Communications in Computer and Information Science
Leveraging Applications of Formal Methods, Verification, and Validation
International Workshops, SARS 2011 and MLSC 2011, held under the auspices of ISoLA 2011 in Vienna, Austria, October 17-18, 2011. Revised Selected Papers
Häftad, Engelska, 2012
550 kr
Skickas inom 10-15 vardagar
This volume contains a selection of revised papers that were presented at the Software Aspects of Robotic Systems, SARS 2011 Workshop and the Machine Learning for System Construction, MLSC 2011 Workshop, held during October 17-18 in Vienna, Austria, under the auspices of the International Symposium Series on Leveraging Applications of Formal Methods, Verification, and Validation, ISoLA. The topics covered by the papers of the SARS and the MLSC workshop demonstrate the breadth and the richness of the respective fields of the two workshops stretching from robot programming to languages and compilation techniques, to real-time and fault tolerance, to dependability, software architectures, computer vision, cognitive robotics, multi-robot-coordination, and simulation to bio-inspired algorithms, and from machine learning for anomaly detection, to model construction in software product lines to classification of web service interfaces. In addition the SARS workshop hosted a special session on the recently launched KOROS project on collaborating robot systems that is borne by a consortium of researchers of the faculties of architecture and planning, computer science, electrical engineering and information technology, and mechanical and industrial engineering at the Vienna University of Technology. The four papers devoted to this session highlight important research directions pursued in this interdisciplinary research project.
Formal Methods for Components and Objects
11th International Symposium, FMCO 2012, Bertinoro, Italy, September 24-28, 2012, Revised Lectures
Häftad, Engelska, 2013
507 kr
Skickas inom 10-15 vardagar
This book constitutes revised lectures from the 11th Symposium on Formal Methods for Components and Object, FMCO 2012, held in Bertinoro, Italy, in September 2012. The book provides a unique combination of ideas on software engineering and formal methods which reflect the expanding body of knowledge on modern software systems.
2 115 kr
Skickas inom 10-15 vardagar
The tableau methodology, invented in the 1950's by Beth and Hintikka and later perfected by Smullyan and Fitting, is today one of the most popular proof theoretical methodologies. Firstly because it is a very intuitive tool, and secondly because it appears to bring together the proof-theoretical and the semantical approaches to the presentation of a logical system. The increasing demand for improved tableau methods for various logics is mainly prompted by extensive applications of logic in computer science, artificial intelligence and logic programming, as well as its use as a means of conceptual analysis in mathematics, philosophy, linguistics and in the social sciences. In the last few years the renewed interest in the method of analytic tableaux has generated a plethora of new results, in classical as well as non-classical logics. On the one hand, recent advances in tableau-based theorem proving have drawn attention to tableaux as a powerful deduction method for classical first-order logic, in particular for non-clausal formulas accommodating equality.On the other hand, there is a growing need for a diversity of non-classical logics which can serve various applications, and for algorithmic presentations of these logicas in a unifying framework which can support (or suggest) a meaningful semantic interpretation. From this point of view, the methodology of analytic tableaux seems to be most suitable. Therefore, renewed research activity is being devoted to investigating tableau systems for intuitionistic, modal, temporal and many-valued logics, as well as for new families of logics, such as non-monotonic and substructural logics. The results require systematisation. This Handbook is the first to provide such a systematisation of this expanding field. It contains several chapters on the use of tableaux methods in classical logic, but also contains extensive discussions on: the uses of the methodology in intuitionistic logics modal and temporal logics substructural logics, nonmonotonic and many-valued logics the implementation of semantic tableaux a bibliography on analytic tableaux theorem proving.The result is a solid reference work to be used by students and researchers in Computer Science, Artificial Intelligence, Mathematics, Philosophy, Cognitive Sciences, Legal Studies, Linguistics, Engineering and all the areas, whether theoretical or applied, in which the algorithmic aspects of logical deduction play a role.