Towards a Framework for Proving Termination of Maude Programs
Maude es un lenguaje de programación declarativo basado en la lógica de reescritura que incorpora muchas características que lo hacen muy potente. Sin embargo, a la hora de probar ciertas propiedades computacionales esto conlleva dificultades. La tarea de probar la terminación de sistemas de rees...
Main Author: | Alarcón Jiménez, Beatriz |
---|---|
Other Authors: | Lucas Alba, Salvador |
Format: | Doctoral Thesis |
Language: | English |
Published: |
Universitat Politècnica de València
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10251/11003 |
Similar Items
-
A Rewriting-based, Parameterized Exploration Scheme for the Dynamic Analysis of Complex Software Systems
by: Frechina Navarro, Francisco
Published: (2014) -
Rewriting Logic Techniques for Program Analysis and Optimization
by: Sapiña Sanchis, Julia
Published: (2018) -
Formalizing Complex Event Processing Systems in Maude
by: Loli Burgueno, et al.
Published: (2018-01-01) -
Abstract Certification of Java Programs in Rewriting Logic
by: Alba Castro, Mauricio Fernando
Published: (2011) -
Logic-based techniques for program analysis and specification synthesis
by: Feliú Gabaldón, Marco Antonio
Published: (2013)