This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
Modelling and Analysis of Security Protocols - Ryan, Zakiuddin (2001)(Correct)
We outline the aims and principle results of a research programme aimed at developing tools and
techniques for the analysis and design of security protocols. The aim was to move away from specially
ta... / B-method Action Systems and theorem proving using PVS are also br part of the project the use of theorem proving supported by PVS was also
Object-Oriented First-Order Logic - Amir (2001)(Correct)
First-Order Logic (FOL) provides richness of representation,
but is unwieldy in modeling large, complex
tasks. On the other hand, the Object-Oriented
paradigm has been successful in treating large, co... / are then incorporated into the theorem-proving process of the receiving br Prolog while FOL has no theorem proving ow that one can generalize
Matrix-based Inductive Theorem Proving - Kreitz, Pientka (2000)(Correct)
We present an approach to inductive theorem proving that
combines rippling-based rewriting and matrix-based logical proof search.
The selection of appropriate connections for the matrix proof is gui... / Matrix-based Inductive Theorem Proving Christoph Kreitz br an approach to inductive theorem proving that combines rippling-based
An Overview of the Tatami Project - Goguen, Lin, Rosu, Mori, Warinschi (2000)(Correct)
This paper describes the Tatami project at UCSD, which is developing a system
to support distributed cooperative software development over the web, and in particular, the
validation of concurrent di... / of proofs produced by mechanical theorem provers. In order to improve this br manipulation interfaces for theorem proving systems is actually
The Calculus of Constructions as a Framework for Proof Search with.. - Felty (2000)(Correct)
We show how a procedure developed by Bledsoe for automatically finding substitution
instances for set variables in higher-order logic can be adapted to provide increased automation
in proof search in ... / of interactive tactic-style theorem provers. For example both HOL br in which to study how theorem proving techniques designed for one
Using a Coordination Language to Specify and Analyze Systems.. - Ciancarini, Franzè, Mascolo (2000)(Correct)
Syntax.
in the rule (speci ed in the where clause). The Client space terminates as soon
as it receives the 10-th answer. The termination rule END checks if the Client
space contains the tuple (\idle"... / can be supported by either theorem proving Ciancarini et al. or br the basic PoliS semantics and a theorem prover for predicates based on
Fast Tactic-based Theorem Proving - Hickey, Nogin (2000)(Correct)
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose meta-language to implement both general-purpose reasoning and computational... / Fast Tactic-based Theorem Proving Jason Hickey and Alexey br Cornell University Abstract. Theorem provers for higher-order logics
Bellman Equations for Stochastic Programs - McAllester (2000)(Correct)
This paper gives a model-checking style algorithm for verifying
the decision-theoretic utility of a hand-written robot controller.
The paper presents a simple Turing-complete programming language ... / with worldaxiomatizing and theorem-proving. The situation calculus br M. Y. Vardi. Model checking vs. theorem proving -a manifesto. In V.
VSE: Formal Methods Meet Industrial Needs - Autexier, Hutter, Langenstein.. (2000)(Correct)
The Verification Support Environment (VSE) is a
tool to formally specify and verify complex systems. It provides
means to structure specifications and supports the development
process from the speci... / Development -Automated Theorem Proving -Interactive Theorem br Theorem Proving -Interactive Theorem Proving -Temporal Logic -Modular
CASL: From Semantics to Tools - Mossakowski (2000)(Correct)
CASL, the common algebraic specification language, has been
developed as a language that subsumes many previous algebraic specification
frameworks and also provides tool interoperability. CASL is ... / conversion to LaTeX and theorem proving for CASL specifications. To br which are implemented by theorem-proving tools Formatted
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving.. - Aagaard, Melham, O'Leary (2000)(Correct)
This paper describes a semantic connection between the symbolic trajectory
evaluation model-checking algorithm and relational veri cation in higher-order
logic. We prove a theorem that translates corr... / Evaluation Booleans are for Theorem Proving Extended Version Mark D. br Evaluation Booleans are for Theorem Proving'in Correct Hardware Design
The Search for Satisfaction - Gent, Walsh (1999)(Correct)
In recent years, there has been an explosion of research in AI into propositional
satisfiability (or Sat). There are many factors behind the increased
interest in this area. One factor is the improv... / is closely related to theorem proving refutation procedures for br term rewriting and resolution theorem proving. Zhang and Stickel have
The TPTP Problem Library - Christian B. Suttner, Geoff Sutcliffe (1999)(Correct)
This report provides a detailed description of the TPTP Problem Library for automated
theorem proving systems. The library is available via Internet, and forms
a common basis for development of and ex... / Problem Library for automated theorem proving systems. The library is br experimentation with automated theorem provers. This report provides
Learning from previous proof experience: a survey - Denzinger, Fuchs, Goller, Schulz (1999)(Correct)
We present an overview of various learning techniques used in automated theorem provers. We characterize the main problems arising in this context and classify the solutions to these problems from pub... / techniques used in automated theorem provers. We characterize the main br for different approaches to theorem proving and place these combinations
Flow Analysis for Verifying Specifications of Concurrent and.. - Dwyer, Clarke (1999)(Correct)
This paper presents FLAVERS, a finite state verification approach that analyzes whether concurrent or
sequential programs satisfy user-defined correctness properties. In contrast to other finite-state... / using the full power of theorem proving and instead reasons over a br are usually not as powerful as theorem proving techniques but can prove a
From Implicit Skills to Explicit Knowledge: A Bottom-Up Model of.. - Sun, Merrill, Peterson (1999)(Correct)
This paper presents a skill learning model Clarion. Di erent from existing models of mostly high-level
skill learning that use a top-down approach (that is, turning declarative knowledge into procedur... / from arithmetic to geometric theorem proving to account for changes br example in skill learning of theorem proving text editing LISP
Principles and a Preliminary Design for ML2000 - Group (1999)(Correct)
We describe the methodology and current features for ML2000, a new-generation design of ML. ML2000 adds
a number of features to Standard ML and Caml, providing better support for extensibility and cod... / with ML's roots in interactive theorem proving. ML is meant to be a
Theory Generation for Security Protocols - Kindred, Wing (1999)(Correct)
We introduce theory generation, a new general-purpose technique for performing automated verification.
Theory generation draws inspiration from, and complements, both automated theorem proving
and sym... / and complements both automated theorem proving and symbolic model checking br is essentially a special-purpose theorem prover. It is fast and automatic
A Reduction for Automated Verification of Authentication Protocols - Stoller (1999)(Correct)
Authentication protocols (including protocols that provide key establishment) are designed
to work correctly in the presence of an adversary that can (1) perform an unbounded number
of encryptions and... / verification of such protocols. Theorem proving requires considerable
Social and Semiotic Analyses for Theorem Prover User Interface Design - Goguen (1999)(Correct)
We describe an approach to user interface design based on ideas from cognitive science, social
science, especially the theory of stories, and a new area tentatively called algebraic semiotics. Socia... / and Semiotic Analyses for Theorem Prover User Interface Design br for a distributed cooperative theorem proving system whose main component
Induction = I-Axiomatization + First-Order Consistency - Comon, Nieuwenhuis (1999)(Correct)
In the early 80's, there was a number of papers on what should be called
proofs by consistency. They describe how to perform inductive proofs, without
using an explicit induction scheme, in the conte... / be performed by a first-order theorem prover. Moreover we extend br a semi-automatic inductive theorem prover to provide explicit
A Higher-Order Interpretation of Deductive Tableau - Ayari, Basin (1999)(Correct)
this paper may
be found at http://www.informatik.uni-freiburg.de/¸ayari/dedtableau/. All system ouput
given here is taken directly from an Isabelle session, with the exception of minor cosmetic
adjust... / Tableau system in standard theorem provers that support the kinds of br Tableau using generic theorem proving environments. This is no mere
Proof-assistants using Dependent Type Systems - Barendregt, Geuvers (1999)(Correct)
Science and technology depend on true statements. Most of these are obtained via reasoning
from experimental data using mathematics (models). Therefore the notion of proof
that warrants correctness ... / combination is dierent form a theorem prover'This is a computer system br style For machine assisted theorem proving via automated theorem
Graph Transformation Units with Interleaving Semantics - Kreowski, Kuske (1999)(Correct)
The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from sma... / algebraic specification theorem proving and rule-based systems.
Mechanized Operational Semantics via (Co)Induction - Simon J. Ambler, Roy L. Crole (1999)(Correct)
We give a fully automated description of a small programming language in the
theorem prover Isabelle-98. The language syntax and semantics are encoded, and
we formally verify a range of semantic prope... / programming language in the theorem prover Isabelle- . The language br automated deduction tactical theorem proving Isabelle operational
Dependent types with subtyping and late-bound overloading - Castagna (1999)(Correct)
We present a calculus with dependent types, subtyping and late-bound overloading. Besides its theoretical
interest this work is motivated by several practical needs that range from the definition of l... / overloading is quite felt in theorem proving and their absence makes br languages and the technology of theorem provers. In that perspective it will
Graph Transformation Units And Modules - Kreowski, Kuske (1999)(Correct)
The significance of graphs and rules in many areas of computer science is evident: On the one hand, graphs constitute appropriate means for the description of complex relationships between objects. Tr... / algebraic specification theorem proving and rule-based systems.
Implementing Extensible Theorem Provers - Fisler, Krishnamurthi, Gray (1999)(Correct)
The growing application of theorem proving techniques has
increased the need for customized theorem provers. Powerful provers contain
numerous interacting subsystems, each of which requires substant... / Implementing Extensible Theorem Provers Kathi Fisler Shriram br The growing application of theorem proving techniques has increased the
A Verification Environment for I/O Automata - Part II: Theorem.. - Müller (1999)(Correct)
We describe a verification framework for I/O automata in Isabelle. It includes a temporal
logic, proof support for showing implementation relations between live I/O automata,
and a combination of Isab... / for I O Automata Part II Theorem Proving and Model Checking -Olaf br for I O Automata Part II Theorem Proving and Model Checking -Olaf
A HOL Conversion for Translating Linear Time Temporal Logic to.. - Schneider, Hoffmann (1999)(Correct)
We present an embedding of linear time temporal logic LTL in HOL together with an elegant translation of LTL formulas into equivalent #-automata. The translation is completely implemented by HOL rules... / decision procedures in the HOL theorem prover. On the other hand the br this reason we need interactive theorem provers such as HOL for the
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style.. - Kreitz, Schmitt (1999)(Correct)
We present a uniform algorithm which transforms machine-found matrix
proofs in classical, constructive, and modal logics into sequent proofs. It is
based on unified representations of matrix charact... / In classical predicate logic theorem provers based on resolution br in order to develop a coherent theorem prover which can deal with a variety
Logic-Based Subsumption Architecture - Amir, Maynard-Reid, II (1999)(Correct)
In this paper we describe a logic-based AI architecture
based on Brooks' Subsumption Architecture. We axiomatize
each of the layers of control in his system separately
and use independent theorem prov... / separately and use independent theorem provers to derive each layer's br is supplied with a separate theorem prover allowing the system of
A Meta-notation for Protocol Analysis - Cervesato, Durgin, Lincoln.. (1999)(Correct)
Most formal approaches to security protocol analysis are
based on a set of assumptions commonly referred to as the
"Dolev-Yao model." In this paper, we use a multiset rewriting
formalism, based on lin... / assumptions are used in theorem proving modelchecking methods br search-based analysis and theorem-proving analysis of protocols.
Higher-Order Pattern Complement and Strict Lambda-Calculus - Alberto Momigliano, Frank Pfenning (1999)(Correct)
We address the problem of complementing higher-order linear
patterns, i.e. without repetitions of free variables. Differently from
the first-order case, the complement of a pattern cannot, in genera... / machine learning and inductive theorem proving. In logic programming Kunen br and Frank Pfenning. Automated theorem proving in a simple meta-logic for
Parametric Shape Analysis via 3-Valued Logic - Sagiv, Reps, Wilhelm (1999)(Correct)
We present a family of abstract-interpretation algorithms that are capable of determining "shape invariants" of programs that perform destructive updating on dynamically allocated storage. The main id... / Logic-mechanical theorem proving General Terms Algorithms
Towards a Mechanically Checked Theory of Computation: A Progress.. - Moore (1999)(Correct)
Formal mathematical logic is ideally suited to describing computational processes. We discuss the use of
a mechanized mathematical logic, namely ACL2 (A Computational Logic for Applicative Common Lisp... / program called the Pure Lisp Theorem Prover capable of br decade to become the Boyer-Moore theorem prover NQTHM Then Matt
Group-Invariant Percolation on Graphs - Benjamini, Lyons, Peres, Schramm (1999)(Correct)
Let G be a closed group of automorphisms of a graph X . We
relate geometric properties of G and X , such as amenability and unimodularity,
to properties of G-invariant percolation processes on X , s... / constant. The key tool in proving Theorem . and many other results br used this technique in order to prove Theorem . for trees X he showed
Unifying SAT-based and Graph-based Planning - Kautz, Selman (1999)(Correct)
The Blackbox planning system unifies the planning
as satisfiability framework (Kautz and Selman
1992, 1996) with the plan graph approach to
STRIPS planning (Blum and Furst 1995). We show
that STRIPS p... / early attempts to use general theorem provers to solve planning problems br described as a way to make theorem-proving practical. In other work the
A Verification Environment for I/O Automata - Part I: Temporal Logic.. - Müller (1999)(Correct)
ion --
Olaf M uller
ABCDE
FGHIJ
KLMNO
TUM-I9911
Juni 99
T E C H N I S C H E U N I V E R S I T
A T M
U N C H E N
TUM-INFO-06-I9911-50/1.-FI
Alle Rechte vorbehalten
Nachdruck auch auszugsweise verb... / The intention is to combine theorem proving and model checking. Verifying br proof obligations remain for theorem proving. Furthermore a methodology
PSPACE has constant-round quantum interactive proof systems - Watrous (1999)(Correct)
In this paper we introduce quantum interactive proof
systems, which are interactive proof systems in which the
prover and verifier may perform quantum computations and
exchange quantum messages. It is... / informally our technique for proving Theorem which is essentially to br circuit model. In Section we prove Theorem by presenting a -message
Single-Threaded Objects in ACL2 - Robert S. Boyer, J. Strother Moore (1999)(Correct)
ACL2 is a first-order applicative programming language based on Common
Lisp. It is also a mathematical logic for which a mechanical theoremprover
has been implemented in the style of the Boyer-Moore t... / logic for which a mechanical theoremprover has been implemented in the br in the style of the Boyer-Moore theorem prover. The ACL system is used
Higher-Order Colored Unification: A Linguistic Application - Gardent, Kohlhase, Konrad (1999)(Correct)
During the last decade, Higher-Order Unification (HOU) has become a popular
tool for constructing the semantic representation of natural language expressions. But there
is a well-known problem with ... / components. In the field of theorem proving with mathematical induction br the proof search of inductive theorem provers and is as such an off-the
Tractable Transformations from Modal Provability Logics into.. - Demri, Goré (1999)(Correct)
We define a class of modal logics LF by uniformly extending
a class of modal logics L. Each logic L is characterised by a class
of first-order definable frames, but the corresponding logic LF is som... / first-order classical logic. Theorem provers for classical first-order br two main approaches to modal theorem proving in the literature. The
Computer Aided Serendipity: The Role of Autonomous Assistants in.. - Arvo (1999)(Correct)
Pencil and paper are perhaps the most effective problemsolving
tools ever invented. Why is this so, and what
does this portend for computer-assisted problem solving
? In this paper we investigate why ... / algebra mechanical theorem proving and computer-aided br computer algebra systems and theorem provers and thereby synthesize
A methodology for hardware verification using compositional model.. - McMillan (1999)(Correct)
A methodology for system-level hardware verification based on compositional model checking
is described. This methodology relies on a simple set of proof techniques, and a domain specific
strategy f... / that this gap will close. Theorem proving methods on the other hand br into the framework of a theorem prover Sha However integration
First-Order Polynomial Based Theorem Proving - Wu (1999)(Correct)
Introduction
The Boolean ring or first-order polynomial based theorem proving began
with the work of Hsiang (1982, 1985). Hsiang extended the idea of using Boolean
polynomials to represent propositio... / First-Order Polynomial Based Theorem Proving Jinzhao Wu This Chapter br on first-order polynomial based theorem proving. We present the notion of
An algorithmic approach to knowledge evolution - Lomuscio, Ryan (1999)(Correct)
Intelligent agents must update their knowledge base as they acquire new information about
their environment. The modal logic S5
n
has been designed for representing knowledge bases
in societies of a... / checking as an alternative to theorem proving Halpern and Vardi In br much easier than the theorem proving task being linear in the
Generating and Model Checking a Hierarchy of Abstract Models - Hazelhurst (1999)(Correct)
The use of automatic model checking algorithms to verify detailed gate or switch level designs of circuits is very attractive because the method is automatic and such models can accurately capture det... / often combined with the use of theorem proving This br and C.J.H. Seger. A Simple Theorem Prover Based on Symbolic Trajectory
A Unified View of Programming Schemas and Proof Methods - Flener, Richardson (1999)(Correct)
this paper.
References unknown A Unified View of Programming Schemas and Proof Methods
Pierre Flener
Computer Science Division
Department of Information Science
Uppsala University
S-751 05 Uppsala, S... / the plan-guided automated theorem prover. At the same time this br will first revisit plan-guided theorem proving in Section and then
CoFI WG 29432 - Interim report 1 October 1998 - 30 September 1999 - Sannella (1999)(Correct)
The goals of are CoFI WG are: to coordinate the completion of
and disseminate the Common Framework; to demonstrate its practical
applicability in industrial contexts; and to establish the infrastruc... / integrated specification and theorem proving environments for sublanguages br of Casl specifications and theorem proving via an encoding into the
Proofs by Program Transformations - Roychoudhury, Kumar, Ramakrishnan.. (1999)(Correct)
this paper, we examine how unfolding, folding and goal replacement transformations can be used
towards automating the construction of such induction proofs. In [20] we proposed an abstract unfold/fold... / chaining to perform inductive theorem proving. This limited forward br M. Srivas. Automatic inductive theorem proving using Prolog. Theoretical
Implementing Escher on a Graph Reduction Machine - Eder (1999)(Correct)
Escher is a functional logic programming language which is based on
a rewriting computational model with residuation. Similar to purely functional
languages, computation is regarded as the successiv... / Instead of the typical theorem proving computational model with
Symbolic Model Checking without BDDs - Biere, Cimatti, Clarke, Zhu (1999)(Correct)
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of
reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system.
In thi... / verification techniques e.g. theorem proving model checking is largely
Model Generation for Natural-Language Semantic Analysis - Karsten Konrad (1999)(Correct)
Semantic analysis refers to the analysis of semantic representations
by inference on the basis of semantic information and world
knowledge. I present some potential applications of model generators ... / generators and model generation theorem provers in the construction and br generators and model generation theorem provers in the construction and
Analysis of the Internet Key Exchange Protocol Using the NRL Protocol .. - Meadows (1999)(Correct)
In this paper we show how the NRL Protocol Analyzer,
a special-purpose formal methods tool designed
for the verification of cryptographic protocols, was used
in the analysis of the Internet Key Exchan... / of state exploration and theorem proving techniques was used to the br language improvements to the theorem prover and improvements to the
Definites and the Proper Treatment of Rabbits - Claire Gardent, Karsten Konrad (1999)(Correct)
We argue that model generation programs, i.e., deduction systems
that automatically compute the interpretations satisfying a given formula,
can provide a procedural interpretation for semantic theorie... / be interpreted. In automated theorem proving on the other hand model br Whereas conventional theorem proving traditionally focuses on
Towards the Formal Verification of Ciphers: Logical Cryptanalysis of.. - Massacci, Marraro (1999)(Correct)
Providing formal assurance of correctness is a
key issue for cryptographic algorithms. Yet, automated
reasoning tools have only been used
for the verification of security protocols, and
almost nev... / and then use automated theorem proving for reasoning about them. We br given its notable results with theorem proving Paulson and model
Processor Verification Using Efficient Reductions of the Logic of.. - Bryant, German, Velev (1999)(Correct)
The logic of equality with uninterpreted functions (EUF) provides a means of abstracting the manipulation
of data by a processor when verifying the correctness of its control logic. By reducing
formul... / for this logic based on theorem proving search methods. Their br decision procedures based on theorem proving search methods especially
Single-Threaded Formal Processor Models: Enabling Proof and.. - Hardin, Greve, Wilding, Cowles (1999)(Correct)
Formal verification can be integrated into conventional computer
system development by reasoning directly about system simulators.
However, such simulators must be extremely fast to be usable in a
r... / in principle be used with any theorem prover. We describe an instantiation br verification projects have used theorem provers to analyze computer system
Agent Based Mathematical Reasoning - Benzmüller, Jamnik, Kerber, Sorge (1999)(Correct)
In this contribution we propose an agent architecture for theorem proving which we
intend to investigate in depth in the future. The work reported in this paper is in
an early state, and by no means f... / an agent architecture for theorem proving which we intend to br major approaches to automated theorem proving machineoriented methods
Relativized Relation Algebras - Marx (1999)(Correct)
Relativization is one of the central topics in the study of algebras of relations (i.e.
relation and cylindric algebras). Relativized representable relation algebras behave much
nicer than the origina... / In these sections we usually prove theorems which are stronger but not so br formulate. Arrow frames. In proving Theorem . we will frequently use
The Relative Complement Problem for Higher-Order Patterns - Momigliano, Pfenning (1999)(Correct)
We address the problem of complementing higher-order patterns without repetitions
of free variables. Differently from the first-order case, the complement of a pattern
cannot, in general, be described... / machine learning and inductive theorem proving. In logic programming Kunen br and Frank Pfenning. Automated theorem proving in a simple meta-logic for
The propositional formula checker HeerHugo - Groote (1999)(Correct)
HeerHugo is a propositional formula checker
1
, that determines whether a given formula is satisfiable
or not. Its name comes from the dutch railway station Heerhugowaard, as it was developed
to val... / in the area of automatic theorem proving. Introduction In br experience with the first order theorem prover otter led to the
Transposition Table Driven Work Scheduling in Distributed Search - Romein, Plaat, Bal, Schaeffer (1999)(Correct)
This paper introduces a new scheduling algorithm for parallel
single-agent search, transposition table driven work scheduling,
that places the transposition table at the heart of the parallel
work sch... / to pattern recognition from theorem proving to chess playing. For many br We know of one parallel theorem prover Murphi Stern Dill
A New Method for Consequence Finding and Compilation in Restricted.. - Val (1999)(Correct)
SFK (skip-filtered, kernel) resolution is a new method
for finding "interesting" consequences of a first order
clausal theory \Sigma, namely those in some restricted target
language LT . In its more r... / little attention in the theorem proving literature. However and as br are advantageous for theorem proving but this is not so clear
Mixed Initiative Dialogue and Intelligence via Active Logic - Andersen, Traum, Purang.. (1999)(Correct)
This paper describes features of the active logic formalism as a tool for implementing mixed initiative
intelligent systems. A framework is provided for assessing systems as "mixed-initiative", which ... / having to start up a new theorem-proving effort. An implementation of br of a largely traditional theorem prover except that updated
Microprocessor Verification Using Efficient Decision Procedures for a .. - Bryant, German, Velev (1999)(Correct)
Modern processors have relatively simple specificationsbased on their
instruction set architectures. Their implementations, however, are very complex,
especially with the advent of performance-enhan... / structure e.g.using automated theorem provers SB Our interest is in br for this logic based on theorem proving search methods. Their
A Dependently Typed Assembly Language - Xi, Harper (1999)(Correct)
We present a dependently typed assembly language (DTAL) in which the type system
supports the use of a restricted form of dependent types, reaping some benefits of dependent
types at assembly level. D... / checked by a VC generator and a theorem prover and code is certified by an br type int x This is where theorem proving constraint satisfaction
Using Decision Procedures to Accelerate Domain-Specific Deductive.. - Van Baalen, Roach (1999)(Correct)
This paper describes a class of decision procedures that we have found
useful for efficient, domain-specific deductive synthesis, and a method for integrating
this type of procedure into a general-p... / general-purpose refutation-based theorem prover. We suggest that this is a br to accelerate a general-purpose theorem prover doing deductive synthesis.
Analogy and Automated Reasoning - Jamnik (1999)(Correct)
We survey the state of the art in the use of analogy in automated reasoning. We are
particularly interested in the work of Melis and Whittle (1998). A detailed analysis of their
analogy mechanism is... / reasoning in particular theorem proving and proof planning it is br first attempt to use analogy in theorem proving systems dates back to Kling
Defining Open Software Architectures for Customized Remote Execution.. - Issarny, Saridakis (1999)(Correct)
Agent-based solutions promise to ameliorate Web services, by promoting
the modular construction of Web servers, relieving the network from transferring
useless data, supporting user mobility, etc. H... / such as model checking theorem proving and type checking br ed this function can rely on a theorem prover. MatchNonFunc C C
Structured Theory Development for a Mechanized Logic - Kaufmann, Moore (1999)(Correct)
Experience has shown that large or multi-user interactive proof efforts
can benefit significantly from structuring mechanisms, much like those
available in many modern programming languages. Such a me... / mechanisms for the ACL theorem prover encapsulation and books. br for ACL but also for other theorem-proving environments. Overview
Specification and Verification of Synchronous Hardware using - Lotos Ji He (1999)(Correct)
This paper investigates specification and verification of synchronous circuits
using DILL (Digital Logic in LOTOS). After an overview of the DILL approach,
the paper focuses on the characteristics o... / on hardware verification used theorem-proving. Although quite general br The trend is to combine theoremproving and model-based approaches so
Organizations in Action - Kamps (1999)(Correct)
This article presents a formal reconstruction of James D. Thompson's classic contribution to organization theory, Organizations in Action. The reconstruction explicates the underlying argumentation st... / are proved by the automated theorem prover Otter Organized Techniques br Organized Techniques for Theorem-proving and Effective Research
An Integration of Deductive Retrieval into Deductive Synthesis - Fischer, Whittle (1999)(Correct)
Deductive retrieval and deductive synthesis are two conceptually
closely related software development methods
which apply theorem proving techniques to support the construction
of correct programs. In... / methods which apply theorem proving techniques to support the br formal specification and uses a theorem prover to derive new programs from
High-Automation Proofs for Properties of Requirements Models - Di Vito (1999)(Correct)
We describe an approach and experimental
results in the application of mechanized theorem proving
to software requirements analysis. Serving as the
test article was the embedded controller for SAFER... / the application of mechanized theorem proving to software requirements br analysis we used the PVS theorem prover to explore the upper limits
Optimal seperation of Treelike and General Resolution - Ben-Sasson, Impagliazzo, Wigderson (1999)(Correct)
We present the best known separation between tree-like and general
resolution, improving on the recent exp(n
ffl
) separation of [BEGJ98].
This is done by constructing a natural family of contradi... / of resolution to automated theorem proving ATP let us recall the ATP br of these bounds to automated theorem proving section Definitions
From I/O Automata to Timed I/O Automata - A solution to the.. - Grobauer, Müller (1999)(Correct)
The model of timed I/O automata represents an extension of the model of I/O automata with the aim of reasoning about realtime systems. A number of case studies using timed I/O automata has been carrie... / I O automata is interactive theorem proving of course additional support br Research Foundation. the theorem prover Isabelle HOLCF It
The asymptotic determinant of the discrete Laplacian - Kenyon (1999)(Correct)
We compute the asymptotic determinant of the discrete Laplacian on a simply-connected rectilinear
region in R
2
. Specifically, for each ffl ? 0 let H ffl be the subgraph of fflZ
2
whose vertices ... / Part of the motivation for proving Theorem is to validate a certain br context. The techniques used to prove Theorem can be applied to the
Extensions of Constraint Solving for Proof Planning - Melis, Müller, Zimmer (1999)(Correct)
The integration of constraint solvers into proof planning has pushed the problem solving
horizon. Proof planning benefits from the general functionalities of a constraint solver such
as consistency ch... / Introduction In automated theorem proving and proof planning br for purely logical automated theorem proving. This situation was a reason
Merge Path Improvements for Minimal Model Hyper Tableaux - Peter Baumgartner, J.D. Horton.. (1999)(Correct)
We combine techniques originally developed for refutational first-order theorem
proving within the clause tree framework with techniques for minimal model
computation developed within the hyper tablea... / for refutational first-order theorem proving within the clause tree br is equivalent to automated theorem proving where one refutes the
Comparing Model Checking And Term Rewriting For The Verification Of.. - Schneider, Huhn (1999)(Correct)
There are two main streams for the verification of digital systems: Theorem
proving methods such as term rewriting are used for the verification of data oriented
systems, and model checking of tempo... / of digital systems Theorem proving methods such as term br dominated systems. While theorem proving is an inherently interactive
Model checking for nonmonotonic logics: algorithms and complexity - Rosati (1999)(Correct)
We study the complexity of model checking
in propositional nonmonotonic logics. Specifically,
we first define the problem of model
checking in such formalisms, based on the fact
that several nonmonoto... / of model checking over theorem proving do not seem to hold in the br Y. Vardi. Model checking vs. theorem proving A manifesto. In Proc. of
On Automating Inductive and Non-Inductive Termination Methods - Kamareddine, Monin (1999)(Correct)
The Coq and ProPre systems show the automated termination
of a recursive function by first constructing a tree associated with
the specification of the function which satisfies a notion of terminal ... / of recursive functions in a theorem proving framework. We choose the br issues not yet incorporated in theorem provers. References T.
Towards Light-Weight Verification and Heavy-Weight Testing - Pfab, Rueß, Owre, von Henke (1999)(Correct)
We give an overview on our approach to symbolic simulation
in the PVS theorem prover and demonstrate its usage in the realm of
validation by executing specification on incomplete data. In this way,
... / simulation in the PVS theorem prover and demonstrate its usage in br of symbolic simulation in a theorem proving environment is enhanced
Automated Reasoning for Computational Semantics - Blackburn, Bos, Kohlhase (1999)(Correct)
This paper discusses inference in computational
semantics. We argue that state-of-theart
methods in first-order theorem proving and
model building are of direct relevance to inference
for natural lan... / methods in first-order theorem proving and model building are br by the MathWeb society of theorem proving agents. Keywords
Lazy Infinite-State Analysis of Security Protocols - Basin (1999)(Correct)
Security protocols are used to exchange information in a
distributed system with the aim of providing security guarantees. We
present an approach to modeling security protocols using lazy data types... / cation requires interactive theorem proving which demands considerable br model checking and inductive theorem proving. References . R.
Paramodulation with Non-Monotonic Orderings - Bofill, Godoy, Nieuwenhuis, Rubio (1999)(Correct)
All current completeness results for ordered paramodulation require the term ordering
Ø to be well-founded, monotonic and total(izable) on ground terms. Here we
introduce a new proof technique where ... / lead to important results on theorem proving in first-order logic with br been applied to state-of-the-art theorem provers like Spass Wei results
Abstracting Cryptographic Protocols with Tree Automata - David (1999)(Correct)
ing Cryptographic Protocols with Tree
Automata #
David Monniaux
David.Monniaux@ens.fr
Laboratoire d'Informatique de l'
Ecole Normale Superieure +
& SRI International, Computer science laboratory ... / yield proofs of secrecy and theorem proving costly We propose a new br a protocol the other methods theorem proving model checking are based
Generic Compilation Schemes for Simple Programming Constructs - Dold, von Henke, Pfeifer, Rueß (1999)(Correct)
datatype Expr and an evaluation function eval ( 77 ) then define syntax and
semantics of expressions where the state (SState) is defined as a mapping from identifiers
to values.
77 % --- semantics of... / that has a reasonable amount of theorem proving capabilities. The PVS br Sampaio. A Comparative Study of Theorem Provers Proving Correctness of
Employing External Reasoners in Proof Planning - Melis, Sorge (1999)(Correct)
This paper describes a the integration of computer algebra systems
and constraint solvers into proof planners. It shows how efficient external
reasoners can be employed in proof planning and how the s... / Systems CAS into automated theorem provers has been a hot topic. br integration into automated theorem proving systems can be very difficult
On the Use of Formal Techniques for Analyzing Dependable Real-Time.. - Purnendu Sinha Neeraj (1999)(Correct)
The effective design of composite dependable and
real-time protocols entails demonstrating their proof of
correctness and, in practice, the efficient delivery of
services. We focus on these aspects of... / and for its comprehensive theorem proving environment. With this br the processor. The following theorem provides a sufficient condition
Critical Subgraphs of a Random Graph - Molloy, Reed (1999)(Correct)
We prove that the threshold for a random graph to have a k-core is equal to
the threshold for having a subgraph which meets a necessary condition of Gallai
for being k-critical.
1991 Mathematics Subje... / The main step towards proving Theorem . is the following the br tends to p k thus proving Theorem . . The reader who is
Experience with Predicate Abstraction - Das, Dill, Park (1999)(Correct)
ion
?
Satyaki Das
1
, David L. Dill
1
, and Seungjoon Park
2
1
Computer Systems Laboratory, Stanford University, Stanford, CA 94305
2
RIACS, NASA Ames Research Center, Moffett Field, CA 94035... / provides a means for combining theorem proving and model checking br of verifying a design using a theorem prover. This technique was
Mechanizing UNITY in Isabelle - Paulson (1999)(Correct)
ing with credit is permitted. To copy otherwise, to republish, to post on
servers, to redistribute to lists, or to use any component of this work in other works, requires prior
specific permission and... / of interactive and automatic theorem-proving. Much recent research br Eds.Higher Order Logic Theorem Proving and Its Applications LNCS
Transformation Systems at NASA Ames - Buntine, Fischer, Havelund, Lowry.. (1999)(Correct)
In this paper, we describe the experiences of the Automated
Software Engineering Group at the NASA Ames
Research Center in the development and application
of three different transformation systems. Th... / and submitted to an automatic theorem prover. The resulting program is br a purely deductive system the theorem prover is in charge. The proof
On the asymptotic geometry of abelian-by-cyclic groups - Farb, Mosher (1999)(Correct)
this paper gives a classification of all finitelypresented,
nonpolycyclic, abelian-by-cyclic groups up to quasi-isometry. It
is easy to see that any such group has a torsion-free subgroup of finite in... / follow the methods of MSW in proving Theorem . . Remark. The br key technical results used to prove Theorem . is the following theorem
Basic Completion with E-cycle Simplification - Lynch, Scharff (1999)(Correct)
We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-c... / . Introduction In automated theorem proving it is important to know if br So to retain completeness a theorem prover must either not simplify
A Pragmatic Approach to Extending Provers by Computer Algebra - with.. - Ballarin, Paulson (1999)(Correct)
The use of computer algebra is usually considered beneficial for mechanised
reasoning in mathematical domains. We present a case study, in the application domain
of coding theory, that supports this... / the reasoning power of the theorem prover. The unsoundness of computer br problem in interfacing them to theorem provers. Our approach to obtaining a
The Steam Boiler Controller Problem in Signal-Coq - Kerboeuf, Nowak, Talpin (1999)(Correct)
Among the various formalisms for the design of reactive systems, the Signal-Coq formal approach, i.e. the combined use of the synchronous dataflow language Signal and the proof assistant Coq, seems to... / directly with a model-checker. Theorem proving is not limited by those br interaction with a user. The theorem proving process is therefore slower
On Proving Safety Properties by Integrating Static Analysis, Theorem.. - Rusu, Singerman (1999)(Correct)
ion
V. Rusu
y
E. Singerman
SRI International, Menlo Park, California, USA
Abstract. We present a new approach for proving safety properties of reactive systems, based on
tight interaction between... / Integrating Static Analysis Theorem Proving and Abstraction V. Rusu br between static analysis theorem proving and abstraction techniques.
Using PVS for Requirements Analysis of an Access Control .. - Droschl (1999)(Correct)
This paper presents a case study in which a theorem prover
has been used for requirements analysis of an existing industrial application.
Based on the insights gained in the first step of a larger p... / keywords Requirements Theorem Proving Formal Validation Security br presents a case study in which a theorem prover has been used for
Execution Monitoring of High-Level Temporal Programs. - Soutchanski (1999)(Correct)
We propose a domain independent execution monitoring
technique for a class of restartable logic-based temporal
programs. The execution of a temporal program is interleaved
with monitoring. Given a rem... / allows to construct plans by theorem proving There is a special br approach to planning by theorem proving a programmer may use
Proving Theorems about Java-like Byte Code - Moore (1999)(Correct)
We describe a formalization of an abstract machine very similar to the Java Virtual Machine but far
simpler. We develop techniques for specifying the properties of classes and methods for this machine... / proofs are done with the ACL theorem proving system. Specification of br ACL is an automatic theorem prover in the sense that its
Lemma and Cut Strategies for Propositional Model Elimination - Van Gelder, Okushi (1999)(Correct)
This paper describes new "lemma" and "cut" strategies that are efficient to apply in the setting of
propositional Model Elimination. It builds upon the C-literal strategy proposed by Shostak, and stud... / oriented toward first-order theorem proving. The original cumulative br empirically for first order theorem proving using chains FLSY AS
Practical Reasoning and Plan Execution with Active Logic - Purang, Purushothaman, Traum.. (1999)(Correct)
We present an approach toward design of a
rational agent, integrating aspects of theoretical
reasoning, practical reasoning, and
reasoning about and executing plans. The
approach uses Active Logic, wh... / having to start up a new theorem-proving effort. Thus any helpful br for details including a theorem providing a rather general case in
Analyzing Mode Confusion via Model Checking - Lüttgen, Carreño (1999)(Correct)
Mode confusion is a serious problem in aviation safety. Today
's complex avionics systems make it difficult for pilots to maintain
awareness of the actual states, or modes, of the flight deck auto... / formal methods especially theorem proving can be used to discover br able to achieve this task than theorem proving and also to compare the
Fault-Tolerant Distributed Theorem Proving - Hickey (1999)(Correct)
Higher-order logics are expressive tools for tasks ranging
from formalizing the foundations of mathematics to large-scale software
verification and synthesis. Because of their complexity, proofs i... / Fault-Tolerant Distributed Theorem Proving Jason Hickey Cornell br higher-order distributed theorem provers These efforts
The Dynamics of Intelligence: Constraint-Satisfying Hybrid Systems.. - Mackworth (1999)(Correct)
Methods for designing and building perceptual agents
should be clean, powerful and practical. But no
methodology satisfies all three criteria, yet. Our
methodologies are evolving dialectically. The sy... / of the symbolic reasoning and theorem-proving may be outside the agent in br developed with appropriate theorem-proving and model-checking techniques
Maximal Strategies for Paramodulation with Non-Monotonic Orderings - Bofill, Godoy (1999)(Correct)
A west ordering is a well-founded (strict partial) ordering on terms that satisfies
the subterm property. In [BGNR99] the completeness of an ordered paramodulation
inference system w.r.t. west orderin... / lead to important results on theorem proving in first-order logic with br been applied to state-of-the-art theorem provers like Spass Wei results
Critical Agents Supporting Interactive Theorem Proving - Benzmüller, Sorge (1999)(Correct)
We introduce a resource adaptive agent mechanism which
supports the user of an interactive theorem proving system. The mechanism,
an extension of [5], uses a two layered architecture of agent soci... / Agents Supporting Interactive Theorem Proving Christoph Benzmuller and br the user of an interactive theorem proving system. The mechanism an
A Tableau Calculus for Pronoun Resolution - Monz, de Rijke (1999)(Correct)
To appear in: Proceedings of Tableaux'99
N. Murray, editor, LNAI, Springer, Berlin, 1999.
We present a tableau calculus for reasoning in fragments of natural
language. We focus on the problem of pron... / which it complicates automated theorem proving for natural language br for it.But how can a theorem prover that receives as one of
Argument Filtering Transformation - Kusakari, Nakamura, Toyama (1999)(Correct)
this paper, we show that the argument filtering method combining with the dependency pair
technique is essential in all the above elimination methods. We present remarkable simple
proofs for the sound... / verification and automatic theorem proving Termination is
Space Bounds for Resolution - Esteban, Torán (1999)(Correct)
We introduce a new way to measure the space needed in resolution refutations
of CNF formulas in propositional logic. With the former definition [10] the space
required for the resolution of any unsati... / to its importance in automatic theorem proving and logic programming
CH-Prolog: A Proof Procedure for Positive Disjunctive Logic.. - Wenjin Lu (1999)(Correct)
The success of Prolog motivates people to use full firstorder
logic instead of only Horn clauses as the basis
of logic programming. One of the main work in this
extending is to seek proof procedure fo... / together with a special-propose theorem prover for subsumption test In br programming and automatic theorem proving. We refer reader to see the
Applying Formal Methods to an Information Security Device: An.. - To Be Presented (1999)(Correct)
SCR (Software Cost Reduction) is a formal method
for specifying and analyzing system requirements that
has previously been applied to control systems. This
paper describes a case study in which the SC... / checker invariant generator theorem prover and validity checker-were br model checking and mechanical theorem proving How effective is this
Overlaps in Requirements Engineering - George Spanoudakis (1999)(Correct)
Although overlap between specifications -- that is the incorporation of elements which designate common
aspects of the system of concern -- is a precondition for specification inconsistency, it has on... / to consistency checking using theorem proving analyses various methods br and consistency rules using theorem proving. Section analyses various
Modelling Security Protocols based on Smart Cards - Bella (1999)(Correct)
Security protocols based on smart cards lack formal analysis.
The theoretic analysis by Bellare & Rogaway is the best example in this
small field. We propose an alternative approach obtained as an e... / Approach which is based on theorem proving. Our model certainly relies br understandable also outside the theorem proving community. Introduction
Non-automatizability of bounded-depth Frege proofs - Bonet, Domingo, Gavalda, Maciel.. (1999)(Correct)
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that
bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring of Blum
integers or ... / issues related to automated theorem provers. The question is given a br a crucial concept for automated theorem proving in proof complexity we are
A fully syntactic AC-RPO - Rubio (1999)(Correct)
We present the first fully syntactic (i.e., non-interpretationbased)
AC-compatible recursive path ordering (RPO). It is very simple,
and hence easy to implement, and its behaviour is intuitive as in... / are well-known to be crucial in theorem proving and programming. Therefore a br of most rewrite-based theorem proving techniques modulo AC is
Characterising Explicit Substitutions which Preserve Termination.. - Ritter (1999)(Correct)
Contrary to all expectations, the lambda-sigma-calculus, the canonical simply-typed lambda-calculus with explicit substitutions, is not strongly normalising. This result has led to a proliferation of ... / of explicit substitutions in theorem proving . the normal forms of
A Proof of Correctness of a Processor Implementing Tomasulo's.. - Hosabettu, Gopalakrishnan, Srivas (1999)(Correct)
The Completion Functions Approach was proposed in [HSG98]
as a systematic way to decompose the proof of correctness of pipelined
microprocessors. The central idea is to construct the abstraction fun... / technology originating from the theorem proving domain that can potentially br couple of years using both theorem proving and model checking
Full First-Order Free Variable Sequents and Tableaux in Implicit.. - Wirth (1999)(Correct)
We show how to integrate implicit inductive theorem proving
into free variable sequent and tableau calculi and compare the appropriateness
of tableau calculi for this integration with that of sequ... / to integrate implicit inductive theorem proving into free variable sequent br to know much about first-order theorem proving the interrelation of a
Proof Planning with Multiple Strategies II - Melis, Meier (1999)(Correct)
Humans have different problem solving strategies at their
disposal and they can flexibly employ several strategies when solving a
complex problem, whereas previous planning or theorem proving system... / whereas previous planning or theorem proving systems employ a single br theorems. In automated theorem proving as well as in planning there
A solution of Deligne's conjecture. - McClure, Smith (1999)(Correct)
Deligne asked in 1993 whether the Hochschild cochain complex of
an associative ring has a natural action by the singular chains of the little 2-cubes
operad. In this paper we give an armative answer... / by and Our method for proving Theorem . is to construct a br as required. Before proving Theorem . we need to give the de
The Tail-Recursive SECD Machine - Ramsdell (1999)(Correct)
One method for producing verified implementations of programming
languages is to formally derive them from abstract machines.
Tail-recursive abstract machines provide e#cient support for iterative
... / only a small increase in theorem-proving burden when compared with br performed using the BoyerMoore theorem prover. A by-product of this e ort
Redlog User Manual - Edition 2.0, for redlog Version 2.0 - Dolzmann, Sturm (1999)(Correct)
redlog stands for reduce logic system. It provides an extension of the
computer algebra system reduce to a computer logic system implementing
symbolic algorithms on rst-order formulas wrt. various r... / the elimination. For geometric theorem proving it has turned out that these br A new approach for automatic theorem proving in real geometry. Journal
Mechanising Procedures in HOL - Laibinis (1999)(Correct)
In this paper we present an approach for modelling procedures (as
they occur in imperative programs) in a weakest precondition semantics.
We show how this approach can be implemented in the mechanisat... / in the HOL System The theorem proving system HOL is based on br Workshop on Higher Order Logic Theorem Proving Lecture Notes in Computer
Theory Path Orderings - Stuber (1999)(Correct)
We introduce the notion of a theory path ordering (TPO),
which simplifies the construction of term orderings for superposition theorem
proving in algebraic theories. To achieve refutational complete... / orderings for superposition theorem proving in algebraic theories. To br theories. In particular theorem proving modulo some equational theory
Solved Forms for Path Ordering Constraints - Nieuwenhuis, Rivero (1999)(Correct)
A usual technique in symbolic constraint solving is to apply transformation rules
until a solved form is reached for which the problem becomes trivial. Ordering constraints
are well-known to be reduci... / the search space in automated theorem proving KKR NR or deciding the br work standard methods from theorem proving or completion for closing
Automatic Concept Formation in Pure Mathematics - Colton, Bundy, Walsh (1999)(Correct)
The HR program forms concepts and makes
conjectures in domains of pure mathematics
and uses theorem prover OTTER and model
generator MACE to prove or disprove the conjectures.
HR measures properties o... / of pure mathematics and uses theorem prover OTTER and model generator br interfaced HR with the OTTER theorem prover McCune to prove
Proving safety of an authentication protocol: a minimal approach - George (1999)(Correct)
Most work on proving or model checking authentication protocols is based on trace histories.
We suggest that a simpler approach based on sets of messages sent is adequate and prove the
correctness of ... / model checking and theorem proving. Most theorem proving and br and theorem proving. Most theorem proving and model checking has been
On Automating Diagrammatic Proofs of Arithmetic Arguments - Jamnik, Bundy, Green (1999)(Correct)
Theorems in automated theorem proving are usually proved by formal
logical proofs. However, there is a subset of problems which humans can prove by
the use of geometric operations on diagrams, so ca... / Theorems in automated theorem proving are usually proved by formal br Diagrammatic Reasoning Theorem Proving . Introduction
Proof of Correctness of a Processor with Reorder Buffer using the.. - Ravi Hosabettu (1999)(Correct)
The Completion Functions Approach was proposed in [HSG98]
as a systematic way to decompose the proof of correctness of pipelined
microprocessors. The central idea is to construct the abstraction fun... / technology originating from the theorem proving domain that can potentially br couple of years using both theorem proving and model checking
Combining Model Checking and Theorem Proving in Hardware Verification - Berezin (1999)(Correct)
In the age of submicron technology a single chip may contain tens or even hundreds
of millions transistors. The task of making such enormous systems correct becomes a
true challenge for the engineers.... / Combining Model Checking and Theorem Proving in Hardware Verification br techniques model checking and theorem proving in a single framework. As an
A Proof Presentation Suitable for Teaching Proofs - Melis, Leron (1999)(Correct)
The paper addresses comprehensible proof presentation for
teaching and learning that can be provided by an automated proof planner
that is a component of the proof development
environment\Omega
meg... / courses Can automated theorem proving systems be useful for br The traditional automated theorem provers' output is at best a
Towards Tool Support for Program Verification and Construction - Verhoeven, Backhouse (1999)(Correct)
Mathspad is a document preparation system designed and developed by the authors and oriented towards the calculational construction of programs. PVS (Prototype Verification System) is a theorem checke... / Keywords tools theorem proving proof checkers notations br with support tools and a theorem prover. It is intended to capture
Automaton-Descriptions and Theorem-Proving: A Marriage made in Heaven? - Aretoulaki, Ludwig (1999)(Correct)
In this paper, Finite-State-Automata (FSA)
and theorem-proving approaches to spoken dialogue
systems (SLDS) are contrasted to each
other. FSA are too rigid to deal with unpredictable
user reactions, s... / Automaton-Descriptions and Theorem-Proving A Marriage made in Heaven br FSA and theorem-proving approaches to spoken dialogue
E 0.5x User Manual - Schulz (1999)(Correct)
E is an equational theorem prover for full clausal logic, based on superposition
and rewriting. In this very preliminary manual we first give
a short introduction for impatient new users, and then c... / Abstract E is an equational theorem prover for full clausal logic based br to the E equational theorem prover. E is an purely equational
Class-Invariant Binary Relations in Java - Webber (1999)(Correct)
In this paper we introduce a new method for automatically identifying class invariants
in object-oriented programs. We de ne a category of class-invariant relations for Java
programs and give a stat... / In this project the power of a theorem-proving engine is brought to bear on br that applies heavyweight theorem proving to the problem of verifying
Resource Adaptive Agents in Interactive Theorem Proving - Benzmüller, Sorge (1999)(Correct)
We introduce a resource adaptive agent mechanism which supports
the user in interactive theorem proving. The mechanism, an extension
of [4], uses a two layered architecture of agent societies to sug... / Adaptive Agents in Interactive Theorem Proving Christoph Benzmuller and br the user in interactive theorem proving. The mechanism an extension
Robot Navigation and Map Building with the Event Calculus - Murray Shanahan (1999)(Correct)
This paper presents a programmable logic-based
agent control system that interleaves planning, plan
execution and perception. In this system, a program
is a collection of logical formulae describing t... / assimilation are abductive theorem proving tasks. Two small application br resolution-based abductive theorem proving processes working on sets
Strategies in Automated Deduction (STRATEGIES'99) - Gramlich, Kirchner, (eds.) (1999)(Correct)
33
Didier Galmiche
Annotated Reasoning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Dieter Hutter
An Approach to Flexible Forms of Proof C... / understanding of the nature of theorem proving strategies their br Talks Ten Years of Parallel Theorem Proving A Perspective .
On the Pattern Equations - Cerna, Klima, Srba (1999)(Correct)
Word equation in a special form X = A, where X is a sequence
of variables and A is a sequence of constants, is considered. The problem
whether X = A has a solution over a free monoid (PATTERN-EQUATI... / programming and automated theorem proving where especially
Exploiting Positive Equality in a Logic of Equality with.. - Bryant, German, Velev (1999)(Correct)
In using the logic of equality with unininterpreted functions to verify
hardware systems, specific characteristics of the formula describing the correctness
condition can be exploited when deciding ... / for their logic based on theorem proving search methods. It uses br decision procedures based on theorem proving search methods especially
On Rewrite Constraints and Context Unification - Niehren, Tison, Treinen (1999)(Correct)
We show that strati ed context uni cation, which is one of the most expressive fragments
of context uni cation known to be decidable, is equivalent to the satis ability
problem of slightly generalized... / Key words Automatic Theorem Proving Theory of Computation Uni
Using Term Space Maps to Capture Search Control Knowledge in.. - Schulz, Brandt (1999)(Correct)
We describe a learning inference control heuristic for
an equational theorem prover. The heuristic selects a
number of problems similar to a new problem from a
knowledge base and compiles informati... / Knowledge in Equational Theorem Proving Stephan Schulz and Felix br heuristic for an equational theorem prover. The heuristic selects a
On Defining Irreducibility - Koiran (1999)(Correct)
We show that for real algebraic varieties, irreducibility is not a rstorder
de nable property. This result holds in any real closed eld; its proof
is based on the o-minimality of the real exponentia... / of L R p Before proving Theorem we point out in
Stiff Oscillatory Systems, Delta Jumps and White Noise - Cano, Stuart, Süli, Warren (1999)(Correct)
Two model problems for sti oscillatory systems are introduced.
Both comprise a linear superposition of N 1 harmonic oscillators
used as a forcing term for a scalar ODE. In the rst case the initial... / the section. In the course of proving Theorem we also estimate the br t We now prove Theorems . Proof of
Automatic verification of combinational and pipelined FFT circuits - Bjesse (1999)(Correct)
We describe how three hardware components (two combinational
and one pipelined) for computing the Fast Fourier Transform
have been proved equivalent using an automatic combination of symbolic
sim... / techniques induction and theorem proving. We also give some advice on br proposed VB we instead use theorem proving but in such a way that no
Tableau Calculus for Local Cubic Modal Logic and it's Implementation - Maarten Marx Department (1999)(Correct)
In this paper we investigate the two-variable fragment of modal logics of relations interpreted on
local squares, LC 2 . A labelled tableau calculus is presented and its soundness and completeness are... / us to use the calculus as a theorem prover. The prover has been br modal logic tableau system theorem proving guarded fragment
System Description: inka 5.0 - A Logic Voyager - Autexier, Hutter, Mantel, Schairer (1999)(Correct)
this paper are implemented and used for some example logics
and sequent calculus proof search.
The core inka is implemented in Allegro Common Lisp. The interface runs on
distributed Oz, which is avail... / as an automatic inductive theorem prover based on resolution and br in the context of inductive theorem proving to encode the knowledge about
CASL: A Guided Tour of its Design - Mosses (1999)(Correct)
Casl is an expressive language for the specification of functional
requirements and modular design of software. It has been designed
by CoFI, the international Common Framework Initiative for alge... / code prototyping theorem-proving libraries reuse br Static semantic analysis and theorem proving for Casl. In th Workshop
Formal verification of VHDL using VHDL-like ACL2 models - Borrione, Georgelin (1999)(Correct)
When a design reaches the register transfer level, essential architectural
decisions have been taken; their validation required extensive simulation
of the abstract behavioral specifications. The re... / symbolic simulation theorem proving Abstract When a design br in the logic of the ACL theorem prover. Written in Lisp this model
Symbolic Model Checking with Sets of States Represented as Formulas - Bjesse (1999)(Correct)
We analyse traditional symbolic model checking [BCL
+
94]
to isolate the operations that a representation for sets of states need to
support and present a different view, where sets of states ar... / Propositional temporal logic theorem proving is PSPACE-complete and often br that we choose a syntactic theorem-proving inspired approach to set
An algorithmic framework for specifying the semantics of discourse.. - Knott (1999)(Correct)
In this paper, a new framework is proposed for de ning the semantics of discourse
relations, and for de ning the semantics of the utterances that relations hold between.
The proposal is to de ne relat... / interleaves perception theorem-proving and action the denotation of br narrated is an instance of theorem-proving by p at a certain time in
Genetic Algorithms Based Systems For Conceptual Engineering Design - Cvetkovic, Parmee (1999)(Correct)
this paper we try to integrate methods of preferences and scenarios with Genetic Algorithms
used to perform multi--objective optimisation. The goal is to make a system that will be able
to work togeth... / in resolution based automated theorem proving Each scenario is a br Loveland D. W.Automated Theorem Proving A Logical Basis
A proof-theoretic approach to knowledge - Yasugi, Oda (1999)(Correct)
We speculate on logical aspects of the so-called three wise men puzzle
with proof-theoretic methods. We propose and study the following. (1) Logical
ability of each player of a puzzle is equivalent t... / is guaranteed by automated theorem proving. All this is attained by br unprovable sequent theorem proving Origin of the problem
Optimal Lower Bounds for Quantum Automata and Random Access Codes - Ashwin Nayak (1999)(Correct)
Consider the finite regular language Ln = fw0 j w 2 f0; 1g
; jwj ng. In [2] it was shown that while
this language is accepted by a deterministic finite automaton of size O(n), any one-way quantum ... / string. The technique used in proving Theorem . also yields a bound for br of quantum automata We now prove Theorem . using this framework. The
Ivy: A Preprocessor And Proof Checker For First-Order Logic - McCune, Shumsky (1999)(Correct)
This case study shows how non-ACL2 programs can be combined with
ACL2 functions in such a way that useful properties can be proved about
the composite programs. Nothing is proved about the non-ACL2 pr... / automated theorem proving for first-order logic. The br a different kind of automated theorem proving. We work with fully automatic
CSPlib: a benchmark library for constraints - Gent, Walsh (1999)(Correct)
We introduce CSPlib, a benchmark library for constraints.
We discuss the advantages and disadvantages of building such a library.
Unlike many other domains (for example, theorem proving, or machine
... / other domains for example theorem proving or machine learning br areas like machine learning or theorem proving. Finally we describe
Embedded minimal ends of finite type - Hauswirth, Pérez, Romon (1999)(Correct)
We prove that the end of a complete embedded minimal surface in R
3
with
infinite total curvature and finite type has an explicit Weierstrass representation that only depends
on a holomorphic func... / The second key ingredient to prove Theorem deals with the inverse br and are devoted to proving Theorems and respectively.
Strategies Explained - Frank, Basin (1999)(Correct)
For many problem-solving tasks, it is important not only to produce
solutions, but also to justify any solutions with explanations. In
this paper, we describe how we are addressing this question withi... / approach came from automated theorem proving. As in Bridge high-level br tactics are useful in theorem-proving because they prune the search
Design of a PLC Program for VHS Case Study 1 - Mader, Wupper, Bauer (1999)(Correct)
This report presents our first results and conclusions with respect to
- a simple specification formalism for hard real-time problems,
- a method allowing to derive the specification of a control prog... / has advantages during theorem proving. A simple modal real-time
Diagrammatic Reasoning in Projective Geometry - Balbiani, Cerro (1999)(Correct)
The heart of our thesis is that matrices of incidence can be used for
mechanical theorem proving in projective geometry. To every geometrical
statement of projective geometry is associated a matrix of... / can be used for mechanical theorem proving in projective geometry. To br can be used for mechanical theorem proving in projective geometry. A