Titlebook: Logical Foundations of Computer Science - Tver ‘92; Second International Anil Nerode,Mikhail Taitslin Conference proceedings 1992 Springer-

Carcinogenesis

Strictness logic and polymorphic invariance,er on certain closed subsets of domains. The axiomatisation of the lattice of strictness properties is shown to be sound and complete, and we then give a program logic for assigning properties to terms. This places work on strictness analysis via type inference on a firm theoretical foundation. We t

Eructation

,The Ehrenfeucht-Fraïssé games for transitive closure,with generalized quantifiers was known before, the exact formulation of these games for the predicate transformers arising from various transitive-closure-like operations is new. The games are sound and complete both for finite and infinite models. Combined with well known theorems of Fagin and Imme

难听的声音

Feasibility of finite and infinite paths in data dependent programs,s the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is d

新奇

An interleaving model for real-time systems,the natural numbers, or dense, such as the rationals or the reals. We extend the notion of strong bisimulation to timed processes and show that the largest strong bisimulation is decidable. The decidability is independent of the choice of the time domain.

fatuity

把手

Accommodation

Many-valued non-monotonic modal logics,ce of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been established concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This

禁令

incredulity

defenses

A constructive proof that tree are well-quasi-ordered under minors (detailed abstract), polynomial time algorithms. However, partially because of their non-constructive nature, these proofs do not yield any information about the algorithms. Here we present a constructive proof that trees are well-quasi-ordered under minors. This extends the results of Murty and Russell [MR90] who give