A case study on automation of verification logics

Reiner Dojen, Tom Coffey

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Formal logics are increasingly used to verify correctness of theories and designs in engineering. However, the process of logic-based verification is complex, tedious and prone to error. This is a serious issue, as a single mistake can render the result of the verification useless. Automated techniques reduce the potential for human errors during verification. This paper presents the theoretical concept of Layered Proving Trees, for the automation of logic-based verification. Verification tools based on Layered Proving Trees result in comparatively simple - but powerful - systems. Empirical result on the performance of a prototype implementation of a layered proving trees verification tool are presented.

Original languageEnglish
Title of host publicationINES'05
Subtitle of host publicationIEEE 9th International Conference on Intelligent Engineering Systems - Proceedings
PublisherIEEE Computer Society
Pages139-144
Number of pages6
ISBN (Print)0780394747, 9780780394742
DOIs
Publication statusPublished - 2005
EventINES'05: IEEE 9th International Conference on Intelligent Engineering Systems -
Duration: 16 Sep 200519 Sep 2005

Publication series

NameINES'05: IEEE 9th International Conference on Intelligent Engineering Systems - Proceedings
Volume2005

Conference

ConferenceINES'05: IEEE 9th International Conference on Intelligent Engineering Systems
Period16/09/0519/09/05

Fingerprint

Dive into the research topics of 'A case study on automation of verification logics'. Together they form a unique fingerprint.

Cite this