AI Chat AI Image Generator AI Video Text to Speech

Refining Santa: An Exercise in Efficient Synchronization

10/23/2018

∙

by Emil Sekerinski, et al.

∙

∙

The Santa Claus Problem is an intricate exercise for concurrent programming. This paper outlines the refinement steps to develop a highly efficient implementation with concurrent objects, starting from a simple specification. The efficiency of the implementation is compared to those in other languages.

Emil Sekerinski
6 publications
Shucai Yao
1 publication

page 1

page 2

page 3

page 4

research

∙ 08/17/2020

Deterministic concurrent systems

We introduce deterministic concurrent systems as a subclass of concurren...

0 Samy Abbes, et al. ∙

research

∙ 10/23/2018

Some Challenges of Specifying Concurrent Program Components

The purpose of this paper is to address some of the challenges of formal...

0 Ian J. Hayes, et al. ∙

research

∙ 04/02/2019

Concurrent Typestate-Oriented Programming in Java

We describe a generative approach that enables concurrent typestate-orie...

0 Rosita Gerbo, et al. ∙

research

∙ 11/16/2021

A Maude Implementation of Rewritable Petri Nets: a Feasible Model for Dynamically Reconfigurable Systems

Petri Nets (PN) are a central, theoretically sound model for concurrent ...

0 Lorenzo Capra, et al. ∙

research

∙ 06/01/2018

Table Space Designs For Implicit and Explicit Concurrent Tabled Evaluation

One of the main advantages of Prolog is its potential for the implicit e...

0 Miguel Areias, et al. ∙

research

∙ 12/14/2018

Simple Concurrent Labeling Algorithms for Connected Components

We present new concurrent labeling algorithms for finding connected comp...

0 Sixue Liu, et al. ∙

research

∙ 07/03/2017

Checking Linearizability of Concurrent Priority Queues

Efficient implementations of concurrent objects such as atomic collectio...

0 Ahmed Bouajjani, et al. ∙