Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ryota Fukuda

dblp:120/2050 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 87% Concurrent programming · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems › type systems
ownership types
0.112012
Type-based safe resource deallocation for shared-memory concurrency · OOPSLA 2012
Programming languages and type systems
type systems
0.112012
Type-based safe resource deallocation for shared-memory concurrency · OOPSLA 2012
Concurrent programming › concurrency models
shared-memory concurrency
0.012012
Type-based safe resource deallocation for shared-memory concurrency · OOPSLA 2012

Methods — techniques the papers use, named apart from their topics

type inference · 0.1
YearPublicationVenuePosition
2012 Type-based safe resource deallocation for shared-memory concurrency
abstract
We propose a type system to guarantee safe resource deallocation for shared-memory concurrent programs by extending the previous type system based on fractional ownerships. Here, safe resource deallocation means that memory cells, locks, or threads are not left allocated when a program terminates. Our framework supports (1) fork/join parallelism, (2) synchronization with locks, and (3) dynamically allocated memory cells and locks. The type system is proved to be sound. We also provide a type inference algorithm for the type system and a prototype implementation of the algorithm.
Kohei Suenaga, Ryota Fukuda, Atsushi Igarashi
OOPSLA2