Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

DDDLIB: A Library for Solving Quantified Difference Inequalities

  • Conference paper
  • First Online:
Automated Deduction—CADE-18 (CADE 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2392))

Included in the following conference series:

  • 405 Accesses

Abstract

DDDLIB is a library for manipulating formulae in a first-order logic over Boolean variables and inequalities of the form x 1 x 2 ≤ d, where x 1,x 2 are real variables and d is an integer constant. Formulae are represented in a semi-canonical data structure called difference decision diagrams (DDDs) which provide efficient algorithms for constructing formulae with the standard Boolean operators (conjunction, disjunction, negation, etc.), eliminating quantifiers, and deciding functional properties (satisfiability, validity and equivalence). The library is written in C and has interfaces for C++, Standard ML and Objective Caml.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. P.A. Abdulla and A. Nylén. Better is better than well: On efficient verification of infinite-state systems. In Proc. 15th LICS, pages 132–140, 2000.

    Google Scholar 

  2. J.F. Allen, H. Kautz, R.N. Pelavin, and J. Tenenberg, editors. Reasoning about Plans. Morgan Kaufmann, San Mateo, California, 1991.

    MATH  Google Scholar 

  3. R. Alur, C. Courcoubetis, and D. Dill. Model-checking for real-time systems. In Proc. 5th LICS, pages 414–425, 1990.

    Google Scholar 

  4. G. Behrmann, K.G. Larsen, J. Pearson, C. Weise, and W. Yi. Efficient timed reachability analysis using clock difference diagrams. In Proc. 11th Conference on Computer Aided Verification, LNCS 1633, pages 341–353, 1999.

    Chapter  Google Scholar 

  5. R. Bellman. On a routing problem. Quarterly of Applied Math., 16(1):87–90, 1958.

    MATH  Google Scholar 

  6. R.E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8):677–691, 1986.

    Article  Google Scholar 

  7. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Workshop on Logics of Programs, LNCS 131, pages 52–71. Springer-Verlag, 1981.

    Chapter  Google Scholar 

  8. A. Dolzmann and T. Sturm. Redlog user manual. Technical Report MIP-9905, FMI, Universität Passau, D-94030 Passau, Germany, April 1999.

    Google Scholar 

  9. J.B.J. Fourier. Second extrait. In Oeuvres, pages 325–328. Gauthiers-Villars, 1890.

    Google Scholar 

  10. M.S. Fox. Constraint-directed Search: A Case Study of Job-Shop Scheduling. Morgan Kaufmann Publishers, 1987.

    Google Scholar 

  11. M. Koubarakis. Complexity results for first-order theories of temporal constraints. In Principles of Knowledge Representation and Reasoning, pages 379–390, 1994.

    Google Scholar 

  12. R.A. Kowalski and M.J. Sergot. A logic-based calculus of events. In Proc. Foundations of Knowledge Base Management, pages 23–55, 1985.

    Google Scholar 

  13. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. on Comp. Systems, 5(1):1–11, 1987.

    Article  Google Scholar 

  14. K.G. Larsen, J. Pearson, C. Weise, and W. Yi. Clock difference diagrams. Nordic Journal of Computing, 6(3):271–298, 1999.

    MATH  MathSciNet  Google Scholar 

  15. K.G. Larsen, P. Pettersson, and W. Yi. Uppaal in a nutshell. International Journal on Software Tools for Technology Transfer, 1(1–2):134–152, 1997.

    MATH  Google Scholar 

  16. J. Lind-Nielsen. BuDDy: Binary Decision Diagram package. IT University of Copenhagen, Glentevej 67, DK-2400 Copenhagen NV, May 2001.

    Google Scholar 

  17. I. Meiri. Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87(1–2):343–385, 1996.

    Article  MathSciNet  Google Scholar 

  18. J. Møller, J. Lichtenberg, H.R. Andersen, and H. Hulgaard. Difference decision diagrams. In Proc. Computer Science Logic, LNCS 1683, pages 111–125, 1999.

    Chapter  Google Scholar 

  19. J.B. Møller. Simplifying fixpoint computations in verification of real-time systems. Technical Report TR-2002-15, IT University of Copenhagen, April 2002.

    Google Scholar 

  20. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on the Foundations of Computer Science, pages 46–57, 1977.

    Google Scholar 

  21. W. Pugh. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Comm. of the ACM, 35(8):102–114, August 1992.

    Google Scholar 

  22. S. Romanenko, C. Russo, and P. Sestoft. Moscow ML Owner’s Manual, June 2000.

    Google Scholar 

  23. M. Sorea. Tempo: A model-checker for event-recording automata. In Proc. Workshop on Real-Time Tools, August 2001. Also as SRI Technical Report CSL-01-04.

    Google Scholar 

  24. S. Yovine. Kronos: A verification tool for real-time systems. International Journal on Software Tools for Technology Transfer, 1(1–2):123–133, October 1997.

    Google Scholar 

  25. H. Zhang. SATO: An efficient propositional prover. In Proc. Conference on Automated Deduction, pages 272–275, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Innovation, IT University of Copenhagen, Denmark

    Jesper B. Møller

Authors
  1. Jesper B. Møller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Manchester, Oxford Rd, Manchester, M13 9PL, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Møller, J.B. (2002). DDDLIB: A Library for Solving Quantified Difference Inequalities. In: Voronkov, A. (eds) Automated Deduction—CADE-18. CADE 2002. Lecture Notes in Computer Science(), vol 2392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45620-1_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45620-1_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43931-8

  • Online ISBN: 978-3-540-45620-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation