150 Hits in 3.5 sec

Parallelism and Synchronization in an Infinitary Context (Long Version) [article]

Ugo Dal Lago, Claudia Faggian, Benoit Valiron, Akira Yoshimizu
2015 arXiv   pre-print
We study multitoken interaction machines in the context of a very expressive logical system with exponentials, fixpoints and synchronization.  ...  The advantage of such machines is to provide models in the style of the Geometry of Interaction, i.e., an interactive semantics which is close to low-level implementation.  ...  The second and third authors were supported by the project ANR-2010-BLANC-021301 "LOGOI".  ... 
arXiv:1505.03635v2 fatcat:4qdju2mlobarfeo77utwodkhbi

Parallelism and Synchronization in an Infinitary Context

Ugo Dal Lago, Claudia Faggian, Benoit Valiron, Akira Yoshimizu
2015 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science  
We study multitoken interaction machines in the context of a very expressive linear logical system with exponentials, fixpoints and synchronization.  ...  We introduce SMEYLL nets, whose expressiveness is increased over MELL nets by several constructs: we have fixpoints (captured by the Y -box), an operator for synchronization (the sync node), and a primitive  ...  ., when the redex occurs at depth 0), and not in an arbitrary context.  ... 
doi:10.1109/lics.2015.58 dblp:conf/lics/LagoFVY15 fatcat:3kboikwsxbeebehaex6jgq7scm

Page 4739 of Mathematical Reviews Vol. , Issue 94h [page]

1994 Mathematical Reviews  
Sénizergues, An effec- tive version of Stallings’ theorem in the case of context-free groups (478-495); A. Lepist6, On the power of periodic iteration of mor- phisms (496-506); F. Mignosi and P.  ...  ); Faron Moller and Chris Tofts, Behavioural abstraction in TCCS (559-570); Carolyn Brown and Doug Gurr, Timing Petri nets categorically (571-582); Paul Gastin and An- toine Petit, Asynchronous cellular  ... 

Infinitary Proof Theory: the Multiplicative Additive Case

David Baelde, Amina Doumane, Alexis Saurin, Marc Herbstritt
2016 Annual Conference for Computer Science Logic  
Infinitary and regular proofs are commonly used in fixed point logics.  ...  To the best of our knowledge, while reversibility has since long been a key-ingredient in completeness arguments based on infinitary proof systems, focalization has simply never been studied in such settings  ...  We conclude in Section 5 with directions for future work. Technical details, proofs, and additional background material can be found in the long version of this paper [6] .  ... 
doi:10.4230/lipics.csl.2016.42 dblp:conf/csl/BaeldeDS16 fatcat:vpem436twbaarpzosgwkng6kfu

PhD Abstracts

2014 Journal of functional programming  
Many students complete PhDs in functional programming each year, but there is currently no common location in which to promote and advertise the resulting work.  ...  We are delighted to publish 37 abstracts in this first round, and hope that JFP readers will find many interesting dissertations in this collection that they might not otherwise have seen.  ...  Additionally, in algorithms where each parallel task mutates an independent portion of the data, non-conflicting mutations can be performed in parallel.  ... 
doi:10.1017/s0956796814000215 fatcat:rs2j5wgm5ndf7ek2zls5pmg2w4

The mechanical generation of fault trees for reactive systems via retrenchment II: clocked and feedback circuits

Richard Banach, Marco Bozzano
2011 Formal Aspects of Computing  
For feedback circuits, the plethora of behaviours that can occur give rise to infinitary fault trees of an appropriate kind.  ...  The retrenchment approach to the mechanical construction of fault trees, introduced in the first paper for combinational logic circuits, is extended to handle clocked circuits and then feedback circuits  ...  held in F3 (and hence the output at O1) remain invariant as long as I1 continues to remain at 0.  ... 
doi:10.1007/s00165-011-0203-6 fatcat:apgjzbapgbbctd4woekra3eck4

The geometry of parallelism: classical, probabilistic, and quantum effects

Ugo Dal Lago, Claudia Faggian, Benoît Valiron, Akira Yoshimizu
2017 Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017  
Its main feature is the ability to model commutative effects in a parallel setting. Our model comes with a multi-token machine, a proof net system, and a PCF-style language.  ...  This model is an instance of a new framework which captures not only quantum but also classical and probabilistic computation.  ...  a general notion of parallel abstract reduction system, which allows us to deal with the combination of parallelism and probabilistic choice in an infinitary setting (Sec. 2).  ... 
doi:10.1145/3009837.3009859 fatcat:t72iddrvb5dxloldy4ccufhjo4

Bundle Event Structures and CCSP [chapter]

Rob van Glabbeek, Frits Vaandrager
2003 Lecture Notes in Computer Science  
Working up to isomorphism we find that • all denotable event structures are bundle event structures, • upon adding an infinitary parallel composition all bundle event structures are denotable, • without  ...  Up to hereditary history preserving bisimulation equivalence finitary conflict can be expressed in terms of binary conflict. In this setting all countable stable event structures are denotable.  ...  Bundle Event Structures and CCSP  ... 
doi:10.1007/978-3-540-45187-7_4 fatcat:lrkopgwonvhxreo67k3cmdo5m4

