Skip to main content

Run-Time Analysis of Temporal Constrained Objects

  • Conference paper
  • First Online:
Declarative Programming and Knowledge Management (WFLP 2017, WLP 2017, INAP 2017)

Abstract

The programming paradigm of constrained objects is a declarative variant of the object-oriented paradigm wherein objects define the structure of a system and declarative constraints (rather than imperative methods) define its behavior. Constrained objects have many uses in the engineering domain and computation in this paradigm is essentially constraint solving. This paper is concerned with an extension of constrained objects called temporal constrained objects, which are especially appropriate for modeling dynamical systems. The main extensions are series variables and metric temporal operators to declaratively specify time-varying behavior. The language TCOB exemplifies this paradigm and the execution of TCOB programs consists of constraint solving within a time-based simulation framework. One of the challenges in TCOB is identifying errors owing both to the complexity of programs and the underlying constraint solving methods. We address this problem by extracting a run-time trace of the execution of a TCOB program and providing an analysis of the cause of error. The run-time trace also serves as a basis, in many cases, for constructing a finite-state machine which in turn can be used for ‘model-checking’ properties of the system. The paper also presents abstraction techniques for dealing with simulations that result in large state spaces.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. (TOSEM) 20(4), 14 (2011)

    Article  Google Scholar 

  2. Carro Liñares, M., Hermenegildo, M.V.: Visualization designs for constraint logic programming. Upgrade 2(2), 27–34 (2001)

    Google Scholar 

  3. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT press, Cambridge (1999)

    Google Scholar 

  4. Daian, P., et al.: Runtime verification at work: a tutorial. In: Falcone, Y., Sánchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 46–67. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46982-9_5

    Chapter  Google Scholar 

  5. Ducassé, M., Noyé, J.: Logic programming environments: dynamic program analysis and debugging. J. Log. Program. 19, 351–384 (1994)

    Article  MathSciNet  Google Scholar 

  6. Flanagan, C., Qadeer, S.: Predicate abstraction for software verification. In: ACM SIGPLAN Notices, vol. 37, pp. 191–202. ACM (2002)

    Google Scholar 

  7. Jayaraman, B., Tambay, P.: Modeling engineering structures with constrained objects. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol. 2257, pp. 28–46. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45587-6_4

    Chapter  Google Scholar 

  8. Kannimoola, J.M., Jayaraman, B., Tambay, P., Achuthan, K.: Temporal constrained objects: application and implementation. Comput. Lang. Syst. Struct. 49, 82–100 (2017)

    Google Scholar 

  9. Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Log. Algebr. Program. 78(5), 293–303 (2009)

    Article  Google Scholar 

  10. Maggi, F.M., Westergaard, M., Montali, M., van der Aalst, W.M.P.: Runtime verification of LTL-based declarative process models. In: Khurshid, S., Sen, K. (eds.) RV 2011. LNCS, vol. 7186, pp. 131–146. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29860-8_11

    Chapter  Google Scholar 

  11. Matlab: Introduction: PID Controller Design (2015). http://ctms.engin.umich.edu/CTMS/index.php?example=Introduction&section=ControlPID

  12. Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-prolog. Theory Pract. Log. Program. 12(1–2), 67–96 (2012)

    Article  MathSciNet  Google Scholar 

  13. Ziarek, L., Jayaraman, B., Lessa, D., Swaminathan, J.: Runtime visualization and verification in JIVE. In: Falcone, Y., Sánchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 493–497. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46982-9_33

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jinesh M. Kannimoola .

Editor information

Editors and Affiliations

Appendix

Appendix

1.1 A. TCOB Grammar

1.2 B. PID Controller

figure i

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kannimoola, J.M., Jayaraman, B., Achuthan, K. (2018). Run-Time Analysis of Temporal Constrained Objects. In: Seipel, D., Hanus, M., Abreu, S. (eds) Declarative Programming and Knowledge Management. WFLP WLP INAP 2017 2017 2017. Lecture Notes in Computer Science(), vol 10997. Springer, Cham. https://doi.org/10.1007/978-3-030-00801-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00801-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00800-0

  • Online ISBN: 978-3-030-00801-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics