Specification and verification of active message systems
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
| Hi-index | 0.00 |
Predicate logic is a powerful and general descriptive formalism with a long history of development. However, since the logic''s underlying semantics have no notion of time, statements such as "I increases by 2" cannot be directly expressed. We discuss interval temporal logic (ITL), a formalism that augments standard predicate logic with operators for time-dependent concepts. Our earlier work used ITL to specify and reason about hardware. In this paper we show how ITL can also directly capture various control structures found in conventional programming languages. Constructs are given for treating assignment, iteration, sequential and parallel computations and scoping. The techniques used permit specification and reasoning about such algorithms as concurrent Quicksort. We compare ITL with the logic-based programming languages Lucid and Prolog.