Advanced search    

Search: authors:"Samuel Mimram"

7 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Concurrent Specifications Beyond Linearizability

parallel programs . Communications of the ACM , 18 ( 12 ): 717 - 721 , 1975 . Paul-Andr? Melli?s and Samuel Mimram . Asynchronous games: innocence without alternation . In International Conference on

Brief Announcement: On the Impossibility of Detecting Concurrency

We identify a general principle of distributed computing: one cannot force two processes running in parallel to see each other. This principle is formally stated in the context of asynchronous processes communicating through shared objects, using trace-based semantics. We prove that it holds in a reasonable computational model, and then study the class of concurrent...

Homological Computations for Term Rewriting Systems

Guiraud , Philippe Malbos, and Samuel Mimram . A homotopical completion procedure with applications to coherence of monoids . In RTA , volume 21 , pages 223 - 238 . Dagstuhl, 2013 . Allen Hatcher

Presenting a Category Modulo a Rewriting System

6 . Springer , 1967 . Yves Guiraud and Philippe Malbos . Polygraphs of finite derivation type . arXiv:1402.2587 , 2014 . Yves Guiraud , Philippe Malbos, Samuel Mimram , et al. A homotopical completion

A Homotopical Completion Procedure with Applications to Coherence of Monoids

One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which starts from a terminating rewriting system and iteratively adds rules to it, trying to produce an equivalent convergent rewriting system. It is in particular used to study presentations of monoids, since normal forms of the rewriting system provide canonical representatives of words...

A Non-Standard Semantics for Kahn Networks in Continuous Time

In a seminal article, Kahn has introduced the notion of process network and given a semantics for those using Scott domains whose elements are (possibly infinite) sequences of values. This model has since then become a standard tool for studying distributed asynchronous computations. From the beginning, process networks have been drawn as particular graphs, but this syntax is...

Computing Critical Pairs in 2-Dimensional Rewriting Systems

COMPUTING CRITICAL PAIRS IN 2-DIMENSIONAL REWRITING SYSTEMS SAMUEL MIMRAM Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the