◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Ong

34 papers hereh-index 283.1k citations109 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author1
  • middle author10
  • last author22

Across the 34 of 34 papers where every author was matched, so the position is known.

fields
  • cs.PL15
  • cs.LO13
  • cs.FL3
  • cs.CC1
  • cs.GT1
  • cs.LG1
same name
  • C. Ong — 24 papers, h 49
  • C. Ong — 11 papers, h 2
  • C. Ong — 7 papers, h 2
  • C. Ong — 5 papers, h 14
  • C. Ong — 5 papers, h 12
  • C. Ong — 2 papers, h 30

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20082023
most citedAutomatic Verification of Erlang-Style Concurrency

48 citations · 174 across the 34 of their papers we have counts for

collaborators
Showing 2014Show all

4 papers · 1 filter

cs.LO2014

Detecting Redundant CSS Rules in HTML5 Applications: A Tree-Rewriting Approach

Matthew Hague, Anthony Widjaja Lin, Luke Ong

HTML5 applications normally have a large set of CSS (Cascading Style Sheets) rules for data display. Each CSS rule consists of a node selector (given in an XPath-like query languag…

cs.LO2014

Decidable Models of Recursive Asynchronous Concurrency

Jonathan Kochems, C. -H. Luke Ong

Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable m…

cs.PL2014★ 7 cited

Innocent Strategies are Sheaves over Plays---Deterministic, Non-deterministic and Probabilistic Innocence

Takeshi Tsukada, C. -H. Luke Ong

Although the HO/N games are fully abstract for PCF, the traditional notion of innocence (which underpins these games) is not satisfactory for such language features as non-determin…

cs.LO2014

Safety verification of asynchronous pushdown systems with shaped stacks

Jonathan Kochems, C-H Luke Ong

In this paper, we study the program-point reachability problem of concurrent pushdown systems that communicate via unbounded and unordered message buffers. Our goal is to relax the…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.