SMT-Based Checking of SOLOIST over Sparse Traces

  • Marcello Maria Bersani
  • Domenico Bianculli
  • Carlo Ghezzi
  • Srđan Krstić
  • Pierluigi San Pietro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8411)


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 temporal logic with aggregate temporal modalities; it has been defined based on a field study on the use of specification patterns in the context of the provisioning of service-based applications. We apply bounded satisfiability checking to perform trace checking of service execution traces against requirements expressed in SOLOIST. In particular, we focus on sparse traces, i.e., traces in which the number of time instants when events occur is very low with respect to the length of the trace.

The main contribution of this paper is an encoding of SOLOIST formulae into formulae of the theory of quantifier-free integer difference logic with uninterpreted function and predicate symbols. This encoding paves the way for efficient checking of SOLOIST formulae over sparse traces using an SMT-based verification toolkit. We report on the evaluation of the proposed encoding, commenting on its scalability and its effectiveness.


Time Instant Temporal Logic Decision Procedure Service Composition Predicate Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Alur, R., Dill, D.L.: A theory of timed automata. Theoreotical Computer Science 126(2), 183–235 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Basin, D., Klaedtke, F., Marinovic, S., Zălinescu, E.: Monitoring of temporal first-order properties with aggregations. In: Legay, A., Bensalem, S. (eds.) RV 2013. LNCS, vol. 8174, pp. 40–58. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Bersani, M.M., Frigeri, A., Morzenti, A., Pradella, M., Rossi, M., San Pietro, P.: Bounded reachability for temporal logic over constraint systems. In: Proc. of TIME 2010, pp. 43–50. IEEE Computer Society (2010)Google Scholar
  4. 4.
    Bersani, M.M., Frigeri, A., Rossi, M., San Pietro, P.: Completeness of the bounded satisfiability problem for constraint LTL. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 58–71. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Bersani, M.M., Rossi, M., Pietro, P.S.: Deciding continuous-time metric temporal logic with counting modalities. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol. 8169, pp. 70–82. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  6. 6.
    Bersani, M.M., Rossi, M., San Pietro, P.: On the satisfiability of metric temporal logics over the reals. In: Proc. of AVOCS 2013 (2013)Google Scholar
  7. 7.
    Bianculli, D., Ghezzi, C., Pautasso, C., Senti, P.: Specification patterns from research to industry: a case study in service-based applications. In: Proc. of ICSE 2012, pp. 968–976. IEEE Computer Society (2012)Google Scholar
  8. 8.
    Bianculli, D., Ghezzi, C., San Pietro, P.: The tale of SOLOIST: a specification language for service compositions interactions. In: Păsăreanu, C.S., Salaün, G. (eds.) FACS 2012. LNCS, vol. 7684, pp. 55–72. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  9. 9.
    Biere, A., Heljanko, K., Junttila, T.A., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Logical Methods in Computer Science 2(15) (2006)Google Scholar
  10. 10.
    Burattin, A., Sperduti, A.: PLG: A framework for the generation of business process models and their execution logs. In: Muehlen, M.z., Su, J. (eds.) BPM 2010 Workshops. LNBIP, vol. 66, pp. 214–219. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Demri, S., D’Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3), 380–415 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
  13. 13.
    Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Property specification patterns for finite-state verification. In: Proc. of FMSP 1998, pp. 7–15. ACM (1998)Google Scholar
  14. 14.
    Felder, M., Morzenti, A.: Validating real-time systems by history-checking TRIO specifications. ACM Trans. Softw. Eng. Methodol. 3(4), 308–339 (1994)CrossRefGoogle Scholar
  15. 15.
    Finkbeiner, B., Sankaranarayanan, S., Sipma, H.: Collecting statistics over runtime executions. Form. Method Syst. Des. 27, 253–274 (2005)CrossRefzbMATHGoogle Scholar
  16. 16.
    Kindermann, R., Junttila, T.A., Niemelä, I.: Bounded model checking of an MITL fragment for timed automata. CoRR abs/1304.7209 (2013)Google Scholar
  17. 17.
    Konrad, S., Cheng, B.H.C.: Real-time specification patterns. In: Proc. of ICSE 2005, pp. 372–381. ACM (2005)Google Scholar
  18. 18.
    Krstić, S.: Verification of quantitative properties of service-based applications. Master’s thesis, Politecnico di Milano (December 2012)Google Scholar
  19. 19.
    Leitner, P., Hummer, W., Dustdar, S.: A Monitoring Data Set for Evaluating QoS-Aware Service-Based Systems. In: Proc. of PESOS 2012, pp. 67–68 (2012)Google Scholar
  20. 20.
    Mrad, A., Ahmed, S., Hallé, S., Beaudet, É.: BabelTrace: A collection of transducers for trace validation. In: Qadeer, S., Tasiran, S. (eds.) RV 2012. LNCS, vol. 7687, pp. 126–130. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  21. 21.
    Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Trans. Program. Lang. Syst. 1(2), 245–257 (1979)CrossRefzbMATHGoogle Scholar
  22. 22.
    Pradella, M., Morzenti, A., San Pietro, P.: The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties. In: Proc. of ESEC-FSE 2007, pp. 312–320. ACM (2007)Google Scholar
  23. 23.
    Pradella, M., Morzenti, A., San Pietro, P.: Bounded satisfiability checking of metric temporal logic specifications. ACM Trans. Softw. 20, 1–20 (2013)CrossRefGoogle Scholar
  24. 24.
    Wozna-Szczesniak, B., Zbrzezny, A.: Checking MTL properties of discrete timed automata via bounded model checking. In: CS&P, vol. 1032, pp. 469–477. (2013)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Marcello Maria Bersani
    • 1
  • Domenico Bianculli
    • 2
  • Carlo Ghezzi
    • 1
  • Srđan Krstić
    • 1
  • Pierluigi San Pietro
    • 1
  1. 1.DEEP-SE group - DEIBPolitecnico di MilanoItaly
  2. 2.SnT CentreUniversity of LuxembourgLuxembourg

Personalised recommendations