Results 41 to 50 of about 85,558 (251)
, 2011 Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems.
De Nicola, Rocco
core +1 more source
Unifying Theories of Mobile Channels [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In this paper we present the denotational semantics for channel mobility in the Unifying Theories of Programming (UTP) semantics framework. The basis for the model is the UTP theory of reactive processes (precisely, the UTP semantics for Communicating ...
Gerard Ekembe Ngondi
doaj +1 more source
Extensional and Intensional Semantics of Bounded and Unbounded Nondeterminism [PDF]
Logical Methods in Computer Science, 2021 We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them.
James Laird
doaj +1 more source
Electronic Proceedings in Theoretical Computer Science, 2014 A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces.
Miklós Bartha
doaj +1 more source
A Provenance Tracking Model for Data Updates [PDF]
, 2012 For data-centric systems, provenance tracking is particularly important when the system is open and decentralised, such as the Web of Linked Data. In this paper, a concise but expressive calculus which models data updates is presented.
Ciobanu, Gabriel, Horne, Ross
core +3 more sources
Reversible Barbed Congruence on Configuration Structures [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A standard contextual equivalence for process algebras is strong barbed congruence. Configuration structures are a denotational semantics for processes in which one can define equivalences that are more discriminating, i.e.
Clément Aubert, Ioana Cristescu
doaj +1 more source
METRIC DENOTATIONAL SEMANTICS FOR REMOTE PROCESS DESTRUCTION AND CLONING
Studia Universitatis Babes-Bolyai: Series Informatica, 2017 We present a denotational semantics designed with continuations for a concurrent language providing a mechanism for synchronous communication, together with constructions for process creation, remote process destruction and cloning.
Eneia Nicolae TODORAN
doaj +1 more source
QWIRE Practice: Formal Verification of Quantum Circuits in Coq [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving features. The
Robert Rand +2 more
doaj +1 more source
Semantics of a Typed Algebraic Lambda-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space.
Benoît Valiron
doaj +1 more source
Analyzing logic programs with dynamic scheduling [PDF]
, 1994 Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds leftto- right but in ...
García de la Banda, M. +2 more
core +2 more sources