Sciweavers

20 search results - page 4 / 4
» Formalizing Rewriting in the ACL2 Theorem Prover
Sort
View
PPDP
2005
Springer
14 years 2 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...
JUCS
2006
104views more  JUCS 2006»
13 years 8 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
FMSD
2006
131views more  FMSD 2006»
13 years 8 months ago
Specification and analysis of the AER/NCA active network protocol suite in Real-Time Maude
This paper describes the application of the Real-Time Maude tool and the Maude formal methodology to the specification and analysis of the AER/NCA suite of active network multicast...
Peter Csaba Ölveczky, José Meseguer, C...
TCS
2002
13 years 8 months ago
Relating CASL with other specification languages: the institution level
In this work, we investigate various specification languages and their relation to Casl, the recently developed Common Algebraic Specification Language. In particular, we consider...
Till Mossakowski
RTA
2010
Springer
14 years 13 days ago
Certified Subterm Criterion and Certified Usable Rules
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
Christian Sternagel, René Thiemann