Scope States: Guarding Safety of Name Resolution in Parallel Type Checkers

Antwerpen, Hendrik van; Visser, Eelco

doi:10.4230/lipics.ecoop.2021.1

Cited by 7 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Eelco Visser led the development of three declarative meta-languages for specifying name resolution: NaBL [11], NaBL2 [19,25], and Statix [20,22,26,27]. The Spoofax language workbench [8,10,31] implements name resolution for any language whose rules are specified in one of these meta-languages.…”

Section: :2 Using Spoofax To Support Online Code Navigationmentioning

confidence: 99%

Using Spoofax to Support Online Code Navigation

Mosses¹

2023

Preprint

View full text Add to dashboard Cite

Spoofax is a language workbench. A Spoofax language specification generally includes name resolution: the analysis of bindings between definitions and references. When browsing code in the specified language using Spoofax, the bindings appear as hyperlinks, supporting precise name-based code navigation. However, Spoofax cannot be used for browsing code in online repositories.This paper is about a toolchain that uses Spoofax to generate hyperlinked twins of code repositories. These generated artefacts support the same precise code navigation as Spoofax, and can be browsed online. The technique has been prototyped on the CBS (Component-Based Semantics) specification language developed by the PLanCompS project, but could be used on any language after specifying its name resolution in Spoofax. ACM Subject ClassificationInformation systems → Web interfaces; Software and its engineering → Integrated and visual development environments; Software and its engineering → Development frameworks and environments Keywords and phrases Spoofax language workbench, name resolution, precise code navigation Digital Object Identifier 10.4230/OASIcs.EVCS.2023.21 Category Development

show abstract

Section: :2 Using Spoofax To Support Online Code Navigationmentioning

confidence: 99%

Using Spoofax to Support Online Code Navigation

Mosses¹

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Therefore, these results cannot be interpreted as speedups for Statix-based type checkers. For that reason, we benchmarked the total speedup of executing the Java specification with the concurrent solver [29], using both generic and compiled queries. For each measurement, we used 5 warm-up iterations and 20 measurement iterations in single-shot mode on a single core.…”

Section: Performancementioning

confidence: 99%

“…Although we deem it unlikely, it might be the case that queries of the Java specification do not exercise particular important code paths. Second, Statix allows interleaving scope graph construction and querying [18,29]. This is required to support typedependent name resolution and module systems.…”

Section: Threats To Validitymentioning

confidence: 99%

See 1 more Smart Citation

Specializing Scope Graph Resolution Queries: Extended Edition

Zwaan¹

2022

Preprint

View full text Add to dashboard Cite

To warrant programmer productivity, type checker results should be correct and available quickly. Correctness can be provided when a type checker implementation corresponds to a declarative type system specification. Statix is a type system specification language which achieves this by automatically deriving type checker implementations from declarative typing rules. A key feature of Statix is that it uses scope graphs for declarative specification of name resolution. However, compared to hand-written type checkers, type checkers derived from Statix specifications have suboptimal run time performance.In this paper, we identify and resolve a performance bottleneck in the Statix solver, namely part of the name resolution algorithm, using partial evaluation. To this end, we introduce a tailored procedural intermediate query resolution language, and provide a specializer that translates declarative queries to this language.Evaluating this specializer by comparing type checking run time performance on three benchmarks (Apache Commons CSV, IO, and Lang3), shows that our specializer improves query resolution time up to 7.7x, which reduces the total type checking run time by 38 -48%.

show abstract

Incremental type-checking for free: using scope graphs to derive incremental type-checkers

Zwaan

Antwerpen

Visser

2022

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-checking can provide that in a scalable fashion. However, existing techniques are not reusable between languages. Moreover, mutual and dynamic dependencies preclude traditional approaches to incrementality. This makes finding automatic approaches to incremental type-checking a challenging but important open question. In this paper, we present a technique that automatically derives incremental type-checkers from type system specifications written in the Statix meta-DSL. We use name resolution queries in scope graphs (a generic model of name binding embedded in Statix) to derive dependencies between compilation units. A novel query confirmation algorithm finds queries for which the answer changed due to an edit in the program. Only units with such queries require reanalysis. The effectiveness of this algorithm is improved by (1) splitting the type-checking task into a context-free and a context-sensitive part, and (2) reusing a generic mechanism to resolve mutual dependencies. This automatically yields incremental type-checkers for any Statix specification. Compared to non-incremental parallel execution, we achieve speedups up to 147x on synthetic benchmarks, and up to 21x on real-world projects, with initial overheads below 10%. This suggests that our framework can provide efficient incremental type-checking to the wide range of languages supported by Statix.

show abstract

Scope States: Guarding Safety of Name Resolution in Parallel Type Checkers

Cited by 7 publications

References 0 publications

Using Spoofax to Support Online Code Navigation

Using Spoofax to Support Online Code Navigation

Specializing Scope Graph Resolution Queries: Extended Edition

Incremental type-checking for free: using scope graphs to derive incremental type-checkers

Contact Info

Product

Resources

About