![]() ![]() This process is experimental and the keywords may be updated as the learning algorithm improves. These keywords were added by machine and not by the authors. We show that HOT-PDL model checking of higher-order functional programs over bounded integers is decidable via a reduction to modal \(\mu \)-calculus model checking of higher-order recursion schemes. The extension enables HOT-PDL to specify interesting properties of higher-order programs, including stack-based access control properties and those definable using dependent refinement types. A partial -valuation is a map A0: 0f0 1gwhere 0. In a propositional logic, s s characteristics: only one alphabet, often, consisting of all, , and parentheses, is involved. Preliminaries Propositional Logic Propositional Logic: Semantics 2.2.1 Denition ((Partial) Valuation) A -valuation is a map A: f0 1g: where f0 1gis the set of truth values. Recall that a substitution is a function s: 1 P ( P 2 ) preserving the and concatenation. To allow traversal of the new kinds of pointers, HOT-PDL extends PDL with new path expressions. In this entry, we are mainly interested in propositional logic. A HOT is a sequence of events such as function calls and returns, equipped with two kinds of pointers inspired by the notion of justification pointers from game semantics: one for capturing the correspondence between call and return events, and the other for capturing higher-order control flow involving a function that is passed to or returned by a higher-order function. The semantics of HOT-PDL is defined over Higher-Order Traces (HOTs) that model execution traces of higher-order programs. We present an extension of propositional dynamic logic called HOT-PDL for specifying temporal properties of higher-order functional programs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |