- University of California at Santa Cruz
martedì 27 aprile 2004
Traditional type systems specify interfaces in terms of valuesand domains. When we apply a function to an argument, or when we compose two functions, we have to check that their types match.This talk will present timed interfaces, which extend such type systems with the ability to reason about the dynamic behavior of software components. Like type systems,interfaces specify both the input assumptions a component makes onits environment and the output guarantees it provides. For instance,they can specify the temporal order in which method calls occurand the timing constaints that are needed for a component towork correctly.Two interfaces are compatible if is at least on environment in which their input assumptions are met.Our theory provides algorithms for checking the compatibility between two interfaces and for deriving the composite interface.Technically, an interface is game in which the system plays against the environment. Hence, the algorithms for checking compatibility and interface composition are game-theoretic in nature.