Results 1  10
of
189
Hybrid theorem proving of aerospace systems: Applications and challenges
 Journal of Aerospace Information Systems
"... Complex software systems are becoming increasingly prevalent in aerospace applications, in particular to accomplish critical tasks. Ensuring the safety of these systems is crucial, while they can have subtly different behavior under slight variations in operating conditions. In this paper we advoca ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
advocate the use of formal verification techniques and in particular theorem proving for hybrid softwareintensive systems as a wellfounded complementary approach to the classical aerospace verification and validation techniques such as testing or simulation. As an illustration of these techniques, we
Adaptive Parallel Search for Theorem Proving
"... Many of the artificial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the size of these spaces and the corresponding computational effort reduce the applicability of otherwise novel and effective algorithms. Because automated theorem provers ..."
Abstract
 Add to MetaCart
solving and planning, parallelizing theorem proving systems introduces several new challenges. We inv~tigate the application of the EUREKA system to a parallel version of the OTTER theorem prover and show results from a subset of TPTP library problems.
Proof Exchange for Theorem Proving — Second
, 2012
"... Proceedings Edited by David Pichardie and Tjark WeberCopyright c ○ 2012 for the individual papers by the papers ’ authors. Copying permitted for private and academic purposes. This volume is published and copyrighted by its editors. Preface The goal of the PxTP workshop series is to bring together r ..."
Abstract
 Add to MetaCart
researchers working on proof production from automated theorem provers with potential consumers of proofs. Machinecheckable proofs have been proposed for applications like proofcarrying code and certified compilation, as well as for exchanging knowledge between different automated reasoning systems
Dependent Types, Theorem Proving, and Applications for a Verifying Compiler
, 2005
"... One approach to Prof. Hoare’s challenge is to view the development of verified software from the perspective of interactive theorem provers. This idea is already commonly developed and many mediumscale software systems have been developed and verified in this manner. Developments based on HOL, ACL2 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
One approach to Prof. Hoare’s challenge is to view the development of verified software from the perspective of interactive theorem provers. This idea is already commonly developed and many mediumscale software systems have been developed and verified in this manner. Developments based on HOL, ACL
Automated Deduction by Theory Resolution
 Journal of Automated Reasoning
, 1985
"... Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theoremproving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can greatly reduce the length of proofs and the size of the search space. Theory resoluti ..."
Abstract

Cited by 132 (1 self)
 Add to MetaCart
Theory resolution constitutes a set of complete procedures for incorporating theories into a resolution theoremproving program, thereby making it unnecessary to resolve directly upon axioms of the theory. This can greatly reduce the length of proofs and the size of the search space. Theory
Pervasive Parallelism in HighlyTrustable Interactive Theorem Proving Systems
"... Interactive theorem proving is a technology of fundamental importance for mathematics and computerscience. It is based on expressive logical foundations and implemented in a highly trustable way. Applications include huge mathematical proofs and semiautomated verifications of complex software sys ..."
Abstract
 Add to MetaCart
Interactive theorem proving is a technology of fundamental importance for mathematics and computerscience. It is based on expressive logical foundations and implemented in a highly trustable way. Applications include huge mathematical proofs and semiautomated verifications of complex software
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
technical challenge in the security reduction which mist now simulate multiple interacting HIBE systems at once. Solving this problem was the crucial step that gave us a hierarchy without destroying anonymity. Building a "flat" anonymous IBE system turns out to be reasonably straightforward using
PxTP 2011: First International Workshop on Proof eXchange for Theorem Proving
, 2011
"... The main objective of this workshop is to stimulate the research on proof production and exchange in the field of computer aided deduction. Machinecheckable proofs have been proposed for applications like proofcarrying code and certified compilation, as well as for exchanging knowledge between dif ..."
Abstract
 Add to MetaCart
different automated reasoning systems. For example, interactive theorem provers can import results from otherwise untrusted highperformance solvers, by means of proofs the solvers produce. In such situations, one automated reasoning tool can make use of the results of another, without having to trust
Applications and challenges in satisfiability modulo theories
 In Workshop on Invariant Generation (WING
, 2011
"... The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A wellrecognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing s ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
states and transformations between system states. One can thus say that symbolic logic is the calculus of computation. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving
Proving AssociativeCommutative Termination Using RPOcompatible Orderings
 in Proc. Automated Deduction in Classical and NonClassical Logics, LNAI 1761
, 2000
"... Developing path orderings for associativecommutative (AC) rewrite systems has been quite a challenge at least for a decade. Compatibility with the recursive path ordering (RPO) schemes is desirable, and this property helps in orienting the commonly encountered distributivity axiom as desired. For a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
. For applications in theorem proving and constraint solving, a total ordering on ground terms involving AC operators is often required. It is shown how the main solutions proposed so far ([7],[13]) with the desired properties can be viewed as arising from a common framework. A general scheme that works for non
Results 1  10
of
189