AbstractThe Verification Logic for Rewriting Logic (VLRL) is a modal action logic in which rewrite rules are captured as actions. This paper studies a possible representation of the VLRL action formulae using the Next and the Until operators of Linear Temporal Logic (LTL). In particular, it studies the use of the Maude model checker to prove VLRL action formulae. Action modalities of VLRL fix the transition that will take place in a state and the context in which it will be applied, while LTL operators do not. Thus, to represent action modalities in LTL it is necessary to transform the initial rewrite theory into a new one in which the states carry the information about the transitions used and the context in which they have taken place. VL...
AbstractThis paper describes in detail how to bridge the gap between theory and practice when implem...
Abstract. We establish a decidability boundary of the model checking problem for infinite-state syst...
Rewriting logic is proposed as a logic of concurrent action and change that solves the frame problem...
AbstractThe Verification Logic for Rewriting Logic (VLRL) is a modal action logic in which rewrite r...
AbstractThis paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TL...
This paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TLR ∗ exte...
This paper is an initial step in the development of a logic for verifying properties of programs in ...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
AbstractRewriting logic is a very expressive formalism for the specification of concurrent and distr...
This paper presents the temporal logic of rewriting TLR*. Syntactically, TLR* is a very simple exten...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
This paper presents the linear temporal logic of rewriting (LTLR) model checker under localized fair...
AbstractThe work presented here aims at bridging the gap between executable specifications and forma...
AbstractIn this paper, a rewrite theory for checking μ-calculus properties is developed. We use the ...
International audienceIn the regular model-checking framework, reachability analysis can be guided b...
AbstractThis paper describes in detail how to bridge the gap between theory and practice when implem...
Abstract. We establish a decidability boundary of the model checking problem for infinite-state syst...
Rewriting logic is proposed as a logic of concurrent action and change that solves the frame problem...
AbstractThe Verification Logic for Rewriting Logic (VLRL) is a modal action logic in which rewrite r...
AbstractThis paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TL...
This paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TLR ∗ exte...
This paper is an initial step in the development of a logic for verifying properties of programs in ...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
AbstractRewriting logic is a very expressive formalism for the specification of concurrent and distr...
This paper presents the temporal logic of rewriting TLR*. Syntactically, TLR* is a very simple exten...
AbstractRewriting logic (RL) is a logic of actions whose models are concurrent systems. Rewrite theo...
This paper presents the linear temporal logic of rewriting (LTLR) model checker under localized fair...
AbstractThe work presented here aims at bridging the gap between executable specifications and forma...
AbstractIn this paper, a rewrite theory for checking μ-calculus properties is developed. We use the ...
International audienceIn the regular model-checking framework, reachability analysis can be guided b...
AbstractThis paper describes in detail how to bridge the gap between theory and practice when implem...
Abstract. We establish a decidability boundary of the model checking problem for infinite-state syst...
Rewriting logic is proposed as a logic of concurrent action and change that solves the frame problem...