Bibliometrics
Skip Table Of Content Section
research-article
Open Access
The Tortoise and the Hare Algorithm for Finite Lists, Compositionally
Article No.: 1, pp 1–35https://doi.org/10.1145/3564619

In the tortoise-and-hare algorithm, when the fast pointer reaches the end of a finite list, the slow pointer points to the middle of this list. In the early 2000’s, this property was found to make it possible to program a palindrome detector for immutable ...

research-article
Open Access
Towards Porting Operating Systems with Program Synthesis
Article No.: 2, pp 1–70https://doi.org/10.1145/3563943

The end of Moore’s Law has ushered in a diversity of hardware not seen in decades. Operating system (OS) (and system software) portability is accordingly becoming increasingly critical. Simultaneously, there has been tremendous progress in program ...

research-article
Open Access
Immutability and Encapsulation for Sound OO Information Flow Control
Article No.: 3, pp 1–35https://doi.org/10.1145/3573270

Security-critical software applications contain confidential information which has to be protected from leaking to unauthorized systems. With language-based techniques, the confidentiality of applications can be enforced. Such techniques are for example ...

research-article
Open Access
Typed–Untyped Interactions: A Comparative Analysis
Article No.: 4, pp 1–54https://doi.org/10.1145/3579833

The literature presents many strategies for enforcing the integrity of types when typed code interacts with untyped code. This article presents a uniform evaluation framework that characterizes the differences among some major existing semantics for typed–...

research-article
Open Access
Omnisemantics: Smooth Handling of Nondeterminism
Article No.: 5, pp 1–43https://doi.org/10.1145/3579834

This article gives an in-depth presentation of the omni-big-step and omni-small-step styles of semantic judgments. These styles describe operational semantics by relating starting states to sets of outcomes rather than to individual outcomes. A single ...

research-article
Open Access
Satisfiability Modulo Ordering Consistency Theory for SC, TSO, and PSO Memory Models
Article No.: 6, pp 1–37https://doi.org/10.1145/3579835

Automatically verifying multi-threaded programs is difficult because of the vast number of thread interleavings, a problem aggravated by weak memory consistency. Partial orders can help with verification because they can represent many thread ...

Subjects

Comments

About Cookies On This Site

We use cookies to ensure that we give you the best experience on our website.

Learn more

Got it!