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 syntax of an imperative language does not mention explicitly the state, while i...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
In dieser Arbeit wird ein Ansatz zur Verifikation von Statecharts mit unendlichen Daten vorgestellt....
AbstractVerification of imperative programs means reasoning about modifications of a program state. ...
Most verification approaches embed a model of program state into their semantic treatment. Though a ...
We present an approach for verifying Statecharts including infinite data spaces. We devise a techniq...
Abstract. We present a scalable, practical Hoare Logic and refinement calculus for the nondeterminis...
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...
During the last two decades, we modelled the behaviour of a large number of systems. We noted that d...
This dissertation shows how systems of many concurrent components, which naively engender intractab...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
From 29 August 2010 to 3 September 2010, the Dagstuhl Seminar 10351 ``Modelling, Controlling and Rea...
We propose composed strings called ”statechart DNA” as essential building blocks for a new statechar...
It is generally agreed that the unrestricted use of state can make a program hard to understand, har...
National audienceThe syntax of an imperative language does not mention explicitly the state, while i...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
In dieser Arbeit wird ein Ansatz zur Verifikation von Statecharts mit unendlichen Daten vorgestellt....
AbstractVerification of imperative programs means reasoning about modifications of a program state. ...
Most verification approaches embed a model of program state into their semantic treatment. Though a ...
We present an approach for verifying Statecharts including infinite data spaces. We devise a techniq...
Abstract. We present a scalable, practical Hoare Logic and refinement calculus for the nondeterminis...
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...
During the last two decades, we modelled the behaviour of a large number of systems. We noted that d...
This dissertation shows how systems of many concurrent components, which naively engender intractab...
The growing complexity and diversity of models used for engineering dependable systems implies that ...
From 29 August 2010 to 3 September 2010, the Dagstuhl Seminar 10351 ``Modelling, Controlling and Rea...
We propose composed strings called ”statechart DNA” as essential building blocks for a new statechar...
It is generally agreed that the unrestricted use of state can make a program hard to understand, har...
National audienceThe syntax of an imperative language does not mention explicitly the state, while i...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
In dieser Arbeit wird ein Ansatz zur Verifikation von Statecharts mit unendlichen Daten vorgestellt....