P. Kelb, D. Dams, and R. Gerth. Efficient symbolic model-checking for the full ¯- calculus using compositional abstractions. Technical Report Computing Science Reports 95/31, Eindhoven University of Technology, October 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Construction of abstract state graphs with PVS - Graf, Saidi (1997) (188 citations) (Correct)
....abstraction techniques are useful, and even necessary for a successful verification [Kur94, CGL94, GL93, LGS 95, Gra95, Dam96] DF95] However, in case that the system has an infinite state space, it is difficult to mechanize the construction of an abstract system or state graph. In [GL93, KDG95] tools are described which, given a system (with variables on finite domains) a set of abstract (boolean) variables, and an abstraction relation relating the concrete and the abstract variables, construct automatically a corresponding abstract system, which then may be analyzed by any ....
P. Kelb, D. Dams, and R. Gerth. Efficient symbolic model-checking for the full ¯- calculus using compositional abstractions. Technical Report Computing Science Reports 95/31, Eindhoven University of Technology, October 1995.
Construction of state graphs with PVS - Graf, Saidi (Correct)
....that abstraction techniques are useful, and even necessary for a successful verification [Kur94,CGL94,GL93,LGS 95,Gra95,Dam96] DF95] However, in case that the system has an infinite state space, it is difficult to mechanize the construction of an abstract system or state graph. In [GL93,KDG95] tools are described which, given a system (with variables on finite domains) a set of abstract (boolean) variables, and an abstraction relation relating the concrete and the abstract variables, construct automatically a corresponding abstract system, which then may be analyzed by any ....
P. Kelb, D. Dams, and R. Gerth. Efficient symbolic model-checking for the full ¯-calculus using compositional abstractions. Tech Rep 31, TU Eindhoven, 1995.
Construction of state graphs of infinite systems with PVS - Graf, Saidi (Correct)
....abstraction techniques are useful, and even necessary for a successful verification [Kur94, CGL94, GL93, LGS 95, Gra95, Dam96] DF95] However, in case that the system has an infinite state space, it is difficult to mechanize the construction of an abstract system or state graph. In [GL93, KDG95] tools are described which, given a system (with variables on finite domains) a set of abstract (boolean) variables, and an abstraction relation relating the concrete and the abstract variables, construct automatically a corresponding abstract system, which then may be analyzed by any ....
P. Kelb, D. Dams, and R. Gerth. Efficient symbolic model-checking for the full ¯- calculus using compositional abstractions. Technical Report Computing Science Reports 95/31, Eindhoven University of Technology, October 1995.
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