Automated Theorem Proving in Software Engineering

This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering.

Author: Johann M. Schumann

Publisher: Springer Science & Business Media

ISBN: 3662226464

Category: Computers

Page: 228

View: 118

Growing demands for the quality, safety, and security of software can only be satisfied by the rigorous application of formal methods during software design. This book methodically investigates the potential of first-order logic automated theorem provers for applications in software engineering. Illustrated by complete case studies on protocol verification, verification of security protocols, and logic-based software reuse, this book provides techniques for assessing the prover's capabilities and for selecting and developing an appropriate interface architecture.

Automated Theorem Proving

This text and software package introduces readers to automated theorem proving, while providing two approaches implemented as easy-to-use programs. These are semantic-tree theorem proving and resolution-refutation theorem proving.

Author: Monty Newborn

Publisher: Springer Science & Business Media

ISBN: 9780387950754

Category: Mathematics

Page: 231

View: 855

This text and software package introduces readers to automated theorem proving, while providing two approaches implemented as easy-to-use programs. These are semantic-tree theorem proving and resolution-refutation theorem proving. The early chapters introduce first-order predicate calculus, well-formed formulae, and their transformation to clauses. Then the author goes on to show how the two methods work and provides numerous examples for readers to try their hand at theorem-proving experiments. Each chapter comes with exercises designed to familiarise the readers with the ideas and with the software, and answers to many of the problems.

Fundamental Approaches to Software Engineering

23rd International Conference, FASE 2020, Held as Part of the European Joint
Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland,
April ... Schumann, J.M.: Automated Theorem Proving in Software Engineering.

Author: Heike Wehrheim

Publisher:

ISBN: 3030452344

Category: Architecture, Computer

Page: 552

View: 325

This open access book constitutes the proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020, which took place in Dublin, Ireland, in April 2020, and was held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The 23 full papers, 1 tool paper and 6 testing competition papers presented in this volume were carefully reviewed and selected from 81 submissions. The papers cover topics such as requirements engineering, software architectures, specification, software quality, validation, verification of functional and non-functional properties, model-driven development and model transformation, software processes, security and software evolution.

Computerworld

... Designing and building a theorem prover to accomplish automatic verification
of correctness of automated transformations of spedfications to code in a spatial-
purpose software engineering domain; and - Designi and buildin a theorem ...

Author:

Publisher:

ISBN:

Category:

Page: 116

View: 514

For more than 40 years, Computerworld has been the leading source of technology news and information for IT influencers worldwide. Computerworld's award-winning Web site (Computerworld.com), twice-monthly publication, focused conference series and custom research form the hub of the world's largest global IT media network.

Automated Theorem Proving

Among the dreams of mankind is the one dealing with the mecha­ nization of human thought.

Author: W. Bibel

Publisher: Vieweg + Teubner Verlag

ISBN:

Category: Computers

Page: 292

View: 646

Among the dreams of mankind is the one dealing with the mecha­ nization of human thought. As the world today has become so complex that humans apparently fail to manage it properly with their intellectual gifts, the realization of this dream might be regarded even as something like a necessity. On the other hand, the incredible advances in computer technology let it appear as a real possibility. Of course, it is not easy to say what sort of thing human thinking actually is, a theme which over the centuries occupied many thinkers, mainly philosophers. From a critical point of view most of their theories were of a speculative nature since their only way of testing was by Gedanken-experi­ ments. It is the computer which has opened here a wide range of new possibilities since with this tool we now can model real experiments and thus test such theories like physicists do in their field. About a quarter of a century ago, scientific activi­ ties of that sort were started under the label of artificial intelligence Today these activities establish a wide and prosperous field which the author, in lack of any better name, prefers to call intellectics. Without any doubt, the com­ puter programs developed in this field have tought us much about the nature of human thinking.

Interactive Theorem Proving and Program Development

It is based on a theory called the calculus of inductive constructions, a variant of type theory. This book provides a pragmatic introduction to the development of proofs and certified programs using Coq.

Author: Yves Bertot

Publisher: Springer Science & Business Media

ISBN: 9783540208549

Category: Mathematics

Page: 472

View: 469

A practical introduction to the development of proofs and certified programs using Coq. An invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.

Engineering of Computer based Systems

A Formal Software Verification Concept Based on Automated Theorem Proving
and Reverse Engineering by M . Popovic , V . Kovacevic , I . Velikic University of
Novi Sad , Faculty of Engineering , Department for Computers & Control , Trg D ...

Author: IEEE Computer Society. Technical Committee on the Engineering of Computer Based Systems

Publisher: IEEE

ISBN: 9780769515496

Category: Computers

Page: 277

View: 197

Papers from an April 2002 conference, 25 in all, report on academic achievements and industrial applications in the engineering of computer-based systems. Contributors represent some 12 countries and a variety of application domains. Papers deal with themes of requirements engineering, processes and tools, system properties and methods, modeling and analysis, system architecture, model-based system development, component-based design and reuse, embedded systems, and mobile agents. Specific topics include an intelligent agent security intrusion system, managing complex temporal requirements in real-time control systems, using category theory to model software component dependencies, and advanced Petri nets for modeling mobile agent enabled interorganizational workflows. There is no subject index. Annotation copyrighted by Book News Inc., Portland, OR.

Guide to Programs

Software Engineering - Supports research on all aspects of software
development and management , thereby leading to the ... computational
geometry , optimization and mathematical programming , and automated
theorem - proving .

Author: National Science Foundation (U.S.)

Publisher:

ISBN:

Category: Federal aid to research

Page:

View: 147


Readings in Artificial Intelligence and Software Engineering

This book is organized into 11 parts encompassing 34 chapters that specifically tackle the topics of deductive synthesis, program transformations, program verification, and programming tutors.

Author: Charles Rich

Publisher: Morgan Kaufmann

ISBN: 1483214427

Category: Computers

Page: 624

View: 180

Readings in Artificial Intelligence and Software Engineering covers the main techniques and application of artificial intelligence and software engineering. The ultimate goal of artificial intelligence applied to software engineering is automatic programming. Automatic programming would allow a user to simply say what is wanted and have a program produced completely automatically. This book is organized into 11 parts encompassing 34 chapters that specifically tackle the topics of deductive synthesis, program transformations, program verification, and programming tutors. The opening parts provide an introduction to the key ideas to the deductive approach, namely the correspondence between theorems and specifications and between constructive proofs and programs. These parts also describes automatic theorem provers whose development has be designed for the programming domain. The subsequent parts present generalized program transformation systems, the problems involved in using natural language input, the features of very high level languages, and the advantages of the programming by example system. Other parts explore the intelligent assistant approach and the significance and relation of programming knowledge in other programming system. The concluding parts focus on the features of the domain knowledge system and the artificial intelligence programming. Software engineers and designers and computer programmers, as well as researchers in the field of artificial intelligence will find this book invaluable.

Theorem Proving in Higher Order Logics

In Proceedings, 12th IEEE International Conference Automated Software
Engineering. IEEE Computer Society, 1997. 5. R. Constable and D. Howe.
Implementing metamathematics as an approach to automatic theorem proving. In
R.B. Banerji ...

Author:

Publisher:

ISBN:

Category: Automatic theorem proving

Page:

View: 825


Formal Methods and Software Engineering

Automatic code synthesis based on automatic proof suffers from the problems of
automated theorem proving. In general it is difficult to guarantee that a proof and
hence code will be generated. However by constraining the problem space, ...

Author:

Publisher:

ISBN:

Category: Formal methods (Computer science)

Page:

View: 981


ACM Transactions on Software Engineering and Methodology

INTRODUCTION Concurrency is commonly employed to help software systems
meet demanding performance or responsiveness requirements ... Finite - state
verification approaches are not as general as theorem - proving - based
verification approaches ( Hoare ... proved but , unlike automated theorem provers
, they are guaranteed to terminate and require much less mathematical
sophistication to use ...

Author:

Publisher:

ISBN:

Category: Computer software

Page:

View: 757


Methodologies for Knowledge Based Software Engineering

... for Program Synthesis 2.1 Constructive Theorem Proving Soon after Robinson
( 27 ) developed resolution as the first practical means for automated theorem
proving in predicate logic , it was applied to automatic program synthesis .

Author:

Publisher:

ISBN:

Category:

Page: 17

View: 292


Principles of Automated Theorem Proving

An overview of ATP techniques for the non-specialist, it discusses all the main approaches to proof: resolution, natural deduction, sequentzen, and the connection calculi.

Author: David A. Duffy

Publisher: John Wiley & Sons Incorporated

ISBN:

Category: Computers

Page: 243

View: 421

An overview of ATP techniques for the non-specialist, it discusses all the main approaches to proof: resolution, natural deduction, sequentzen, and the connection calculi. Also discusses strategies for their application and three major implemented systems. Looks in detail at the new field of ``inductionless induction'' and brings out its relationship to the classical approach to proof by induction.

Mathematical Structures for Software Engineering

Based on the Proceedings of a Conference Organized by the Systems and
Software Engineering Specialist Group of the Institute of ... 2 Automating the
Method The problem of automating a tableau proof is that , at any point in the
development of the tableau , there are ... The frame rule adopted by the theorem
prover says that , apart from action postconditions , axioms and deontic structure ,
all other ...

Author: Bernard De Neumann

Publisher: Oxford University Press

ISBN:

Category: Science

Page: 355

View: 602

This volume is concerned with the application of formal mathematical methods in software engineering. As the design, writing and testing of software becomes a major sector of economic activity, the need for rigorous techniques has also grown. The papers in this book are devoted to various mathematical structures which find use in aspects of software design, and they cover topics such as the formal specification of systems, the design of communications software, and concurrent processing. All the contributors are experts in their respective fields. As a result, this collection provides a timely survey of this rapidly growing area. Software engineers and computer scientists will find this work to be an invaluable reference source. Mathematicians will appreciate the discussions of the contribution that their discipline can make and the interesting challenges for the future.

Software Engineering ESEC

The possibility to examine the development tree during the development proved
most valuable . ... representation techniques and process modeling in classical
software engineering , program synthesis and automated theorem proving .

Author:

Publisher:

ISBN:

Category: Software engineering

Page:

View: 915


1995 7th International Workshop on Computer Aided Software Engineering

the Second Workshop on Software Testing, Verification and Analysis, Lee J.
White, Ed. July 19– 21 1988, pp. ... logic”, in Current Trends in Hardware
Verification and Automated Theorem Proving (Proceedings of the Workshop on
Hardware ...

Author: Hausi A. Müller

Publisher: IEEE Computer Society

ISBN:

Category: Computer-aided software engineering

Page: 405

View: 899

Presents a broad perspective of the technical issues facing the CASE field. Session topics include CASE adoption, tool integration strategies, software reuse, frameworks and environments, meta-CASE environments, domain modeling, software evolution, tool practice, and CASE support for requirements en

Automated Theorem proving in Non classical Logics

Shimada 74 Shimada , K . A Theorem - Prover for Intuitionistic Propositional
Logic ' , Journal of Tsuda College 6 : 39 - 44 , 1974 . ... ACM Software
Engineering Notes 1980 . ... Proceedings of the 6th Conference on Automated
Deduction .

Author: Paul B. Thistlewaite

Publisher: Pitman Publishing

ISBN:

Category: Automatic theorem proving

Page: 154

View: 899


Proceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering

Author:

Publisher:

ISBN:

Category: Computer software

Page:

View: 476


Proceedings of the 11th Knowledge based Software Engineering Conference

Another approach, adapted from software engineering methodology, is to have
the user state the properties desired of the behavior as a formal specification, and
then use automatic or semi-automatic theorem proving to show that the acquired
 ...

Author: IEEE Computer Society

Publisher: IEEE Computer Society

ISBN:

Category: Computers

Page: 155

View: 126

Presents papers from the September 1996 conference discussing the application of automated reasoning, knowledge representation, and other artificial intelligence techniques to software engineering problems, with emphasis on constructing and working with software artifacts and processes using knowledge-based techniques. Coverage includes synthesis, verification and validation, knowledge-based environments, and reverse engineering, with papers on areas including applying plan recognition algorithms to program understanding, and synthesis of local search algorithms by algebraic means. No index. Annotation copyrighted by Book News, Inc., Portland, OR.