10,017 research outputs found
A Classical Realizability Model arising from a Stable Model of Untyped Lambda Calculus
We study a classical realizability model (in the sense of J.-L. Krivine)
arising from a model of untyped lambda calculus in coherence spaces. We show
that this model validates countable choice using bar recursion and bar
induction
Linear Logic for Meaning Assembly
Semantic theories of natural language associate meanings with utterances by
providing meanings for lexical items and rules for determining the meaning of
larger units given the meanings of their parts. Meanings are often assumed to
combine via function application, which works well when constituent structure
trees are used to guide semantic composition. However, we believe that the
functional structure of Lexical-Functional Grammar is best used to provide the
syntactic information necessary for constraining derivations of meaning in a
cross-linguistically uniform format. It has been difficult, however, to
reconcile this approach with the combination of meanings by function
application. In contrast to compositional approaches, we present a deductive
approach to assembling meanings, based on reasoning with constraints, which
meshes well with the unordered nature of information in the functional
structure. Our use of linear logic as a `glue' for assembling meanings allows
for a coherent treatment of the LFG requirements of completeness and coherence
as well as of modification and quantification.Comment: 19 pages, uses lingmacros.sty, fullname.sty, tree-dvips.sty,
latexsym.sty, requires the new version of Late
Efficient First-Order Temporal Logic for Infinite-State Systems
In this paper we consider the specification and verification of
infinite-state systems using temporal logic. In particular, we describe
parameterised systems using a new variety of first-order temporal logic that is
both powerful enough for this form of specification and tractable enough for
practical deductive verification. Importantly, the power of the temporal
language allows us to describe (and verify) asynchronous systems, communication
delays and more complex properties such as liveness and fairness properties.
These aspects appear difficult for many other approaches to infinite-state
verification.Comment: 16 pages, 2 figure
Finite Model Finding for Parameterized Verification
In this paper we investigate to which extent a very simple and natural
"reachability as deducibility" approach, originated in the research in formal
methods in security, is applicable to the automated verification of large
classes of infinite state and parameterized systems. The approach is based on
modeling the reachability between (parameterized) states as deducibility
between suitable encodings of states by formulas of first-order predicate
logic. The verification of a safety property is reduced to a pure logical
problem of finding a countermodel for a first-order formula. The later task is
delegated then to the generic automated finite model building procedures. In
this paper we first establish the relative completeness of the finite
countermodel finding method (FCM) for a class of parameterized linear arrays of
finite automata. The method is shown to be at least as powerful as known
methods based on monotonic abstraction and symbolic backward reachability.
Further, we extend the relative completeness of the approach and show that it
can solve all safety verification problems which can be solved by the
traditional regular model checking.Comment: 17 pages, slightly different version of the paper is submitted to
TACAS 201
- …