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

Zhuyang Wang

dblp:313/0633 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0001-9347-2151ORCID · reported

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

Software engineering, systems software and programming languages · 1 · 1 since 2021

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 · 70% Software testing · 30%

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

TopicWeightPapersLastEvidence papers
Programming languages and type systems › language implementation
monomorphization
0.612022
Logarithm and program testing · Proc. ACM Program. Lang. 2022
Programming languages and type systems › type systems
polymorphism
0.612022
Logarithm and program testing · Proc. ACM Program. Lang. 2022
Software testing › random testing
property-based testing
0.612022
Logarithm and program testing · Proc. ACM Program. Lang. 2022
Programming languages and type systems
type theory
0.212022
Logarithm and program testing · Proc. ACM Program. Lang. 2022

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

embedding-projection pairs · 0.6
YearPublicationVenuePosition
2022 Logarithm and program testing
abstract
Randomized property-based testing has gained much attention recently, but most frameworks stop short at polymorphic properties. Although Bernardy et al. have developed a theory to reduce a wide range of polymorphic properties to monomorphic ones, it relies upon ad-hoc embedding-projection pairs to massage the types into a particular form. This paper skips the embedding-projection pairs and presents a mechanical monomorphization for a general class of polymorphic functions, a step towards automatic testing for polymorphic properties. The calculation of suitable types for monomorphization turns out to be logarithm .
Kuen-Bang Hou (Favonia), Zhuyang Wang
Proc. ACM Program. Lang.2