AbstractVerification of imperative programs means reasoning about modifications of a program state. So proper representation of state spaces is crucial for the usability of a corresponding verification environment. In this paper we discuss various existing state space models under different aspects like strong typing, modularity and scalability. We also propose a variant based on the locale infrastructure of Isabelle. Thus we manage to combine the advantages of previous formulations (without suffering from their disadvantages), and gain extra flexibility in composing state space components (inherited from the modularity of locales)
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
We present a general framework which allows to identify complex theories important in verification f...
International audienceIn order to gain a better understanding of the state space of programs, with t...
AbstractVerification of imperative programs means reasoning about modifications of a program state. ...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
239 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.Programs are called stateful ...
Verifying system specifications using traditional model-checking techniques rapidly be- comes infeas...
Abstract. Modular state spaces [CP00,LP04] turned out to be an effi-cient analysis technique in many...
We present an approach for verifying Statecharts including infinite data spaces. We devise a techniq...
This paper demonstrates the pontential of verification based on state spaces reduced by equivalence ...
The generic proof assistant Isabelle provides a landscape of specification contexts that is consider...
Abstract. We present a scalable, practical Hoare Logic and refinement calculus for the nondeterminis...
Abstract. This paper explores the concept of locality in proofs of global safety properties of async...
Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a m...
This paper describes a methodology for developing and verifying a class of distributed systems inwhi...
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
We present a general framework which allows to identify complex theories important in verification f...
International audienceIn order to gain a better understanding of the state space of programs, with t...
AbstractVerification of imperative programs means reasoning about modifications of a program state. ...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
239 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2001.Programs are called stateful ...
Verifying system specifications using traditional model-checking techniques rapidly be- comes infeas...
Abstract. Modular state spaces [CP00,LP04] turned out to be an effi-cient analysis technique in many...
We present an approach for verifying Statecharts including infinite data spaces. We devise a techniq...
This paper demonstrates the pontential of verification based on state spaces reduced by equivalence ...
The generic proof assistant Isabelle provides a landscape of specification contexts that is consider...
Abstract. We present a scalable, practical Hoare Logic and refinement calculus for the nondeterminis...
Abstract. This paper explores the concept of locality in proofs of global safety properties of async...
Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a m...
This paper describes a methodology for developing and verifying a class of distributed systems inwhi...
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
We present a general framework which allows to identify complex theories important in verification f...
International audienceIn order to gain a better understanding of the state space of programs, with t...