◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Harry G. Mairson

4 papers hereh-index 211.3k citations55 works total

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

author position
  • last author2

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

fields
  • cs.PL3
  • cs.LO1

identity via Semantic Scholar / OpenAlex

most citedDeciding kCFA is complete for EXPTIME

3 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing cs.PLShow all

3 papers · 1 filter

cs.PL2013

Flow analysis, linearity, and PTIME

David Van Horn, Harry G. Mairson

Flow analysis is a ubiquitous and much-studied component of compiler technology---and its variations abound. Amongst the most well known is Shivers' 0CFA; however, the best known a…

cs.PL2013★ 3 cited

Deciding kCFA is complete for EXPTIME

David Van Horn, Harry G. Mairson

We give an exact characterization of the computational complexity of the kCFA hierarchy. For any k>0, we prove that the control flow decision problem is complete for determin…

cs.PL2013

The Complexity of Flow Analysis in Higher-Order Languages

David Van Horn

This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. We give exact characterizations of the co…

◍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.