[图书][B] Automated theorem proving in software engineering
JM Schumann - 2013 - books.google.com
This book can mark the coming of age of automated theorem proving (ATP). The process to
maturity has been a continuum, as it is for humans, but this book serves to mark the …
maturity has been a continuum, as it is for humans, but this book serves to mark the …
Higher-order semantics and extensionality
C Benzmüller, CE Brown, M Kohlhase - The Journal of Symbolic …, 2004 - cambridge.org
In this paper we re-examine the semantics of classical higher-order logic with the purpose of
clarifying the role of extensionality. To reach this goal, we distinguish nine classes of higher …
clarifying the role of extensionality. To reach this goal, we distinguish nine classes of higher …
Proof-assistants using dependent type systems
H Barendregt, H Geuvers - Handbook of automated reasoning, 2001 - dl.acm.org
Proof-assistants using dependent type systems | Handbook of automated reasoning ACM
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …
Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in …
Inference and computational semantics
In this paper we discuss inference in computational semantics. In particular, we argue that
state-of-the-art methods in first-order theorem proving and model generation are of direct …
state-of-the-art methods in first-order theorem proving and model generation are of direct …
On first-order model-based reasoning
MP Bonacina, U Furbach… - Logic, Rewriting, and …, 2015 - Springer
Abstract Reasoning semantically in first-order logic is notoriously a challenge. This paper
surveys a selection of semantically-guided or model-based methods that aim at meeting …
surveys a selection of semantically-guided or model-based methods that aim at meeting …
Minlog-a tool for program extraction supporting algebras and coalgebras
U Berger, K Miyamoto, H Schwichtenberg… - Algebra and Coalgebra …, 2011 - Springer
Minlog is an interactive system which implements proof-theoretic methods and applies them
to verification and program extraction. We give an overview of Minlog and demonstrate how …
to verification and program extraction. We give an overview of Minlog and demonstrate how …
Nonmonotonic reasoning: Towards efficient calculi and implementations
Nonmonotonic reasoning | Handbook of automated reasoning skip to main content ACM Digital
Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register …
Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register …
Resolution in modal, description and hybrid logic
We provide a resolution‐based proof procedure for modal, description and hybrid logic that
improves on previous proposals in important ways. It avoids translations into large …
improves on previous proposals in important ways. It avoids translations into large …
A taxonomy of theorem-proving strategies
MP Bonacina - Artificial Intelligence Today: Recent Trends and …, 2001 - Springer
This article presents a taxonomy of strategies for fully-automated general-purpose first-order
theorem proving. It covers forward-reasoning ordering-based strategies and backward …
theorem proving. It covers forward-reasoning ordering-based strategies and backward …
Using automated theorem provers to certify auto-generated aerospace software
E Denney, B Fischer, J Schumann - International Joint Conference on …, 2004 - Springer
We describe a system for the automated certification of safety properties of NASA software.
The system uses Hoare-style program verification technology to generate proof obligations …
The system uses Hoare-style program verification technology to generate proof obligations …