AbstractModes 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 dead-locks 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
We study the properties of input-consuming derivations of moded logic programs. Input-consuming deri...
Formal verification techniques such as theorem proving, runtime verification, and model checking hav...
Abstract. We provide here a systematic comparative study of the relative strength and expressive pow...
Modes were introduced in logic programming to differentiate the input arguments of a predicate from ...
AbstractModes were introduced in logic programming to differentiate the input arguments of a predica...
We introduce here layered modes, an extension of existing mode systems which allow us to enlarge the...
Abstract In this thesis we look at mode analysis of logic programs. Being based on the mathematical ...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
In a previous paper we presented a high level polymorphic mode system for logic programs. In this pa...
We present verification methods for logic programs with delay declarations, showing how type and ins...
We show how termination of logic programs with delay declarations can be proven. Three features are ...
. Logic programs augmented with delay declarations form a higly expressive programming language in w...
We define and prove correct a mode checker for a significant fragment of the concurrent logical fram...
We study the properties of input-consuming derivations of moded logic programs. Input-consuming deri...
We study the properties of input-consuming derivations of moded logic programs. Input-consuming deri...
Formal verification techniques such as theorem proving, runtime verification, and model checking hav...
Abstract. We provide here a systematic comparative study of the relative strength and expressive pow...
Modes were introduced in logic programming to differentiate the input arguments of a predicate from ...
AbstractModes were introduced in logic programming to differentiate the input arguments of a predica...
We introduce here layered modes, an extension of existing mode systems which allow us to enlarge the...
Abstract In this thesis we look at mode analysis of logic programs. Being based on the mathematical ...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
In a previous paper we presented a high level polymorphic mode system for logic programs. In this pa...
We present verification methods for logic programs with delay declarations, showing how type and ins...
We show how termination of logic programs with delay declarations can be proven. Three features are ...
. Logic programs augmented with delay declarations form a higly expressive programming language in w...
We define and prove correct a mode checker for a significant fragment of the concurrent logical fram...
We study the properties of input-consuming derivations of moded logic programs. Input-consuming deri...
We study the properties of input-consuming derivations of moded logic programs. Input-consuming deri...
Formal verification techniques such as theorem proving, runtime verification, and model checking hav...
Abstract. We provide here a systematic comparative study of the relative strength and expressive pow...