Compiler Construction

Peter Fritzson, PHD, is a professor and Director of the Programming Environment Laboratory (PELAB) at the Department of Computer and Information Science, Linköping University, Sweden. He currently holds the position of president of MathCore Engineering AB; chairman of the Scandinavian Simulation Society; secretary of the European sumulation organisation, EuroSim; and vice chairman of the Modelica Association, an organization he helped to establish. Professor Fritzson has published ten books and over a hundred scientific papers.

OASIS: An optimizing action-based compiler generator.- Action transformations in the actress compiler generator.- An overview of door attribute grammars.- Coupling evaluators for attribute coupled grammars.- Towards the global optimization of functional logic programs.- A portable and optimizing back end for the SML/NJ compiler.- Efficient organization of control structures in distributed implementations.- Implementing 2DT on a multiprocessor.- Global code selection for directed acyclic graphs.- Compiling nested loops for limited connectivity VLIWs.- Delayed exceptions - Speculative execution of trapping instructions.- On the implementation of abstract interpretation systems for (constraint) Logic Programs.- A suite of analysis tools based on a general purpose abstract interpreter.- Flow grammars - a flow analysis methodology.- Provable correctness of prototype interpreters in LDL.- Developing efficient interpreters based on formal language specifications.- Generating an efficient compiler for a data parallel language from a denotational specification.- Adding semantic and syntactic predicates to LL(k): pred-LL(k).- Cosy compiler phase embedding with the CoSy compiler model.- Towards provably correct code generation for a hard real-time programming language.- Supporting array dependence testing for an optimizing/parallelizing C compiler.- Processing array statements and procedure interfaces in the PREPARE high performance fortran compiler.- A practical approach to the symbolic debugging of parallelized code.- Reducing the cost of data flow analysis by congruence partitioning.- Interprocedural constant propagation using dependence graphs and a data-flow model.- Solving demand versions of interprocedural analysis problems.- Compile time instruction cacheoptimizations.- Instruction scheduling over regions: A framework for scheduling across basic blocks.- Transport-triggering vs. operation-triggering.