We present a technique to handle invariants in the branching-time setting, for the specifications written in the formalism called Branching Normal Form (BNF). The language of BNF was previously used as part of the deductive clausal resolution method for a variety of branching-time logics. We show how this framework can tackle useful periodic properties, or invariants. We emphasise the potential power of this approach to the process of reconfiguration of an adaptive system where preserving invariant properties is essential
Abstract. In the domain of concurrent software verication, there is an evident need for specication ...
In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is ba...
Formal methods offer an effective means to assert the correctness of software systems through mathem...
With the emerging applications that involve complex distributed systems branching-time specification...
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques...
AbstractWe present a modular framework for proving temporal properties of real-time systems, based o...
Traditional implementation techniques for temporal logic programming languages are based on the noti...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
This work proposes a deductive reasoning approach to the automatic verification of temporal properti...
Many software artifacts like software architectures or distributed programs are characterized by a h...
AbstractIn this paper, we investigate formal mechanisms to enable designers to decompose specificati...
The authors present a natural deduction calculus for the computation tree logic, CTL, defined with t...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
We extend recent work on defining linear-time behaviour for state-based systems with branching, and ...
Abstract. We study Normative Temporal Logic (ntl), a formalism intended for reason-ing about the tem...
Abstract. In the domain of concurrent software verication, there is an evident need for specication ...
In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is ba...
Formal methods offer an effective means to assert the correctness of software systems through mathem...
With the emerging applications that involve complex distributed systems branching-time specification...
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques...
AbstractWe present a modular framework for proving temporal properties of real-time systems, based o...
Traditional implementation techniques for temporal logic programming languages are based on the noti...
AbstractThe paper presents a relatively complete proof system for proving the validity of temporal p...
This work proposes a deductive reasoning approach to the automatic verification of temporal properti...
Many software artifacts like software architectures or distributed programs are characterized by a h...
AbstractIn this paper, we investigate formal mechanisms to enable designers to decompose specificati...
The authors present a natural deduction calculus for the computation tree logic, CTL, defined with t...
We present the first method for reasoning about temporal logic properties of higher-order, infinite-...
We extend recent work on defining linear-time behaviour for state-based systems with branching, and ...
Abstract. We study Normative Temporal Logic (ntl), a formalism intended for reason-ing about the tem...
Abstract. In the domain of concurrent software verication, there is an evident need for specication ...
In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is ba...
Formal methods offer an effective means to assert the correctness of software systems through mathem...