#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1992

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Roy Armoni, Limor Fix, +9 authors Yael Zbar
- TACAS
- 2002

In this paper we describe the ForSpec Temporal Logic (FTL), the new temporal property-specification logic of ForSpec, Intel’s new formal specification language. The key features of FTL are as follows: it is a linear temporal logic, based on Pnueli’s LTL, it is based on a rich set of logical and arithmetical operations on bit vectors to describe state… (More)

- Ilan Beer, Shoham Ben-David, Avner Landver
- CAV
- 1998

The specification language RCTL, an extension of CTL, is defined by adding the power of regular expressions to CTL. In addition to being a more expressive and natural hardware specification language than CTL, a large family ofRCTL formulas can be verified on-the-fly (during symbolic reachability analysis). On-the-fly model checking, as a powerful… (More)

- Ilan Beer, Shoham Ben-David, Cindy Eisner, Avner Landver
- DAC
- 1996

RuleBase is a formal verification tool, developed by the IBM Haifa Research Laboratory. It is the result of three years of experience in practical formal verification of hardware which, we believe, has been a key factor in bringing the tool to its current level of maturity. We present the tool, including several unique features, and summarize our usage… (More)

- Ilan Beer, Shoham Ben-David, +8 authors Yaron Wolfsthal
- CAV
- 1997

RuleBase is a symbolic model checking tool, developed by the IBM Haifa Research Laboratory. It is the result of four years of experience in practical formal verification of hardware which, we believe, has been a key factor in bringing the tool to its current level of maturity. Our experience shows that after a short training period, designers can operate… (More)

In this paper, we present a verification methodology that integrates formal verification techniques with verification by simulation, thereby providing means for generating simulation test suites that ensure coverage. We derive the test suites by means of BDD-based symbolic techniques for describing and traversing the implementation state space. In our… (More)

- Avner Landver
- J. Symb. Log.
- 1992

- Sandeep K. Shukla, Alan J. Hu, +4 authors Carl Pixley
- HLDVT
- 2006

- Avner Landver
- 1992

Let κ be a regular cardinal. Consider the Baire numbers of the spaces (2)κ for various θ ≥ κ. Let l be the number of such different Baire numbers. Models of set theory with l = 1 or l = 2 are known and it is also known that l is finite. We show here that if κ > ω, then l could be any given finite number. The Baire number of a topological space with no… (More)

- Tim Laberge, Avner Landver
- 1992

We show that (θ) implies that there is a first countable<θ-collectionwise Hausdorff space that is not weakly θ-collectionwise Hausdorff. We also show that in the model obtained by Levy collapsing a weakly compact (supercompact) cardinal to ω2, first countable א1-collectionwise Hausdorff spaces are weakly א2-collectionwise Hausdorff (weakly collectionwise… (More)

- Avner Landver
- J. Symb. Log.
- 1992