We present a theory of abstraction for the framework of parameterised Boolean equation systems, a first-order fixpoint logic. Parameterised Boolean equation systems can be used to solve a variety of problems in verification. We study the capabilities of the abstraction theory by comparing it to an abstraction theory for Generalised Kripke modal Transition Systems (GTSs). We show that for model checking the modal µ-calculus, our abstractions can be exponentially more succinct than GTSs and our theory is as complete as the GTS framework for abstraction. Furthermore, we investigate the completeness of our theory irrespective of the encoded decision problem. We illustrate the potential of our theory through case studies using the first-order mo...
Standard abstract model checking relies on abstract Kripke structures which approximate the concrete...
Boolean equation systems are sequences of least and greatest fixpoint equations interpreted over the...
Boolean equation systems are sequences of least and greatest fixpoint equations interpreted over the...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
AbstractWe propose a procedure for automatically verifying properties (expressed in an extension of ...
Abstract. Standard abstract model checking relies on abstract Kripke structures which approximate th...
We propose a procedure for automatically verifying properties (expressed in an extension of the moda...
Standard abstract model checking relies on abstract Kripke structures which approximate the concrete...
Boolean equation systems are sequences of least and greatest fixpoint equations interpreted over the...
Boolean equation systems are sequences of least and greatest fixpoint equations interpreted over the...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a theory of abstraction for the framework of parameterised Boolean equation systems, a fi...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
AbstractWe propose a procedure for automatically verifying properties (expressed in an extension of ...
Abstract. Standard abstract model checking relies on abstract Kripke structures which approximate th...
We propose a procedure for automatically verifying properties (expressed in an extension of the moda...
Standard abstract model checking relies on abstract Kripke structures which approximate the concrete...
Boolean equation systems are sequences of least and greatest fixpoint equations interpreted over the...
Boolean equation systems are sequences of least and greatest fixpoint equations interpreted over the...