- -

Towards Erlang Verification by Term Rewriting

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Towards Erlang Verification by Term Rewriting

Show full item record

Vidal Oriola, GF. (2013). Towards Erlang Verification by Term Rewriting. En Logic-Based Program Synthesis and Transformation. Springer. 109-126. doi:10.1007/978-3-319-14125-1_7

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/72831

Files in this item

Item Metadata

Title: Towards Erlang Verification by Term Rewriting
Author:
UPV Unit: Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica
Issued date:
Abstract:
This paper presents a transformational approach to the verification of Erlang programs. We define a stepwise transformation from (first-order) Erlang programs to (non-deterministic) term rewrite systems that compute an ...[+]
Copyrigths: Reserva de todos los derechos
ISBN: 978-3-319-14124-4
Source:
Logic-Based Program Synthesis and Transformation. (issn: 0302-9743 )
DOI: 10.1007/978-3-319-14125-1_7
Publisher:
Springer
Publisher version: http://link.springer.com/chapter/10.1007/978-3-319-14125-1_7
Conference name: 23rd International Symposium on Logic Based Program Synthesis and Transformation (LOPSTR 2013)
Conference place: Madrid, Spain
Conference date: September 18-19, 2013
Series: Lecture Notes in Computer Science;8901
Description: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-14125-1_7
Type: Capítulo de libro Comunicación en congreso

This item appears in the following Collection(s)

Show full item record