Titlebook: Specification, Algebra, and Software; Essays Dedicated to Shusaku Iida,José Meseguer,Kazuhiro Ogata Book 2014 Springer-Verlag Berlin Heide

alcohol-abuse

吊胃口

Model Checking TLR* Guarantee Formulas on Infinite Systems,iting-logic language Maude. The model checker is explicit-state, that is, not symbolic. In infinite systems, we cannot expect it to finish in every case: it provides a semi-decision algorithm to validate guarantee formulas (or, equivalently, to falsify safety ones). To avoid getting lost in infinite

echnic

Towards a Combination of CafeOBJ and PAT,based on different formal techniques. CafeOBJ has an evident advantage in specifying concurrent systems with object-oriented methods and proving behavioral properties based on reusability of proof. However, it is difficult to be applied to automatically verify some LTL based properties which involve

CAND

极端的正确性

GAVEL

繁殖

PURG

巧思

Synthesis of Infinite-State Abstractions and Their Use for Software Validation,e proposed approaches addressed the inference of finite-state abstractions. The synthesized abstractions have been integrated in different validation scenarios, such as testing. While finite-state models can be effectively used as models of a software component’s behavior for certain specific purpos

Graduated

Behavioral Rewrite Systems and Behavioral Productivity,tes some of their properties. First, it is shown that, in the case of (infinite) streams, behavioral productivity generalizes and may bring to a more basic rewriting setting the existing notion of stream productivity defined in the context of infinite rewriting and lazy strategies; some arguments ar