Write a Blog >>
Tue 19 Jan 2016 14:30 - 15:00 at Room Harbor View - Domain-Specific Languages II Chair(s): Sebastian Erdweg

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.

Tue 19 Jan
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

14:00 - 15:30: PEPM - Domain-Specific Languages II at Room Harbor View
Chair(s): Sebastian ErdwegTU Darmstadt, Germany
pepm-2016-main14:00 - 14:30
Hsiang-Shang ‘Josh’ KoNational Institute of Informatics, Tao ZanSokendai, Japan, Zhenjiang HuNational Institute of Informatics
DOI Pre-print
pepm-2016-main14:30 - 15:00
Hendrik van AntwerpenDelft University of Technology, Netherlands, Pierre NeronTU Delft, Andrew TolmachPortland State University, Eelco VisserDelft University of Technology, Guido WachsmuthDelft University of Technology
Link to publication DOI Pre-print
pepm-2016-main15:00 - 15:30
Kenichi SuzukiUniversity of Tsukuba, Japan, Oleg Kiselyov, Yukiyoshi Kameyama