The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
In order to obtain a suitable model of the universe of discourse of some information systems, it is important to allow the description of imprecise objects with temporal indetermi...
Ed Porto Bezerra, Ulrich Schiel, Bernardo Lula Jr.
Changes in the real world may require both the database population and the database schema to evolve. Particularly, this is the case in CAD/CAM and CASE database systems, in which...