The development of powerful techniques for proving termination of rewriting modulo a set of equational axioms is essential when dealing with rewriting logic-based programming languages like CafeOBJ, Maude, ELAN, OBJ, etc. ...
In order to automatically infer the resource consumption of programs, analyzers track how data sizes change along a program s execution. Typically, analyzers measure the sizes of data by applying norms which are mappings ...
Lucas Alba, Salvador; Gutiérrez Gil, Raúl(Springer-Verlag, 2018)
[EN] In program analysis, the synthesis of models of logical theories representing the program semantics is often useful to prove program properties. We use order-sorted first- order logic as an appropriate framework to ...
Gutiérrez Gil, Raúl; Lucas Alba, Salvador(2015-05-26)
Context-sensitive rewriting (CSR) is a variant of rewriting where only selected arguments of function symbols can be rewritten. Consequently, the subterm positions of a term are classified as either active, i.e., positions ...
[EN]
In Computer Science and Software Engineering, even at this time, when huge hardware and software resources are available, the problem of checking correctness of an speciﬁc piece of software is a very complicated one. ...
Built-in equality and inequality predicates based on comparison of canonical forms in algebraic specifications are frequently used because they are handy and efficient. However, their use places algebraic specifications ...
Gutiérrez Gil, Raúl; Lucas Alba, Salvador(Sistedes, 2014-09-16)
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 ...
Lucas Alba, Salvador; Gutiérrez Gil, Raúl(Elsevier, 2018)
[EN] Given a (Conditional) Rewrite System R and terms s and t, we consider the following problem: is there a substitution a instantiating the variables in s and t such that the reachability test sigma(s) -> *(R) sigma(t) ...
[EN] Decision procedures can be either theory-specific, e.g., Presburger arithmetic, or theory-generic, applying to an infinite number of user-definable theories. Variant satisfiability is a theory-generic procedure for ...