Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2003

Highly Cited

2003

This article introduces the concept of multi-valued model-checking and describes a multi-valued symbolic model-checker, ΧChek… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This… Expand

Is this relevant?

Highly Cited

1998

Highly Cited

1998

We present an axiomatization for Basic Propositional Calculus BPC and give a completeness theorem for the class of transitive… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

The advent of ever more complex reactive systems in increasingly critical areas calls for the development of automated verication… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Abstract A well-known result of Ladner says that the satisfiability problem for K45, KD45, and S5 is NP-complete. This result… Expand

Is this relevant?

Highly Cited

1993

Highly Cited

1993

Because of the difficulty of adequately simulating large digital designs, there has been a recent surge of interest in formal… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Abstract We show that if two finite Kripke structures can be distinguished by some CTL ∗ formula that contains both branching… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

Abstract We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

The semantics of typed lambda calculus is usually described using Henkin models, consisting of functions over some collection of… Expand

Is this relevant?

Highly Cited

1985

Highly Cited

1985

We describe novel techniques for establishing improved upper and lower bounds for modal logics of programs: 1) We introduce… Expand

Is this relevant?