# Model checking

## Papers overview

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

Highly Cited

2008

Highly Cited

2008

- 2008

The solution to get this book is that we don't over you the free book. But, we offer you the free information about principles ofâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- CAV
- 2002

This paper describes version 2 of the NuSMV tool. NuSMV is a symbolic model checker originated from the reengineeringâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- TACAS
- 1999

Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] haveâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- POPL
- 1997

Verification by state-space exploration, also often referred to as "model checking", is an effective method for analyzing theâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- CONCUR
- 1997

We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systemsâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- FSTTCS
- 1995

The temporal logics pCTL and pCTL* have been proposed as tools for the formal speci cation and veri cation of probabilisticâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- ACM Trans. Program. Lang. Syst.
- 1994

We describe a framework for compositional verification of finite-state processes. The framework is based on two ideas: a subsetâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- J. ACM
- 1994

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time modelâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- CAV
- 1993

\Whenever you have to do with a structure-endowed entity try to determine its group of automorphisms" Abstract We show how toâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- POPL
- 1992

We describe a method for using abstraction to reduce the complexity of temporal logic model checking. The basis of this method isâ€¦Â (More)

Is this relevant?