Name
Abstract | ||
|---|---|---|
We graft synchronization onto Girard's Geometry of Interaction in its most concrete form, namely token machines. This is realized by introducing proof-nets for SMLL, an extension of multiplicative linear logic with a specific construct modeling synchronization points, and of a multi-token abstract machine model for it. Interestingly, the correctness criterion ensures the absence of deadlocks along reduction and in the underlying machine, this way linking logical and operational properties. |
Year | Venue | Field |
|---|---|---|
2014 | arXiv: Logic in Computer Science | Logical conjunction,Synchronization,Geometry of interaction,Correctness,Deadlock,Algorithm,Linear logic,Security token,Abstract machine,Mathematics |
DocType | Volume | Citations |
Journal | abs/1405.3427 | 0 |
PageRank | References | Authors |
0.34 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ugo Dal Lago | 1 | 565 | 60.42 |
| Claudia Faggian | 2 | 138 | 15.71 |
| Ichiro Hasuo | 3 | 260 | 26.13 |
| Akira Yoshimizu | 4 | 18 | 4.15 |