#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1997

2009

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We explore the combination of bounded model checking and induction for proving safety properties of infinite-state systems. In particular, we define a general k-induction scheme and prove completeness thereof. A main characteristic of our methodology is that strengthened invariants are generated from failed k-induction proofs. This strengthening step… (More)

- Bruno Dutertre, Maria Sorea
- FORMATS/FTRTFT
- 2004

We discuss the modeling and verification of real-time systems using the SAL model checker. A new modeling framework based on event calendars enables dense timed systems to be described without relying on continuously varying clocks. We present verification techniques that rely on induction and abstraction, and show how these techniques are efficiently… (More)

The Symbolic Analysis Laboratory (SAL) is a set of tools for the specification, exploration, and verification of state-transition systems. SAL includes symbolic model-checking tools based on solvers and decision procedures for linear arithmetic, uninterpreted functions, and propositional logic, among others. This enables the analysis of a variety of… (More)

- Maria Sorea
- Electr. Notes Theor. Comput. Sci.
- 2002

The increasing performance of modern model-checking tools offers high potential for the computeraided design of fault-tolerant algorithms. Instead of relying on human imagination to generate taxing failure scenarios to probe a fault-tolerant algorithm during development, we define the fault behavior of a faulty process at its interfaces to the remaining… (More)

We propose predicate abstraction as a means for verifying a rich class of safety and liveness properties for dense real-time systems. First, we define a restricted semantics of timed systems which is observationally equivalent to the standard semantics in that it validates the same set of μ-calculus formulas without a next-step operator. Then, we recast the… (More)

- Maria Sorea
- 2001

- M. Oliver Möller, Harald Ruess, Maria Sorea
- Electr. Notes Theor. Comput. Sci.
- 2002

- Martin Strecker, Maria Sorea
- KI
- 1997

This paper reports on the integration of an untyped equational prover into a proof system based on an expressive constructive type theory. The proofs returned by the equational prover are eeectively veriied for type correctness, a proof term can be constructed. The scheme of proof translation described here is illustrated by the integration of the Discount… (More)