The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to cooperate in order to reach some common goal even though they meet dynamically and do not have a priori knowledge of each other. Despite numerous efforts have been done in the literature, the automated and run-time inter...

A model of user behaviour based automated planning is introduced in this work. The behaviour of users of web interactive systems can be described in term of a planning domain encapsulating the timed actions patterns representing the intended user profile. The user behaviour recognition is then posed as a planning problem where the goal is to parse a given sequence of user logs of the observed a...

The synthesis of peptides rich in aggregation prone sequences can be improved with backbone protection. We report the automated introduction of backbone protection to a peptide. This new method was applied in a fully-automated synthesis, giving improved handling, quality and yield of several challenging target sequences.

This paper presents the program synthesis system IOSS (Integrated Open Synthesis System). It is based on the concept of strategy as a uniform representation of development knowledge making the integration of diierent synthesis methods possible. The implemented system is an instantiation of a generic system architecture designed to provide machine support for the application of formal methods in...

In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to industrial development and use of formal-verification tools, the integration of synthesis in the industry is slow. This has to do with theoretical limitations, like the complexity of the problem, algorithmic limitation...

Software synthesis the process of generating complete, general-purpose programs from specifications has become a hot research topic in the past few years. For decades the problem was thought to be insurmountable: the search space of possible programs is far too massive to efficiently traverse. Advances in efficient constraint solving have overcome this barrier, enabling a new generation of effe...