This paper discusses aspects of the planning of explanatory texts for logic based systems. It presentsa methodfor derivingNaturalLanguagetext plansfrom Natural Deduction-basedstru...
Clarisse Sieckenius de Souza, Maria das Graç...
Abstract. Context unification (CU) is the open problem of solving context equations for trees. We distinguish a new decidable variant of CU? well-nested CU ? and present a new unif...
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
We present an original method for generating monitors that capture the occurrence of events, specified by logical and temporal properties under the form of assertions in declarati...
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...