Abstract. Abstraction reduces the problem of whether an infinite state system satisfies version. The most common abstractions are quotients of the original system. We present a simple method of defining quotient abstractions by means of equations collapsing the set of states. Our method yields the minimal quotient system together with a set of proof obligations that guarantee its executability and can be discharged with tools such as those in the Maude formal environment
Abstract. Abstraction is traditionally used in the process of verification. There, an abstrac-tion o...
We study the problem of how to compute the boolean abstraction of the solution set of a linear equat...
We demonstrate the use of abstraction in aiding the construction of an interesting and difficult exa...
AbstractAbstraction reduces the problem of whether an infinite state system satisfies a temporal log...
We propose a Logic of Abstraction, meant to formalize the act of “abstracting away” the irrelevant f...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a methodology for constructing abstractions and refining them by analyzing counter-exampl...
We study two notions of expressiveness, which have appeared in abstraction theory for model checking...
We present a methodology for constructing abstractions and refining them by analyzing counter-examp...
Abstract. Abstraction is the key for effectively dealing with the state explosionproblem in model-ch...
Abstract. Verification seeks to prove or refute putative properties of a given program. Deductive ve...
Verifying system specifications using traditional model-checking techniques rapidly becomes infeasib...
The advent of ever more complex reactive systems in increasingly critical areas calls for the develo...
The use of abstraction in the context of abstract data types, is investigated. Properties to be chec...
This thesis presents existential abstraction techniques for multi-agent systems preserving temporal-...
Abstract. Abstraction is traditionally used in the process of verification. There, an abstrac-tion o...
We study the problem of how to compute the boolean abstraction of the solution set of a linear equat...
We demonstrate the use of abstraction in aiding the construction of an interesting and difficult exa...
AbstractAbstraction reduces the problem of whether an infinite state system satisfies a temporal log...
We propose a Logic of Abstraction, meant to formalize the act of “abstracting away” the irrelevant f...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a methodology for constructing abstractions and refining them by analyzing counter-exampl...
We study two notions of expressiveness, which have appeared in abstraction theory for model checking...
We present a methodology for constructing abstractions and refining them by analyzing counter-examp...
Abstract. Abstraction is the key for effectively dealing with the state explosionproblem in model-ch...
Abstract. Verification seeks to prove or refute putative properties of a given program. Deductive ve...
Verifying system specifications using traditional model-checking techniques rapidly becomes infeasib...
The advent of ever more complex reactive systems in increasingly critical areas calls for the develo...
The use of abstraction in the context of abstract data types, is investigated. Properties to be chec...
This thesis presents existential abstraction techniques for multi-agent systems preserving temporal-...
Abstract. Abstraction is traditionally used in the process of verification. There, an abstrac-tion o...
We study the problem of how to compute the boolean abstraction of the solution set of a linear equat...
We demonstrate the use of abstraction in aiding the construction of an interesting and difficult exa...