Separability in the Ambient Logic

Etienne Lozes, Daniel Hirschkoff, Davide Sangiorgi, Andrew Gordon
2008 Logical Methods in Computer Science  
As underlying calculi besides MA we consider a subcalculus in which an image-finiteness condition holds and that we prove to be Turing complete.  ...  After showing _=L to be stricly finer than barbed congruence, we establish axiomatisations of _=L on the subcalculus of MA (both the asynchronous and the synchronous version), enabling us to relate _=L  ...  Given two processes P and Q, a closing context for P and Q (in short, a closing context) is a context C such that C{| P |} and C{| Q |} are closed processes. | P | Q (parallel) | !  ... 
doi:10.2168/lmcs-4(3:4)2008 fatcat:5cgoodeasjenbjefxkft2ntbua

Basic Theory of Reduction Congruence forTwo Timed Asynchronous π-Calculi [chapter]

Martin Berger
2004 Lecture Notes in Computer Science  
These results are adapted to an asynchronous π-calculus with timers, locations and message failure.  ...  In addition we investigate the problem of how to distribute value-passing processes in a semanticspreserving way.  ...  The operator | is parallel composition. Finitely describable infinitary behaviour is achieved by way of a replication operation !  ... 
doi:10.1007/978-3-540-28644-8_8 fatcat:s3dkfs5t6vg77oikujiilz3yyq

Insignificant Choice Polynomial Time [article]

Klaus-Dieter Schewe
2021 arXiv   pre-print
For this we extend the seminal research of Blass, Gurevich and Shelah on choiceless polynomial time (CPT), which exploits deterministic Abstract State Machines (ASMs) supporting unbounded parallelism to  ...  We then prove an inseparability theorem, which characterises classes of structures that cannot be separated by the logic. In particular, this implies that SAT cannot be decided by an ICPT computation.  ...  I also like to thank Jan van den Bussche and Thomas Klimpel who spotted some issues in earlier versions of the manuscript that needed clarification.  ... 
arXiv:2005.04598v7 fatcat:6zvwqgmmwvgwfcfqfhrhdvplou

Divergence and unique solution of equations [article]

Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi
2019 arXiv   pre-print
We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of equations) whose infinite unfolding never  ...  Finally, we study the theorems in name-passing calculi such as the asynchronous π-calculus, and use them to revisit the completeness part of the proof of full abstraction of Milner's encoding of the λ-calculus  ...  supported by Labex MILYON/ANR-10-LABX-0070, by the European Research Council (ERC) under the Horizon 2020 programme (CoVeCe, grant agreement No 678157), by H2020-MSCA-RISE project 'Behapi' (ID 778233), and  ... 
arXiv:1806.11354v2 fatcat:4letyzmscbfjfmvghxhglbskwu

Circular Proofs as Session-Typed Processes: A Local Validity Condition [article]

Farzaneh Derakhshan, Frank Pfenning
2022 arXiv   pre-print
In this paper, we establish an extension of the latter correspondence for a fragment of substructural logic with least and greatest fixed points.  ...  We describe the computational interpretation of the resulting infinitary proof system as session-typed processes, and provide an effectively decidable local criterion to recognize mutually recursive processes  ...  Acknowledgments The authors would like to acknowledge helpful comments by Stephanie Balzer, Ankush Das, Jan Hoffmann, and Siva Somayyajula on an earlier draft, discussions with Jonas Frey and Henry DeYoung  ... 
arXiv:1908.01909v5 fatcat:uoj3dcjwcjfxfgb2eglbnk5qny

A categorial theory of objects as observed processes [chapter]

H. -D. Ehrich, J. A. Goguen, A. Sernadas
1991 Lecture Notes in Computer Science  
After an informal introduction into both approaches, we first elaborate on the sheaf model, using the term "behaviour" for objects in this sense, and avoiding concepts from topology.  ...  Behaviours and behaviour morphisms are shown to form a complete category where parallel composition is reflected by limits.  ...  to and commenting on the ideas described in this paper.  ... 
doi:10.1007/bfb0019445 fatcat:qa34q6je7rfw5hfrh2qznorvb4

Relating State-Based and Process-Based Concurrency through Linear Logic

Iliano Cervesato, Andre Scedrov
2006 Electronical Notes in Theoretical Computer Science  
Therefore, following an approach that has proved highly beneficial for sequential programs, much effort has been invested in tracing the foundations of concurrency in logic.  ...  Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic.  ...  Acknowledgments We are grateful to Frank Pfenning, Dale Miller, Mark-Oliver Stehr, Valeria de Paiva, Gerald Allwein, Steve Zdancevic and Vijay Saraswat for their comments on various aspects of this work  ... 
doi:10.1016/j.entcs.2006.05.043 fatcat:eavrmrbudjbvbhnu2zlxecsd2e
« Previous Showing results 1 — 15 out of 150 results