Sciweavers

Share
PPDP
2005
Springer

Formal validation of pattern matching code

11 years 5 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. Here, we focus on directly proving the correctness of compiled code issued from powerful pattern matching constructions typical of ML like languages or rewrite based languages such as ELAN, Maude or Tom. In this context, our first contribution is to define a general framework for anchoring algebraic pattern-matching capabilities in existing languages like C, Java or ML. Then, using a just enough powerful intermediate language, we formalize the behavior of compiled code and define the correctness of compiled code with respect to pattern-matching behavior. This allows us to prove the equivalence of compiled code correctness with a generic first-order proposition whose proof could be achieved via a proof assistant or an automated theorem prover. We then extend these results to the multi-match situation char...
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where PPDP
Authors Claude Kirchner, Pierre-Etienne Moreau, Antoine Reilles
Comments (0)
books