Providing automated support to deductive analysis of time critical systems

Alborghetti, Andrea; Gargantini, Angelo; Morzenti, Angelo

doi:10.1007/3-540-63531-9_16

Cited by 10 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several prototype tools are available to support the method: a graphical interactive editor supporting the documentation of all phases, from requirement specification to architectural design; a test case generation tool [15,16]; a correctness prover -or disprover-based on the translation of the TRIO formalism into PVS [1].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A formal approach for designing CORBA based applications

Pradella

Rossi

Mandrioli

et al. 2000

Proceedings of the 22nd International Conference on Software Engineering - ICSE '00

View full text Add to dashboard Cite

The design of distributed applications in a CORBA based environment can be carried out by means of an incremental approach, which starts from the specification and leads to the high level architectural design. This is done by introducing in the specification all typical elements of CORBA and by providing a methodological support to the designers. The paper discusses a methodology to transform a formal specification written in TRIO into a high level design document written using an extension of TRIO named TC. The TC language is suited to formally describe the high level architecture of a CORBA based application. The methodology and the associated language are presented by means of an example involving a real Supervision and Control System.

show abstract

Section: Discussionmentioning

confidence: 99%

“…In the rest of the paper the following convention is adopted: 1 The courier font denotes TC meta-classes.…”

Section: The Tc Languagementioning

confidence: 99%

A formal approach for designing CORBA based applications

Pradella

Rossi

Mandrioli

et al. 2000

Proceedings of the 22nd International Conference on Software Engineering - ICSE '00

View full text Add to dashboard Cite

show abstract

“…In some cases, a repeated pattern becomes a single proof step. For example, the TAME strategy called APPLY INV LEMMA, with the appropriate arguments, introduces the desired invariant lemma, instantiates it, expands the invariant, and dis- 1 Here and below, a name in bold capital letters denotes a TAME strategy.…”

Section: Proofmentioning

confidence: 99%

Using TAME to prove invariants of automata models

Archer

Heitmeyer

Riccobene

2000

Proceedings of the Third Workshop on Formal Methods in Software Practice

View full text Add to dashboard Cite

TAME is a special-purpose interface to PVS designed to support developers of software systems in proving properties of automata models. One of TAME's major goals is to allow a software developer who has basic knowledge of standard logic, and can do hand proofs, to use PVS to represent and to prove properties about an automaton model without rst becoming a PVS expert. A second goal is for a human to be able to read and understand the content of saved TAME proofs without running them through the PVS proof checker. A third goal is to make p r o ving properties of automata with TAME less costly in human time than proving such properties using PVS directly. Recent work by Romijn and Devillers et al., based on the I/O automata model, has provided the basis for two case studies on how w ell TAME achieves these goals. Romijn speci ed the RPC-Memory Problem and its solution, while Devillers et al. speci ed a tree identify protocol. Hand proofs of specication properties were provided by the authors. In addition, Devillers et al. used PVS directly to mechanize the specications and proofs of the tree identify protocol. In one case study, the third author, a new TA M E u s e r w i t h n o p r e v i o u s PVS experience, used TAME to create PVS speci cations of the I/O automata presented by Romijn and Devillers et al. and to check the hand proofs of invariant properties. The PVS speci cations and proofs of Devillers et al. provide the basis for the other case study, which compares the TAME approach to an alternate approach w h i c h uses PVS directly.

show abstract

“…• Theorem proving. Given a set of TRIO axioms and a candidate TRIO theorem, a semiautomatic tool helps deciding whether the candidate theorem can actually be derived from the axioms [AG&97]. This technique can be used to a) validate specifications by deriving some logical consequences thereof to check whether they are consistent with user expectations; b) verify that a lower level specification fulfills the requirements stated in an upper level; c) verify that the code implementation is correct with respect to requirement specification.…”

Section: Validation and Verificationmentioning

confidence: 99%

From formal models to formally based methods

Ciapessoni

Mirandola

Coen‐Porisini

et al. 1999

ACM Trans. Softw. Eng. Methodol.

Self Cite

View full text Add to dashboard Cite

We address the problem of increasing the impact of formal methods in the practice of industrial computer applications. We summarize the reasons why formal methods so far did not gain widespread use within the industrial environment despite several promising experiences. We suggest an evolutionary rather than revolutionary attitude in the introduction of formal methods in the practice of industrial applications and we report on our long-standing experience which involves an academic institution, Politecnico di Milano, two main industrial partners, ENEL and CISE, and occasionally a few other industries. Our approach aims at augmenting an existing and fairly deeply rooted informal industrial methodology with our original formalism, the logic specification language TRIO. On the basis of the experiences we gained we argue that our incremental attitude towards the introduction of formal methods within the industry could be effective largely independently from the chosen formalism.

show abstract

Providing automated support to deductive analysis of time critical systems

Cited by 10 publications

References 7 publications

A formal approach for designing CORBA based applications

A formal approach for designing CORBA based applications

Using TAME to prove invariants of automata models

From formal models to formally based methods

Contact Info

Product

Resources

About