C-Semigroups and Their Induced Order

Autor: Daniel Marín-Aragón, Raquel Tapia-Ramos

Publikováno v: Mathematics, Vol 12, Iss 18, p 2889 (2024)

Let C⊂Np be an integer polyhedral cone. An affine semigroup S⊂C is a C-semigroup if |C∖S|<+∞. This structure has always been studied using a monomial order. The main issue is that the choice of these orders is arbitrary. In the present work,

Externí odkaz: https://doaj.org/article/4cc171cb5b14417495c8d9cca6823474

Reasoning about monotonicity in separation logic

Autor: Lars Birkedal, Amin Timany

Publikováno v: Timany, A & Birkedal, L 2021, Reasoning about monotonicity in separation logic . in Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’21) . Association for Computing Machinery, New York, pp. 91-104, 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2021, co-located with POPL 2021, Virtual, Online, Denmark, 17/01/2021 . https://doi.org/10.1145/3437992.3439931
CPP

Reasoning about monotonicity is of key importance in concurrent separation logics. For instance, one needs to reason about monotonicity to show that the value of a concurrent counter with an increment operation only grows over time. Modern concurrent

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::47062da8dc22fef69a27cfefa3bc64a8
https://pure.au.dk/portal/da/publications/reasoning-about-monotonicity-in-separation-logic(8e4d288b-1534-45c5-a584-40f9fc215748).html

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Iris

Autor: Kasper Svendsen, Aaron Turon, David Swasey, Ralf Jung, Filip Sieczkowski, Lars Birkedal, Derek Dreyer

Publikováno v: POPL
Jung, R, Swasey, D, Sieczkowski, F, Svendsen, K, Turon, A, Birkedal, L & Dreyer, D 2015, Iris : Monoids and invariants as an orthogonal basis for concurrent reasoning . in S Rajamani (ed.), Conference Record of the Annual ACM Symposium on Principles of Programming Languages . Association for Computing Machinery, pp. 637-650, ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Mumbai, India, 12/01/2015 . https://doi.org/10.1145/2676726.2676980

We present Iris, a concurrent separation logic with a simple premise: monoids and invariants are all you need. Partial commutative monoids enable us to express---and invariants enable us to enforce---user-defined *protocols* on shared state, which ar

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94df3d1dda1787b39888a640d384d35a
https://doi.org/10.1145/2775051.2676980