Computational Methods with Various Semantics



Over the years, my research has evolved through a sequence of steps that have semantics as their common, underlying topic.

In the traditional case, semantics and syntax (form) are closely related to each other, and therefore, the structure of the description is a precise, deterministic expression of its meaning too.

However, this is often insufficient. For example, automated design of electronic systems requires not only the translation (called synthesis) from an algorithmic description to an electronic design, but also that the design is optimized with respect to its cost and performance. This is an instance in which the meaning of the description can be mapped to a large set of designs with similar functional meaning but different cost and performance attributes. Exploring the ambiguity space of this translation requires trade-off exploration to find the optimized translation.

A more complex situation occurs if the input description must be translated into an equivalent representation, for which the syntax (structure) can be only vaguely used to produce a final representation with equivalent meaning. Exploring the related performance trade-offs is usually part of translation too. This is the case of topology synthesis problems in which the architecture of electronic systems must be produced without being able to use syntax as the only guiding element.


I studied the following specific problems: