9,599 research outputs found
Towards a homotopy theory of process algebra
This paper proves that labelled flows are expressive enough to contain all
process algebras which are a standard model for concurrency. More precisely, we
construct the space of execution paths and of higher dimensional homotopies
between them for every process name of every process algebra with any
synchronization algebra using a notion of labelled flow. This interpretation of
process algebra satisfies the paradigm of higher dimensional automata (HDA):
one non-degenerate full -dimensional cube (no more no less) in the
underlying space of the time flow corresponding to the concurrent execution of
actions. This result will enable us in future papers to develop a
homotopical approach of process algebras. Indeed, several homological
constructions related to the causal structure of time flow are possible only in
the framework of flows.Comment: 33 pages ; LaTeX2e ; 1 eps figure ; package semantics included ; v2
HDA paradigm clearly stated and simplification in a homotopical argument ; v3
"bug" fixed in notion of non-twisted shell + several redactional improvements
; v4 minor correction : the set of labels must not be ordered ; published at
http://intlpress.com/HHA/v10/n1/a16
A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs
A number of novel programming languages and libraries have been proposed that
offer simpler-to-use models of concurrency than threads. It is challenging,
however, to devise execution models that successfully realise their
abstractions without forfeiting performance or introducing unintended
behaviours. This is exemplified by SCOOP---a concurrent object-oriented
message-passing language---which has seen multiple semantics proposed and
implemented over its evolution. We propose a "semantics workbench" with fully
and semi-automatic tools for SCOOP, that can be used to analyse and compare
programs with respect to different execution models. We demonstrate its use in
checking the consistency of semantics by applying it to a set of representative
programs, and highlighting a deadlock-related discrepancy between the principal
execution models of the language. Our workbench is based on a modular and
parameterisable graph transformation semantics implemented in the GROOVE tool.
We discuss how graph transformations are leveraged to atomically model
intricate language abstractions, and how the visual yet algebraic nature of the
model can be used to ascertain soundness.Comment: Accepted for publication in the proceedings of FASE 2016 (to appear
Formal Concept Analysis and Resolution in Algebraic Domains
We relate two formerly independent areas: Formal concept analysis and logic
of domains. We will establish a correspondene between contextual attribute
logic on formal contexts resp. concept lattices and a clausal logic on coherent
algebraic cpos. We show how to identify the notion of formal concept in the
domain theoretic setting. In particular, we show that a special instance of the
resolution rule from the domain logic coincides with the concept closure
operator from formal concept analysis. The results shed light on the use of
contexts and domains for knowledge representation and reasoning purposes.Comment: 14 pages. We have rewritten the old version according to the
suggestions of some referees. The results are the same. The presentation is
completely differen
Extended Initiality for Typed Abstract Syntax
Initial Semantics aims at interpreting the syntax associated to a signature
as the initial object of some category of 'models', yielding induction and
recursion principles for abstract syntax. Zsid\'o proves an initiality result
for simply-typed syntax: given a signature S, the abstract syntax associated to
S constitutes the initial object in a category of models of S in monads.
However, the iteration principle her theorem provides only accounts for
translations between two languages over a fixed set of object types. We
generalize Zsid\'o's notion of model such that object types may vary, yielding
a larger category, while preserving initiality of the syntax therein. Thus we
obtain an extended initiality theorem for typed abstract syntax, in which
translations between terms over different types can be specified via the
associated category-theoretic iteration operator as an initial morphism. Our
definitions ensure that translations specified via initiality are type-safe,
i.e. compatible with the typing in the source and target language in the
obvious sense. Our main example is given via the propositions-as-types
paradigm: we specify propositions and inference rules of classical and
intuitionistic propositional logics through their respective typed signatures.
Afterwards we use the category--theoretic iteration operator to specify a
double negation translation from the former to the latter. A second example is
given by the signature of PCF. For this particular case, we formalize the
theorem in the proof assistant Coq. Afterwards we specify, via the
category-theoretic iteration operator, translations from PCF to the untyped
lambda calculus
- …