University of Minnesota
Software Engineering Center
/

You are here

Eric Van Wyk

Photo of Eric Van Wyk
Phone Number: 
612-625-0329
Office Location: 
EE/CS 6-203
Education: 

Ph.D. 1998, Computer Science, University of Iowa

M.S. 1991, Computer Science, University of Iowa

B.A. 1989, Mathematics and Computer Science, Luther College

Biography: 

Associate Professor Van Wyk's research focuses on programming languages, in particular extensible programming languages and compilers, applications of temporal logic, and algebraic compilers. In 2005 he was awarded a McKnight Land-Grant Professorship and the National Science Foundation's CAREER award in 2004.

He has authored or co-authored more than 25 publications, including journal and conference papers, articles and technical reports. Van Wyk has developed various software packages including the Silver attribute grammar specification and evaluation system, extensible specifications of Java 1.4 and ANSI C written in Silver, and various domain-specific language extensions for these Java and C specifications. He is a member of ACM, ACM SIGPLAN, IEEE, the IEEE Computer Society, and is involved in numerous conference committees. Van Wyk also does outreach, serving as a member of the St. Louis Park High School School Business and Information Technology Advisory Board.

Research: 

In general, my research is on declarative specifications for programming language tools, such as compilers and optimizers, and the mechanisms for mapping these specifications into executable programs.

One area of interest is extendible programming languages and compiler designs that allow new language features to be imported into a language framework. These new features define their own syntax, semantics, and optimizations. In such a system, programmers do not choose which language to use for a particular task, but instead choose which set of language features to use and import these features into their programming environment thus creating a one-off language specific to their current problem domain.

Many program optimizations can be simply stated as rewrite rules but the data and control flow conditions which must be satisfied to safely apply the rules can be rather complex. I am interested in using temporal logic as a declarative specification language for these conditions since it is formal and concise. Also, temporal logic model checkers can automatically locate the points in a program flow graph where optimizations can be safely made.

I also work on algebraic compilers where programming languages are specified as Galois-connected syntax and semantic algebras and language translators are specified as (generalized) homomorphisms.

Recent Publications

Generating Model Checkers from Algebraic Specifications

There is a great deal of research aimed toward the development of temporal logics and model checking algorithms which can be used to verify properties of systems. In this paper, we present a methodology and supporting tools which allow researchers and practitioners to automatically generate model checking algorithms for temporal logics from algebraic specifications.

Forwarding in Attribute Grammars for Modular Language Design

Forwarding is a technique for providing default attribute definitions in attribute grammars that is helpful in the modular implementation of programming languages. It complements existing techniques such as default copy rules. This paper introduces forwarding, and shows how it is but a small extension of standard higher-order attribute grammars. The usual tools for manipulating higher-order attribute grammars, including the circularity check (which tests for cyclic dependencies between attribute values), carry over without modification.

Proving Correctness of Compiler Optimizations by Temporal Logic

Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: II' if φ, where I, I' are intermediate language instructions and φ is a property expressed in a temporal logic suitable for describing program data flow. Its reading: If the current program π contains an instruction of form I at some control point p, and if flow condition φ is satisfied at p, then replace I by I'.

Pages