Výsledky vyhledávání - "Anton Podkopaev"

The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency

Autor: Alan Jeffrey, James Riely, Mark Batty, Simon Cooksey, Ilya Kaysin, Anton Podkopaev

Publikováno v: Proceedings of the ACM on Programming Languages. 6:1-30

Program logics and semantics tell a pleasant story about sequential composition: when executing (S1;S2), we first execute S1 then S2. To improve performance, however, processors execute instructions out of order, and compilers reorder programs even m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::15c1706b2e451d14bbdbe9ab2e1a5403
https://doi.org/10.1145/3498716

Zobrazit plný text záznamu

Bridging the gap between programming languages and hardware weak memory models

Autor: Anton Podkopaev, Ori Lahav, Viktor Vafeiadis

Publikováno v: Proceedings of the ACM on Programming Languages. 3:1-31

We develop a new intermediate weak memory model, IMM, as a way of modularizing the proofs of correctness of compilation from concurrent programming languages with weak memory consistency semantics to mainstream multi-core architectures, such as POWER

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ef67cade98a139aa4399888ef9d66f01
https://doi.org/10.1145/3290382

Zobrazit plný text záznamu

Making Weak Memory Models Fair

Autor: Anton Podkopaev, Ori Lahav, Egor Namakonov, Viktor Vafeiadis, Jonas Oberhauser

Publikováno v: Proceedings of the ACM on Programming Languages
ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications

Liveness properties, such as termination, of even the simplest shared-memory concurrent programs under sequential consistency typically require some fairness assumptions about the scheduler. Under weak memory models, we observe that the standard noti

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8752294fc77a8c59edd08a078fd18bce
http://arxiv.org/abs/2012.01067

Zobrazit plný text záznamu

Promising 2.0: global optimizations in relaxed memory concurrency

Autor: Anton Podkopaev, Minki Cho, Chung-Kil Hur, Viktor Vafeiadis, Sung-Hwan Lee, Ori Lahav, Soham Chakraborty

Publikováno v: PLDI

For more than fifteen years, researchers have tried to support global optimizations in a usable semantics for a concurrent programming language, yet this task has been proven to be very difficult because of (1) the infamous “out of thin air” prob

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::13b816ee24b01070d1d845e8581f8bcf
https://doi.org/10.1145/3385412.3386010

Zobrazit plný text záznamu

Repairing and mechanising the JavaScript relaxed memory model

Autor: Anton Podkopaev, Christopher Pulte, Guillaume Barbier, Jean Pichon-Pharabod, Shaked Flur, Conrad Watt, Shu-yu Guo, Stephen K. Dolan

Publikováno v: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation
PLDI

Modern JavaScript includes the SharedArrayBuffer feature, which provides access to true shared memory concurrency. SharedArrayBuffers are simple linear buffers of bytes, and the JavaScript specification defines an axiomatic relaxed memory model to de

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe4d3ef82ef5ee8ff0d263f9f5db1dc7

Zobrazit plný text záznamu

Promising Compilation to ARMv8.3

Autor: Ori Lahav, Anton Podkopaev, Viktor Vafeiadis

Publikováno v: Труды Института системного программирования РАН, Vol 29, Iss 5, Pp 149-164 (2018)

Concurrent programs have behaviors, which cannot be explained by interleaving execution of their threads on a single processing unit due to optimizations, which are performed by modern compilers and CPUs. How to correctly and completely define a sema

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bd85b25aad704e1490b667018f91033
https://doi.org/10.15514/ispras-2017-29(5)-9

Zobrazit plný text záznamu

Polynomial-Time Optimal Pretty-Printing Combinators with Choice

Autor: Anton Podkopaev, Dmitri Boulytchev

Publikováno v: Lecture Notes in Computer Science ISBN: 9783662468227
Ershov Memorial Conference

We describe pretty-printing combinators with choice which provide optimal document layout in polynomial time. Bottom-up tree rewriting and dynamic programming (BURS) is used to calculate a set of possible layouts for a given output width. We also pre

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b6f9c69a2e30f0e0356a89bc7dfaa762
https://doi.org/10.1007/978-3-662-46823-4_21

Zobrazit plný text záznamu