Titlebook: Rewriting Logic and Its Applications; 8th International Wo Peter Csaba ?lveczky Conference proceedings 2010 Springer Berlin Heidelberg 2010

人類

Rewriting, Inference, and Proofce? How can rewriters, decision procedures, and their combination be certified? We discuss these problems in the context of our ongoing effort to use PVS as a metatheoretic framework to construct a proof kernel for justifying the claims of theorem provers, rewriters, model checkers, and satisfiability solvers.

善于

領(lǐng)先

Anguish

ILEUM

Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuitsuce the state space of circuits in our formal semantics and investigate the impact of these reductions experimentally. The analysis scales up to circuits of over 100 PRs in spite of the high levels of concurrency involved.

MAOIS

兇兆

The Linear Temporal Logic of Rewriting Maude Model Checkeroperties involving both events and state predicates. This greater expressiveness is gained without compromising performance, because the LTLR implementation minimizes the extra costs involved in handling the events of systems.

insurrection

On the Behavioral Semantics of Real-Time Domain Specific Visual Languagesally generated from the visual specifications. The use of Real-Time Maude provides additional interesting benefits, such as being able to simulate the DSVL specifications or to conduct formal analysis on them.

–吃

fulmination