Results 41 to 50 of about 104,454 (340)
Mathematical Structures in Computer Science, 2021 AbstractWe show how concurrent quantales and concurrent Kleene algebras arise as convolution algebras of functions from relational structures with two ternary relations that satisfy relational interchange laws into concurrent quantales or Kleene algebras, among others.
James Cranch +2 more
openaire +2 more sources
Automated Dynamic Concurrency Analysis for Go [PDF]
arXiv, 2021 The concurrency features of the Go language have proven versatile in the development of a number of concurrency systems. However, correctness methods to address challenges in Go concurrency debugging have not received much attention. In this work, we present an automatic dynamic tracing mechanism that efficiently captures and helps analyze the whole ...
arxiv
An Automated Refactoring Approach to Improve IoT Software Quality
Applied Sciences, 2020 Internet of Things (IoT) software should provide good support for IoT devices as IoT devices are growing in quantity and complexity. Communication between IoT devices is largely realized in a concurrent way.
Yang Zhang +6 more
doaj +1 more source
Theoretical Computer Science, 1988 AbstractThe overall intention of this work is to investigate the ability to regard a finite computation as a single event, in dealing with the semantics of concurrency. We propose a calculus of concurrent processes that embodies this ability in two respects: the first one is that of execution, the second that of operation.
Gérard Boudol, Ilaria Castellani
openaire +2 more sources
Relations among $k$-ME concurrence, negativity, polynomial invariants, and tangle [PDF]
Quantum Information Processing (2019) 18:194, 2020 The $k$-ME concurrence as a measure of multipartite entanglement (ME) unambiguously detects all $k$-nonseparable states in arbitrary dimensions, and satisfies many important properties of an entanglement measure. Negativity is a simple computable bipartite entanglement measure.
arxiv +1 more source
DESIGNING MULTITHREADED SOFTWARE BASED ON CONCURRENCY IN THE PROBLEM DOMAIN
TASK Quarterly, 2021 Event-sequence modeling is a thread-architectural style for event-driven software. It bases the set of threads in a multithreaded program on an event-sequence model of the problem domain. Each event sequence is a time-ordered set of event occurrences in
BO I. SANDÉN
doaj +1 more source
Well‐being on supportive techniques in amyotrophic lateral sclerosis: from neurologists' perspective
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1874-1883, December 2022., 2022 Abstract Objective To investigate intercultural neurologists' perception of well‐being in patients with amyotrophic lateral sclerosis (ALS) using gastrostomy (PEG), non‐invasive, and/or invasive ventilation (NIV/IV) and to analyse the determinants and impact on the management of the above medical interventions (MIs).
Krzysztof Barć +7 more
wiley +1 more source
Concurrent matching logic [PDF]
arXiv, 2021 Abstract. Matching logic cannot handle concurrency. We introduce concurrent matching logic (CML) to reason about fault-free partial correctness of shared-memory concurrent programs. We also present a soundness proof for concurrent matching logic (CML) in terms of operational semantics.
arxiv
Concurrency bugs in open source software: a case study
Journal of Internet Services and Applications, 2017 Concurrent programming puts demands on software debugging and testing, as concurrent software may exhibit problems not present in sequential software, e.g., deadlocks and race conditions.
Sara Abbaspour Asadollah +3 more
doaj +1 more source
Concurrency in Timed Automata [PDF]
Theoretical Computer Science, 2001 AbstractWe introduce Concurrent Timed Automata (CTAs) where automata running in parallel are synchronized. We consider the subclasses of CTAs obtained by admitting, or not, diagonal clock constraints and constant updates, and by letting, or not, sequential automata to update the same clocks.
LANOTTE, RUGGERO +2 more
openaire +6 more sources