Duangkaew Sawamiphakdi

dblp:52/4675 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1985
—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
Compilers and program optimization · 56% Program synthesis and code generation · 44%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
incremental compilation
0.011985
A Greedy Approach to Incremental Code Generation · POPL 1985
Program synthesis and code generation
incremental program generation
0.011985
A Greedy Approach to Incremental Code Generation · POPL 1985
Compilers and program optimization
code generation
0.011985
A Greedy Approach to Incremental Code Generation · POPL 1985

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

greedy algorithm · 0.0concurrent processes · 0.0
YearPublicationVenuePosition
1985 A Greedy Approach to Incremental Code Generation
abstract
The PSEP System represents a novel approach to incremental compilation for block structured languages. PSEP implements a very fine grain, “greedy” approach as a highly concurrent system of two processes: an editor and a code generator. The design allows the two processes to execute without locking their shared data objects, utilizing semantic information about the concurrent system to guarantee the consistency of the shared objects. This design is compared with the more common “demand” approach to incremental compilation.
Ray Ford, Duangkaew Sawamiphakdi
POPL2