Selectors make set-based analysis too hard

DOI10.1007/S10990-005-4876-5MaRDI QIDQ812081zbMATH OpenOpenAlexFDO

Authors Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand

Publication date 23 January 2006

Published in Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10990-005-4876-5

zbMATH Keywords

program analysisSchemeset-based analysisstatic debugging

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• On the complexity of set-based analysis
• Introduction to set constraint-based program analysis
• A set-based context model for program analysis
• Paths vs. trees in set-based program analysis
• Set-sharing is redundant for pair-sharing

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 711035 (Why is no real title available?)
• scientific article; zbMATH DE number 2087548 (Why is no real title available?)
• DrScheme: a programming environment for Scheme
• Introduction to set constraint-based program analysis
• On the complexity of set-based analysis

Cited in

(2)

• A set-based context model for program analysis
• On the complexity of set-based analysis

Describes a project that uses

Uses Software

• DrScheme

This page was built for publication: Selectors make set-based analysis too hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812081)