Results 21 to 30 of about 1,543,905 (277)
Explicit fairness in testing semantics [PDF]
Logical Methods in Computer Science, 2009 In this paper we investigate fair computations in the pi-calculus. Following Costa and Stirling's approach for CCS-like languages, we consider a method to label process actions in order to filter out unfair computations.
D. Cacciagrano +2 more
doaj +1 more source
Full abstraction for nominal general references [PDF]
Logical Methods in Computer Science, 2009 Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects.
Nikos Tzevelekos
doaj +1 more source
First steps in synthetic guarded domain theory: step-indexing in the topos of trees [PDF]
Logical Methods in Computer Science, 2012 We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive definitions of terms,
Lars Birkedal +3 more
doaj +1 more source
Block structure vs scope extrusion: between innocence and omniscience [PDF]
Logical Methods in Computer Science, 2017 We study the semantic meaning of block structure using game semantics. To that end, we introduce the notion of block-innocent strategies and characterise call-by-value computation with block-allocated storage through soundness, finite definability and ...
Andrzej S. Murawski, Nikos Tzevelekos
doaj +1 more source
D.3.1 Deployment plan specification
, 2020 Executive Summary Building upon the results of previously published studies within the scope of the REACT project and leaning mainly on Deliverable 1.3 Pilot specific demonstration scenarios, 2.2 RES/storage enabled infrastructure planning and 2.3 Techno- economic impact assessment.
Sarrasín, Pablo, Carimo Osman
openaire +1 more source
Modules over monads and operational semantics (expanded version) [PDF]
Logical Methods in Computer Science, 2022 This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi.
André Hirschowitz +2 more
doaj +1 more source
A categorical foundation for structured reversible flowchart languages: Soundness and adequacy [PDF]
Logical Methods in Computer Science, 2018 Structured reversible flowchart languages is a class of imperative reversible programming languages allowing for a simple diagrammatic representation of control flow built from a limited set of control flow structures.
Robert Glück, Robin Kaarsgaard
doaj +1 more source
Time-Fluid Field-Based Coordination through Programmable Distributed Schedulers [PDF]
Logical Methods in Computer Science, 2021 Emerging application scenarios, such as cyber-physical systems (CPSs), the Internet of Things (IoT), and edge computing, call for coordination approaches addressing openness, self-adaptation, heterogeneity, and deployment agnosticism.
Danilo Pianini +4 more
doaj +1 more source
Resource Usage Analysis for the Pi-Calculus [PDF]
Logical Methods in Computer Science, 2006 We propose a type-based resource usage analysis for the π-calculus extended with resource creation/access primitives. The goal of the resource usage analysis is to statically check that a program accesses resources such as files and memory in a ...
Naoki Kobayashi +2 more
doaj +1 more source
A Step-indexed Semantics of Imperative Objects [PDF]
Logical Methods in Computer Science, 2009 Step-indexed semantic interpretations of types were proposed as an alternative to purely syntactic proofs of type safety using subject reduction. The types are interpreted as sets of values indexed by the number of computation steps for which these ...
Catalin Hritcu, Jan Schwinghammer
doaj +1 more source