金沢大学理工研究域電子情報学系There are two ways to describe a state machine as an algebraic specification: a behavioral specification and a rewrite specification. In this study, we propose a translation system from behavioral specifications to rewrite specifications to obtain a verification system which has the strong points of verification techniques for both specifications. Since our translation system is complete with respect to invariant properties, it helps us to obtain a counter-example for an invariant property through automatic exhaustive searching for a rewrite specification. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers
Abstract Due to increasing amount of concurrency, systems have become difficult to design and analys...
The amount of user interaction is the prime cause of costs in interactiveprogram verification. This ...
Abstract. The goal of the project is to employ techniques from term rewriting to verification proble...
There are two ways to describe a state machine as an algebraic specification: a behavioral specifica...
Specification translation plays an important part in the integration of theorem proving and model ch...
Specifications of state machines in CafeOBJ are called equational theory specifications (EQT Specs) ...
Behavioral specification is an important algebraic method in software technology. A subtle aspect of...
Following the development of formalisms based on data and behavioural aspects of the system, there a...
The amount of user interaction is the prime cause of costs in interactive program verification. This...
AbstractIn this paper we propose to employ Rewriting Logic as a generic and uniform approach to supp...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
The amount of user interaction is the prime cause of costs in interactive program verification. This...
This paper is an initial step in the development of a logic for verifying properties of programs in ...
The goal of the project is to employ techniques from term rewriting to verification problems. The re...
One can distinguish two specification levels: a system specification level, in which the computation...
Abstract Due to increasing amount of concurrency, systems have become difficult to design and analys...
The amount of user interaction is the prime cause of costs in interactiveprogram verification. This ...
Abstract. The goal of the project is to employ techniques from term rewriting to verification proble...
There are two ways to describe a state machine as an algebraic specification: a behavioral specifica...
Specification translation plays an important part in the integration of theorem proving and model ch...
Specifications of state machines in CafeOBJ are called equational theory specifications (EQT Specs) ...
Behavioral specification is an important algebraic method in software technology. A subtle aspect of...
Following the development of formalisms based on data and behavioural aspects of the system, there a...
The amount of user interaction is the prime cause of costs in interactive program verification. This...
AbstractIn this paper we propose to employ Rewriting Logic as a generic and uniform approach to supp...
This paper proposes the development of a logic for verifying properties of programs in rewriting log...
The amount of user interaction is the prime cause of costs in interactive program verification. This...
This paper is an initial step in the development of a logic for verifying properties of programs in ...
The goal of the project is to employ techniques from term rewriting to verification problems. The re...
One can distinguish two specification levels: a system specification level, in which the computation...
Abstract Due to increasing amount of concurrency, systems have become difficult to design and analys...
The amount of user interaction is the prime cause of costs in interactiveprogram verification. This ...
Abstract. The goal of the project is to employ techniques from term rewriting to verification proble...