Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Nicolas Halbwachs and Doron Peled, editors, Computer-Aided Verification, CAV '99, volume 1633 of Lecture Notes in Computer Science, pages 146--159, Trento, Italy, July 1999. Springer-Verlag. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
From Refutation To Verification - Rushby (2000) (1 citation) (Correct)
....cost. Verification systems that explore this approach include SAL [2] which is under development at SRI, and InVeSt [4] which is a collaboration between Verimag and SRI (InVeSt is built on PVS and is being integrated with SAL) Other experiments using related methods have been reported recently [1, 7]. The great benefit of this approach is that human guidance to the process of iterated abstraction and model checking is conducted in terms of properties related to the design: the user suggests predicates to be abstracted, examines counterexample traces or derived invariants, and suggests new ....
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of 6 infinite-state systems by combining abstraction and reachability analysis. In Halbwachs and Peled [8], pages 146--159.
Theorem Proving for Verification - Rushby (2000) (4 citations) (Correct)
....cost. Verification systems that explore this approach include SAL [3] which is under development at SRI, and InVeSt [6] which is a collaboration between Verimag and SRI (InVeSt is built on PVS and is being integrated with SAL) Other experiments using related methods have been reported recently [1, 9]. The great benefit of these approaches is that human guidance to the process of iterated abstraction and model checking is conducted in terms of properties related to the design: the user suggests predicates to be abstracted, examines counterexample traces or derived invariants, and suggests new ....
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Halbwachs and Peled [13], pages 146--159.
Automatic Abstraction in Model Checking - Lu (2000) (Correct)
....methodology for ACTL # properties. Abstraction techniques for various fragments of CTL # have been discussed in [36, 37] These abstraction techniques have been extended to the calculus [35, 74] Abstraction techniques for infinite state systems are crucial for successful verification [2, 7, 71, 77]. Graf and Sadi [54] have proposed predicate abstraction techniques to abstract an infinite state system into a finite state system. Later, a number of optimization techniques have been developed in [8, 38] Sadi and Shankar have integrated predicate abstraction into the PVS system which could ....
P. A. Abdulla et al. Verification of infinite-state systems by combining abstraction and reachability analysis. In Computer-Aided Verification, July 1999.
Verification Diagrams Revisited: Disjunctive Invariants for Easy.. - Rushby (2000) (7 citations) (Correct)
.... typically the idea is to construct an abstraction of the original system that preserves the properties of interest and that has some special form (e.g. finite state) that allows very efficient analysis (e.g. model checking) Methods based on predicate abstraction [24] seem very promising [1, 3, 9, 25]. A configuration diagram can be considered an abstraction of the original state machine and it is plausible that it could be generated automatically by predicate abstraction on the predicates that characterize its configurations and transition conditions. However, it is difficult to see how the ....
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Halbwachs and Peled [11], pages 146--159.
Integrated Formal Verification: Using Model Checking With.. - Rushby (1999) (4 citations) (Correct)
....considered here) by showing that the property is true in the initial system state and that it is preserved by all transitions of the system. If we feed our example into PVS [15] it quickly discharges three of the four proof obligations and terminates with the following unproven subgoal. [ 1] pc(pre 1) A [ 2] pc(post 1) B [ 3] x(pre 1) 0 [1] x(pre 1) 1 2 PVS displays proof goals in this sequent form; the interpretation is that the conjunction of the formulas above the line should imply the disjunction of formulas (here there is only one) below the line. An ....
....system state and that it is preserved by all transitions of the system. If we feed our example into PVS [15] it quickly discharges three of the four proof obligations and terminates with the following unproven subgoal. 1] pc(pre 1) A [ 2] pc(post 1) B [ 3] x(pre 1) 0 [1] x(pre 1) 1 2 PVS displays proof goals in this sequent form; the interpretation is that the conjunction of the formulas above the line should imply the disjunction of formulas (here there is only one) below the line. An expression such as pc(pre 1) A is interpreted as asserting that the ....
[Article contains additional citation context not shown here]
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Halbwachs and Peled [8], pages 146--159.
Parametric Verification of a Group Membership Algorithm - Bouajjani, Merceron (2002) (1 citation) Self-citation (Bouajjani) (Correct)
No context found.
Abdulla P.A, Annichini A., Bensalem S., Bouajjani A., Habermehl P., Lakhnech Y: Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. CAV'99, Lecture Notes in Computer Science, Vol 1633. Springer-Verlag, (1999)
Symbolic Techniques for Parametric Reasoning about.. - Annichini, Asarin.. (2000) (18 citations) Self-citation (Annichini Bouajjani) (Correct)
No context found.
P.A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani, and Y. Lakhnech P. Habermehl. Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. In 11th Intern. Conf. on Computer Aided Verification (CAV'99). LNCS 1633, 1999.
An Overview of SAL - Bensalem, Ganesh, Lakhnech.. (2000) (26 citations) Self-citation (Bensalem Lakhnech) (Correct)
....of the abstract system. We implemented our method using the theorem prover PVS [27] to check the Hoare triples generated by the elimination method. The first order formulas corresponding to these Hoare triples are constructed automatically and a strategy that is given by the user is applied. In [1] we developed also a general analysis methodology for heterogeneous infinite state models, extended automata operating on variables which may range over several different domains, based on combining abstraction and symbolic reachability analysis. 3.4.2 Generation of Invariants There are two ....
P. A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani, P. Habermehl, and Y. Lakhnech. Verification of infinitestate systems by combining abstraction and reachability analysis. In Halbwachs and Peled [20], pages 146--159.
Checking Asynchronously Communicating Components.. - Maréchal.. (2004) (Correct)
No context found.
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Nicolas Halbwachs and Doron Peled, editors, Computer-Aided Verification, CAV '99, volume 1633 of Lecture Notes in Computer Science, pages 146--159, Trento, Italy, July 1999. Springer-Verlag.
Checking Asynchronously Communicating Components using.. - Olivier Marechal And (2004) (Correct)
No context found.
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Nicolas Halbwachs and Doron Peled, editors, Computer-Aided Verification, CAV '99, volume 1633 of Lecture Notes in Computer Science, pages 146--159, Trento, Italy, July 1999. Springer-Verlag.
Counterexample-Guided Abstraction Refinement - For Symbolic Model (Correct)
No context found.
ABDULLA,P. A., ANNICHINI, A., BENSALEM, S., BOUAJJANI, A., HABERMEHL,P.,AND LAKHNECH,Y. 1999. Verification of infinite-state systems by combining abstraction and reachability analysis. In ComputerAided Verification (CAV).
Checking Asynchronously Communicating Components Using.. - Marechal, Poizat, Royer (2004) (Correct)
No context found.
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Nicolas Halbwachs and Doron Peled, editors, Computer-Aided Verification, CAV '99, volume 1633 of Lecture Notes in Computer Science, pages 146--159, Trento, Italy, July 1999. Springer-Verlag.
Checking Asynchronously Communicating Components Using.. - Marechal, Poizat, Royer (2004) (Correct)
No context found.
Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl, and Yassine Lakhnech. Verification of infinite-state systems by combining abstraction and reachability analysis. In Nicolas Halbwachs and Doron Peled, editors, Computer-Aided Verification, CAV '99, volume 1633 of Lecture Notes in Computer Science, pages 146--159, Trento, Italy, July 1999. Springer-Verlag.
Information Societies Technology - Ist Programme Future (Correct)
No context found.
P.A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani, and Y. Lakhnech P. Habermehl. Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. In 11th Intern. Conf. on Computer Aided Verification (CAV'99). LNCS 1633, 1999.
Model Checking with formula-dependent abstract models - Asteroth, Baier, Aßmann (2001) (2 citations) (Correct)
No context found.
P. Abdulla, A. Annichini, S. Bensalem, A. Boujjani, P. Habermehl, Y. Lakhnech. Verification of infinite state systems by combining abstraction and reachability analysis. In Proc. CAV'99, LNCS 1633, 1999.
Verifying Transaction Ordering Properties in Unbounded Bus .. - Jones, Gopalakrishnan (1 citation) (Correct)
No context found.
P. A. Abdulla, A. Annichini, S. Bensalem, A. Bouajjani, P. Habermehl, and Y. Lakhench. Verification of infinite-state systems by combining abstraction and reachability analysis. In Halbwachs and Peled [HP99].
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC