We introduce a class of coalgebraic models and a family of modal logics that support the specication of spatial properties of distributed applications. The evaluation of a formul...
Software coordination and adaptation is intimately related to software (modular) pieces and access points. These pieces (components or services) may be complex, dissimilar (various...
In the domain of software engineering, the use of software components is now a well established approach. However, it raises problems about the dynamic adaptation of these compone...
Christophe Sibertin-Blanc, Philippe Mauran, G&eacu...
Formal sequentialization is introduced as a rewriting process for the reduction of parallelism and internal communication statements of distributed imperative programs. It constru...
Miquel Bertran, Francesc-Xavier Babot, August Clim...
Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possi...
The timed concurrent constraint programming language (tccp in short) was introduced for modeling reactive systems. This language allows one to model in a very intuitive way typica...
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
Refactorings are changes made to programs, models or specifications with the intention of improving their structure and thus making them clearer, more readable and re-usable. Ref...
H.-Christian Estler, Thomas Ruhroth, Heike Wehrhei...