69 research outputs found
Superposition with simplification as a decision procedure for the monadic class with equality
We show that strict superposition, a restricted form of paramodulation, can be combined with specifically designed simplification rules such that it becomes a decision procedure for the monadic class with equality. The completeness of the method follows from a general notion of redundancy for clauses and superposition inferences
Hyperresolution for guarded formulae
AbstractThis paper investigates the use of hyperresolution as a decision procedure and model builder for guarded formulae. In general, hyperresolution is not a decision procedure for the entire guarded fragment. However we show that there are natural fragments of the guarded fragment which can be decided by hyperresolution. In particular, we prove decidability of hyperresolution with or without splitting for the fragment GF1− and point out several ways of extending this fragment without losing decidability. As hyperresolution is closely related to various tableaux methods the present work is also relevant for tableaux methods. We compare our approach to hypertableaux, and mention the relationship to other clausal classes which are decidable by hyperresolution
Superposition for Lambda-Free Higher-Order Logic
We introduce refutationally complete superposition calculi for intentional and extensional clausal -free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a term order that need not be fully monotonic, making it possible to employ the -free higher-order lexicographic path and Knuth-Bendix orders. We implemented the calculi in the Zipperposition prover and evaluated them on Isabelle/HOL and TPTP benchmarks. They appear promising as a stepping stone towards complete, highly efficient automatic theorem provers for full higher-order logic
Strategies for conformance testing
A new test generation method and algorithm for conformance testing is proposed. It is based on the interpretation of testing concepts from the ISO standard ``Formal methods in conformance testing'' in a game theory setting. A testing game is defined with a specification given as an Input/Output State Machine and a test purpose for test selection. A winning strategy for this game define a tester for a class of implementations and a conformance relation. \begin{keywords} formal methods in conformance testing, test purposes, games strategies, test assumptions, input-output state machines. \end{keywords
05431 Abstracts Collection -- Deduction and Applications
From 23.10.05 to 28.10.05, the Dagstuhl Seminar 05431 ``Deduction and Applications\u27\u27 was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Deduction with XOR Constraints in Security API Modelling
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is the API of the IBM 4758 hardware security module. We also show how our technique can be applied to standard security protocols
- …