#### Filter Results:

- Full text PDF available (113)

#### Publication Year

1983

2017

- This year (3)
- Last 5 years (28)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu, Helmut Veith
- J. ACM
- 2003

The state explosion problem remains a major hurdle in applying symbolic model checking to large hardware designs. State space abstraction, having been essential for verifying designs of industrial complexity, is typically a manual process, requiring considerable creativity and insight.In this article, we present an automatic iterative abstraction-refinement… (More)

- Edmund M. Clarke, Orna Grumberg, David E. Long
- POPL
- 1992

We describe a method for using abstraction to reduce the complexity of temporal-logic model checking. Using techniques similar to those involved in abstract interpretation, we construct an abstract model of a program without ever examining the corresponding unabstracted model. We show how this abstract model can be used to verify properties of the original… (More)

- Dennis Dams, Rob Gerth, Orna Grumberg
- ACM Trans. Program. Lang. Syst.
- 1997

Interpretation of Reactive Systems DENNIS DAMS and ROB GERTH Eindhoven University of Technology

- Orna Grumberg, David E. Long
- ACM Trans. Program. Lang. Syst.
- 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 the component. Satisfaction of a formula in the logic… (More)

- Michael C. Browne, Edmund M. Clarke, Orna Grumberg
- Theor. Comput. Sci.
- 1988

We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite eecient in practice. In particular, we show how the SMV model checking system developed by McMillan 16] can be extended to permit LTL spec-iications. The… (More)

We present an automatic iterative abstraction-re nement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be veri ed. Abstract models may admit erroneous (or \spurious") counterexamples. We devise new symbolic techniques which analyze such counterexamples and re ne the abstract… (More)

- Doron Bustan, Orna Grumberg
- CADE
- 2000

This work presents a minimization algorithm. The algorithm receives a Kripke structure M and returns the smallest structure that is simulation equivalent to M. The simulation equivalencerelation is weaker than bisimulation but stronger than the simulation preorder. It strongly preserves ACTL and LTL (as sub-logics of ACTL). We show that every structure M… (More)

- Edmund M. Clarke, Orna Grumberg, Kenneth L. McMillan, Xudong Zhao
- 32nd Design Automation Conference
- 1995

Model checking is an automatic technique for verifying sequential circuit designs and protocols. An efficient search procedure is used to determine whethe or not the specification is satisfied. If it is not satisfied, our technique will produce a counter-example execution trace that shows the cause of the problem. We describe an efficient algorithm to… (More)

- Girish Bhat, Rance Cleaveland, Orna Grumberg
- LICS
- 1995

This paper gives an on-they algorithm for determining whether a nite-state system satisses a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing \global al-gorithm" for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast… (More)