We introduce bounded satisfiability checking, a verification technique that extends bounded
model checking by allowing also the analysis of a descriptive model, consisting of temporal …

Abstract Service-based applications are a new class of software systems that provide the
basis for enterprises to build their information systems by following the principles of service …

The paper presents the EU funded MADES FP7 project, that aims to develop an effective
model driven methodology to evolve current practices for the development of real time …

Service-oriented applications are typically built out of existing web-services (WSs) possibly
made available by third party vendors. This requires that the application has to be able to …

This paper defines CLTLB (D), an extension of PLTLB (PLTL with both past and future
operators) augmented with atomic formulae built over a constraint system D. The paper …

We present WECTL* KD, a weighted branching time temporal logic to specify knowledge,
and correct functioning behaviour in multi-agent systems (MAS). We interpret the formulae of …

We investigate the satisfiability problem for metric temporal logic (MTL) with both past and
future operators over linear discrete bi-infinite time models isomorphic to the integer …

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 …

SMT solvers have been recently applied to bounded model checking and satisfiability
checking of metric temporal logic. In this paper we consider SOLOIST, an extension of metric …

In embedded system design, memory is one of the most restricted resources. Code
compression has been proposed as a solution to reduce the code size of applications for …