65 search results - page 7 / 13 » Program termination and well partial orderings |
FASE
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. This paper describes a specialised logic for proving specifications in the Java Modeling Language (JML). JML is an interface specification language for Java. It allows ...
ENTCS
2002
13 years 8 months ago
2002
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
SLP
1994
13 years 10 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
AGP
1994
IEEE
14 years 21 days ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
TACAS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...