Sciweavers

36 search results - page 4 / 8
» Teaching Formal Methods Based on Rewriting Logic and Maude
Sort
View
JUCS
2006
131views more  JUCS 2006»
13 years 5 months ago
Verification of CRWL Programs with Rewriting Logic
Abstract: We present a novel approach to the verification of functional-logic programs. For our verification purposes, equational reasoning is not valid due to the presence of non-...
José Miguel Cleva, Isabel Pita
JOT
2010
144views more  JOT 2010»
13 years 4 months ago
A Tool for Specifying and Validating Agents' Interaction Protocols: From Agent UML to Maude
To achieve the multi-agent systems’ goals, agents interact to exchange information, to cooperate and to coordinate their tasks. Interaction is generally recognized as an importa...
Farid Mokhati, Brahim Sahraoui, Soufiane Bouzaher,...
ENTCS
2007
144views more  ENTCS 2007»
13 years 5 months ago
Partial Order Reduction for Rewriting Semantics of Programming Languages
Software model checkers are typically language-specific, require substantial development efforts, and are hard to reuse for other languages. Adding partial order reduction (POR)...
Azadeh Farzan, José Meseguer
ASE
2005
137views more  ASE 2005»
13 years 5 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
PPDP
2005
Springer
13 years 11 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...