#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1994

2016

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Since the introduction of temporal logic for the specification of computer programs [5], usability has been an issue, because a difficult-to-use formalism is a barrier to the wide adoption of formal methods. Our solution is Sugar, the temporal logic used by the RuleBase formal verification tool [2]. Sugar adds the power of regular expressions to CTL [4], as… (More)

- Ilan Beer, Shoham Ben-David, Cindy Eisner, Yoav Rodeh
- CAV
- 1997

Propositional logic formulas containing implications can suffer from antecedent failure, in which the formula is true trivially because the pre-condition of the implication is not satisfiable. In other words, the post-condition of the implication does not affect the truth value of the formula. We call this a vacuous pass, and extend the definition of… (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, 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, Yoav Rodeh
- Formal Methods in System Design
- 2001

The ability to generate a counter-example is an important feature of model checking tools, becausea counter-example provides information to the user in the case that the formula being checked is found to be non-valid. In this paper, we turn our attention to providing similar feedback to the user in the case that the formula is found to be valid, because… (More)

When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexample trace, in order to visually identify the failure that it demonstrates. If the trace is long, or the specification is complex, finding the failure in the trace becomes a non-trivial… (More)

Making formal verification a practicality in industrial environments is still difficult. The capacity of most verification tools is too small, their integration in a design process is difficult and the methodology that should guide their usage is unclear. This paper describes a step-by-step methodology which was developed for the practical application of… (More)

- Jocelyn Simmonds, Shoham Ben-David, Marsha Chechik
- SIGSOFT FSE
- 2010

Web service applications are dynamic, highly distributed, and loosely coupled orchestrations of services which are notoriously difficult to debug. In this paper, we describe a user-guided recovery framework for web services. When behavioural correctness properties (safety and bounded liveness) of an application are violated at runtime, we automatically… (More)

- Shoham Ben-David, Tamir Heyman, Orna Grumberg, Assaf Schuster
- International Journal on Software Tools for…
- 2000

This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly model checking for safety properties with a scheme for scalable reachability analysis. We suggest an efficient, BDD-based algorithm for a distributed construction of a counterexample. The… (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)