Results 11 to 20 of about 1,169,291 (287)
Permission-Based Separation Logic for Message-Passing Concurrency [PDF]
Logical Methods in Computer Science, 2011 We develop local reasoning techniques for message passing concurrent programs based on ideas from separation logics and resource usage analysis. We extend processes with permission- resources and define a reduction semantics for this extended language ...
Adrian Francalanza +2 more
doaj +1 more source
Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism [PDF]
Logical Methods in Computer Science, 2017 We study a propositional variant of Hoare logic that can be used for reasoning about programs that exhibit both angelic and demonic nondeterminism. We work in an uninterpreted setting, where the meaning of the atomic actions is specified axiomatically ...
Konstantinos Mamouras
doaj +1 more source
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +1 more source
Gravitational detection of a low-mass dark satellite at cosmological distance [PDF]
, 2012 The mass-function of dwarf satellite galaxies that are observed around Local Group galaxies substantially differs from simulations based on cold dark matter: the simulations predict many more dwarf galaxies than are seen. The Local Group, however, may be
A Klypin +32 more
core +7 more sources
Typing Copyless Message Passing [PDF]
Logical Methods in Computer Science, 2012 We present a calculus that models a form of process interaction based on copyless message passing, in the style of Singularity OS. The calculus is equipped with a type system ensuring that well-typed processes are free from memory faults, memory leaks ...
Viviana Bono, Luca Padovani
doaj +1 more source
Strong normalisation for applied lambda calculi [PDF]
Logical Methods in Computer Science, 2005 We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations' are.
Ulrich Berger
doaj +1 more source
Adventures in time and space [PDF]
Logical Methods in Computer Science, 2007 This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its first-order programs characterize the polynomial-time computable functions, and its
Norman Danner, James S. Royer
doaj +1 more source
On Global Types and Multi-Party Session [PDF]
Logical Methods in Computer Science, 2012 Global types are formal specifications that describe communication protocols in terms of their global interactions. We present a new, streamlined language of global types equipped with a trace-based semantics and whose features and restrictions are ...
Giuseppe Castagna +2 more
doaj +1 more source
Parameterised Multiparty Session Types [PDF]
Logical Methods in Computer Science, 2012 For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time.
Pierre-Malo Denielou +3 more
doaj +1 more source
Linear-use CPS translations in the Enriched Effect Calculus [PDF]
Logical Methods in Computer Science, 2012 The enriched effect calculus (EEC) is an extension of Moggi's computational metalanguage with a selection of primitives from linear logic. This paper explores the enriched effect calculus as a target language for continuation-passing-style (CPS ...
Jeff Egger +2 more
doaj +1 more source