In this paper we show how hierarchical reasoning can be used to verify properties of complex systems. Chains of local theory extensions are used to model a case study taken from the European Train Control System (ETCS) standard, but considerably simplified. We show how testing invariants and bounded model checking (for safety properties expressed by universally quantified formulae, depending on certain parameters of the systems) can automatically be reduced to checking satisfiability of ground formulae over a base theory
We show that many properties studied in mathematical analysis (e.g.\ monotonicity, boundedness, inve...
We show that many properties studied in mathematical analysis (monotonicity, boundedness, inverse, L...
We present a general framework which allows to identify complex theories important in verification f...
AbstractIn this paper we show how hierarchical reasoning can be used to verify properties of complex...
In this paper we show how hierarchical reasoning can be used to verify properties of complex systems...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
We study certain classes of verification problems for parametric reactive and hybrid systems, and id...
International audienceHierarchical automata are used to model hierarchical systems. The semantics us...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
One of the most important objectives of the research in mathematics and computer science is to obtai...
International audienceIn this paper, we are interested in verifying temporal properties of hierarchi...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
We show that many properties studied in mathematical analysis (e.g.\ monotonicity, boundedness, inve...
We show that many properties studied in mathematical analysis (monotonicity, boundedness, inverse, L...
We present a general framework which allows to identify complex theories important in verification f...
AbstractIn this paper we show how hierarchical reasoning can be used to verify properties of complex...
In this paper we show how hierarchical reasoning can be used to verify properties of complex systems...
Many problems occurring in verification can be reduced to proving the satisfiability of conjunctions...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
The goal of this paper is to illustrate the wide applicability in verification of results on local r...
We study certain classes of verification problems for parametric reactive and hybrid systems, and id...
International audienceHierarchical automata are used to model hierarchical systems. The semantics us...
Many problems in computer science can be reduced to proving the satisfiability of conjunctions of li...
One of the most important objectives of the research in mathematics and computer science is to obtai...
International audienceIn this paper, we are interested in verifying temporal properties of hierarchi...
In this paper we study possibilities of using methods for hierarchical reasoning in local theory ext...
In this paper we study theory combinations over non-disjoint signatures in which hierarchical and mo...
We show that many properties studied in mathematical analysis (e.g.\ monotonicity, boundedness, inve...
We show that many properties studied in mathematical analysis (monotonicity, boundedness, inverse, L...
We present a general framework which allows to identify complex theories important in verification f...