Skip to main content
SpringerLink
Log in

Modeling Systems in CLP

  • Conference paper
Logic Programming (ICLP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3668))

Included in the following conference series:

Abstract

Constraint Logic Programming has been successful as a programming language, and more recently, as a model of executable specifications. There have been numerous works which use CLP to model programs and which use an adaptation of the CLP proof system for proving certain properties, for example, the XMC system [3] uses SLG resolution on alternation-free μ-calculus formulas, and the work on deductive model checking [1] model for CTL properties on transition systems represented as CLP rules. These, amongst other works, cover a limited class of programs and use specialized proof methods. In our work, we present a systematic method to model a general class of programs, and provide adaptations of the CLP proof systems in order to provide a systematic and general proof method.

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

Access this chapter

Log in via an institution
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 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. Delzanno, G., Podelski, A.: Constraint-Based Deductive Model Checking. Int. J. STTT (2001)

    Google Scholar 

  2. Jaffar, J., Santosa, A., Voicu, R.: A CLP Proof Method for Timed Automata. In: 25th RTSS (2004)

    Google Scholar 

  3. Ramakrishna, Y.S., et al.: Efficient Model Checking Using Tabled Resolution. In: CAV 1997 (1997)

    Google Scholar 

  4. Roychoudhury, A., et al.: An Unfold/Fold Transformation Framework for Definite Logic Programs. TOPLAS 26(3)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore,  

    Joxan Jaffar, Andrew E. Santosa & Răzvan Voicu

Authors
  1. Joxan Jaffar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew E. Santosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Răzvan Voicu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Maurizio Gabbrielli

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX

    Gopal Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jaffar, J., Santosa, A.E., Voicu, R. (2005). Modeling Systems in CLP. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_34

Download citation

  • DOI: https://doi.org/10.1007/11562931_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29208-1

  • Online ISBN: 978-3-540-31947-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation