Results 1  10
of
1,163
Symbolic Model Checking without BDDs
, 1999
"... 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 this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 917 (75 self)
 Add to MetaCart
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 this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
Model Checking and Modular Verification
 ACM Transactions on Programming Languages and Systems
, 1991
"... We describe a framework for compositional verification of finite state processes. The framework is based on two ideas: a subset of the logic CTL for which satisfaction is preserved under composition; and a preorder on structures which captures the relation between a component and a system containing ..."
Abstract

Cited by 312 (11 self)
 Add to MetaCart
containing the component. Satisfaction of a formula in the logic corresponds to being below a particular structure (a tableau for the formula) in the preorder. We show how to do assumeguarantee style reasoning within this framework. In addition, we demonstrate efficient methods for model checking
TableauBased Model Checking in the Propositional MuCalculus
 Acta Informatica
, 1990
"... This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses tech ..."
Abstract

Cited by 101 (7 self)
 Add to MetaCart
This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses
Secrecy by Typing in Security Protocols
 Journal of the ACM
, 1998
"... We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use sharedkey cryptography. The rules have the form of typing rules for a basic co ..."
Abstract

Cited by 273 (10 self)
 Add to MetaCart
We develop principles and rules for achieving secrecy properties in security protocols. Our approach is based on traditional classification techniques, and extends those techniques to handle concurrent processes that use sharedkey cryptography. The rules have the form of typing rules for a basic
The SATTableau Calculus
"... Recently, [7] pointed out that the increasing use of Description Logics (DLs) in areas such as eScience and the Semantic Web is already stretching the capabilities of existing DL systems, posing a range of challenges for future research on reasoning methods for DL. A key problem is the provision of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Recently, [7] pointed out that the increasing use of Description Logics (DLs) in areas such as eScience and the Semantic Web is already stretching the capabilities of existing DL systems, posing a range of challenges for future research on reasoning methods for DL. A key problem is the provision of efficient algorithms that allow (advanced) applications (i) to
A Tableau Calculus for Minimal Model Reasoning
 Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods
, 1996
"... . The paper studies the automation of minimal model inference, i.e., determining whether a formula is true in every minimal model of the premises. A novel tableau calculus for propositional minimal model reasoning is presented in two steps. First an analytic clausal tableau calculus employing a rest ..."
Abstract

Cited by 60 (6 self)
 Add to MetaCart
. The paper studies the automation of minimal model inference, i.e., determining whether a formula is true in every minimal model of the premises. A novel tableau calculus for propositional minimal model reasoning is presented in two steps. First an analytic clausal tableau calculus employing a
HiLog: A foundation for higherorder logic programming
 JOURNAL OF LOGIC PROGRAMMING
, 1993
"... We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higherorder syntax and allows arbitrary terms to appear in places where predicates, functions and atomic formulas occur in predicate calc ..."
Abstract

Cited by 252 (42 self)
 Add to MetaCart
We describe a novel logic, called HiLog, and show that it provides a more suitable basis for logic programming than does traditional predicate logic. HiLog has a higherorder syntax and allows arbitrary terms to appear in places where predicates, functions and atomic formulas occur in predicate
Accelerating Tableaux Proofs using Compact Representations
, 1993
"... In this article a modified form of tableau calculus, called Tableau Graph Calculus, is presented for overcoming the wellknown inefficiencies of the traditional tableau calculus to a large extent. This calculus is based on a compact representation of analytic tableaux by using graph structures calle ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this article a modified form of tableau calculus, called Tableau Graph Calculus, is presented for overcoming the wellknown inefficiencies of the traditional tableau calculus to a large extent. This calculus is based on a compact representation of analytic tableaux by using graph structures
A Tableau Calculus for Equilibrium Entailment
 In Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2000, LNAI 1847
, 2000
"... We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics undery ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
underyling equilibrium entailment, namely hereand there with strong negation and its strengthening classical logic with strong negation. A further tableau calculus is then presented for computing equilibrium entailment. This makes use of a new method for reducing the complexity of the tableau expansion
State Constraints Revisited
, 1994
"... We pursue the perspective of Reiter that in the situation calculus one can formalize primitive, determinate actions with axioms which, among others, include two disjoint sets: a set of successor state axioms and a set of action precondition axioms. We posed ourselves the problem of automatically gen ..."
Abstract

Cited by 242 (35 self)
 Add to MetaCart
We pursue the perspective of Reiter that in the situation calculus one can formalize primitive, determinate actions with axioms which, among others, include two disjoint sets: a set of successor state axioms and a set of action precondition axioms. We posed ourselves the problem of automatically
Results 1  10
of
1,163