RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación
Contribución de congreso (ConferenceOutput)
Towards an Incremental and Modular Termination Analysis of Context-Sensitive Rewriting Systems (Work in Progress)
Modularity is essential in software development, where a piece of software is often designed and implemented as a composition of simpler modules. So, if we want to prove that a program satisfies a given property, a modular approach becomes natural. With the development and successful use of the Dependency Pair Framework, which rather focuses on the decomposition of termination problems, less attention has been payed to modularity issues (which rather require the opposite approach). But the modular analysis of termination is still paramount for software developers. In this paper, we analyze modularity of context-sensitive rewrite systems. A modularity analysis was carried out by Gramlich and Lucas in 2002, but a correct notion of context-sensitive dependency pair (CS-DP) was not obtained until 2006. In this paper, we analyze modularity using CS-DPs., Partially supported by the EU (FEDER), MINECO projects TIN2010-21062-C02-02 and TIN 2013-45732-C4-1-P, and project PROMETEO/2011/052. Salvador Lucas’ research was developed during a sabbatical year at the CS Dept. of the UIUC and was also partially supported by NSF grant CNS 13-19109, Spanish MECD grant PRX12/00214, and GV grant BEST/2014/026. Raúl Gutiérrez is also partially supported by a Juan de la Cierva Fellowship from the Spanish MINECO, ref. JCI-2012-13528.
Proyecto:
Ministerio de Ciencia e Innovación TIN2010-21062-C02-02
,
National Science Foundation 1319109
,
China TIN2013-45732-C4-1-P
,
Ministerio de Economía y Competitividad PROMETEO/2011/052
,
Generalitat Valenciana BEST/2014/026
,
Generalitat Valenciana PRX12/00214
,
Ministerio de Educación y Cultura JCI-2012-13528