Print Email Facebook Twitter A Constraint Language for Static Semantic Analysis Based on Scope Graphs with Proofs Title A Constraint Language for Static Semantic Analysis Based on Scope Graphs with Proofs Author Van Antwerpen, H. Néron, P. Tolmach, A. Visser, E. Wachsmuth, G. Faculty Electrical Engineering, Mathematics and Computer Science Department Software Technology Date 2015-12-31 Abstract In previous work, we introduced scope graphs as a formalism for describing program binding structure and performing name resolution in an AST-independent way. In this paper, we show how to use scope graphs to build static semantic analyzers. We use constraints extracted from the AST to specify facts about binding, typing, and initialization. We treat name and type resolution as separate building blocks, but our approach can handle language constructs—such as record field access—for which binding and typing are mutually dependent.We also refine and extend our previous scope graph theory to address practical concerns including ambiguity checking and support for a wider range of scope relationships. We describe the details of constraint generation for a model language that illustrates many of the interesting static analysis issues associated with modules and records. Subject language specificationname bindingtypesdomain specific languagemeta-theory To reference this document use: http://resolver.tudelft.nl/uuid:399a53d4-cecd-45c8-ba00-7baf56bb5241 Publisher Delft University of Technology, Software Engineering Research Group ISSN 1872-5392 Source http://swerl.tudelft.nl/bin/view/Main/TechnicalReports Source Report TUD-SERG-2015-012 Part of collection Institutional Repository Document type report Rights © 2015 The Author(s) . Software Engineering Research Group, Department of Software Technology, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology Files PDF TUD-SERG-2015-012.pdf 664.67 KB Close viewer /islandora/object/uuid:399a53d4-cecd-45c8-ba00-7baf56bb5241/datastream/OBJ/view