Dynamic Dependency-Based Purity Checking
Many software language tools use declarative domain-specific languages (DDSLs) to implement parts of their functionality, such as context-free grammars for parsing or inference rules for type analysis. For interoperability and ease of use, DDSLs often rely on embedded general-purpose language (GPL) code fragments, as in the semantic actions of parser specifications, but require that these GPL fragments fulfill certain semantic properties, such as the absence of observable side effects. Fulfilling these properties is usually up to the developer, and accidental violations can lead to subtle and hard-to-trace bugs.
Authors
- Christoph Reichenbach (ORCID: https://orcid.org/0000-0003-0608-7023)
- Niklas Fors (ORCID: https://orcid.org/0000-0003-2714-9457)
- Anton Risberg Alaküla (ORCID: https://orcid.org/0000-0003-0814-3367)
Institutions
- Lund University (SE)
Publication Details
- Published
- 2025-06-12
- DOI
- https://doi.org/10.1145/3732771.3742720
- Primary Topic
- Formal Methods in Verification
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Knut och Alice Wallenbergs Stiftelse