Layered modes

S Etalle*, M Gabbrielli

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Web of Science)

    Abstract

    Modes were introduced in logic programming to differentiate the input arguments of a predicate from its output arguments. This information can be used for verifying the most diverse properties of logic programs, notably absence of run-time errors and absence of deadlocks in presence of delay declarations. We introduce here layered modes, an extension of existing mode systems which allow us to enlarge the class of programs which can be verified by using modes. In particular, we show that this extension allows us to better handle programs that employ a dynamic selection rule and programs that use incomplete data structures such as difference-lists. (C) 1999 Elsevier Science Inc. All rights reserved.

    Original languageEnglish
    Pages (from-to)225-244
    Number of pages20
    JournalJournal of Logic Programming
    Volume39
    Issue number1-3
    DOIs
    Publication statusPublished - 1999

    Keywords

    • logic programming
    • modes
    • dynamic scheduling
    • concurrent logic programs
    • deadlock
    • LOGIC PROGRAMS
    • PROLOG

    Cite this