Learn More
We introduce bounded satisfiability checking, a verification technique that extends bounded model checking by allowing also the analysis of a <i>descriptive model</i>, consisting of temporal logic formulae, instead of the more customary <i>operational model</i>, consisting of a state transition system. We define techniques for encoding temporal logic(More)
The implementation of context-aware systems can be supported through the adoption of techniques at the architectural level such as middlewares or component-oriented architectures. It can also be supported by suitable constructs at the programming language level. Context-oriented programming (COP) is emerging as a novel paradigm for the implementation of(More)
Tile Rewriting Grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into a isometric one tiled with specified tiles. Derivation and language generation with TRG rules are similar to context-free grammars. A normal form and some closure properties are presented. We prove this model has(More)
Self-adapting systems are becoming widespread in emerging fields such as autonomic, mobile and ubiquitous computing. Context-oriented programming (COP) is a promising language-level solution for the implementation of context-aware, self-adaptive software. However, current COP approaches struggle to effectively manage the asynchronous nature of context(More)
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over &#969;-words, i.e., infinite in the future but finite in the past. However, time with also an infinite past is a useful abstraction in specification. It allows one to ignore the complexity of system initialization in much the same way as system(More)
Software applications are increasingly situated in a world where context changes continuously. At the same time, applications need to provide continuous service, and the service provided often needs to change in order to adapt to the new contexts. Context-aware adaptation can be greatly facilitated by using programming languages that natively support(More)
This paper presents a novel approach to the design of self-adaptive service-oriented applications based on a new model called service tiles. The approach allows designers to develop a service-oriented system by building an assembly of component services that accomplishes the given goal. The assembly is computed automatically starting from the specification(More)
In bounded model checking (BMC) a system is modeled with a finite automaton and various desired properties with temporal logic formulae. Property verification is achieved by translation into boolean logic and the application of SAT-solvers. bounded satisfiability checking (BSC) adopts a similar approach, but both the system and the properties are modeled(More)
Public reporting bunlen for ttiis collection of InfonnaHon is estimatsd to average 1 hour per response, including the time for reviewing instnictions, seaiching existing data sources, gathering and maintaining the data needed, and oomi^eling and remewing this cr^lectlon of InformaBon. Send canments regarding ttils bunJen estimate or any other aspect of this(More)