What comes after CS 1 + 2: a deep breadth before specializing
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Meta-programming with Concrete Object Syntax
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Compiler Construction in Higher Order Logic Programming
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
Implementing Circularity Using Partial Evaluation
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Typing Assembly Programs with Explicit Forwarding
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Proceedings of the Second European Workshop on Genetic Programming
Partial Dead Code Elimination Using Extended Value Graph
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Stratego: A Language for Program Transformation Based on Rewriting Strategies
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Rewriting Strategies for Instruction Selection
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Imperative Program Transformation by Rewriting
CC '01 Proceedings of the 10th International Conference on Compiler Construction
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
CL '00 Proceedings of the First International Conference on Computational Logic
Journal of Functional Programming
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
JunGL: a scripting language for refactoring
Proceedings of the 28th international conference on Software engineering
A pattern for almost compositional functions
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Journal of Functional Programming
Variance analyses from invariance analyses
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
On the Complexity of Register Coalescing
Proceedings of the International Symposium on Code Generation and Optimization
Functional Elimination of Φ-instructions
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal verification of translation validators: a case study on instruction scheduling optimizations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A symbolic-numeric method to analyse nonlinear differential equations in Fourier domain
MMACTE'05 Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering
Computing Properties of Numerical Imperative Programs by Symbolic Computation
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Stratego/XT 0.17. A language and toolset for program transformation
Science of Computer Programming
Advanced conservative and optimistic register coalescing
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Program transformations using temporal logic side conditions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Regular-expression derivatives re-examined
Journal of Functional Programming
Proceedings of the 2009 ACM symposium on Applied Computing
Live-range unsplitting for faster optimal coalescing
Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
Automatic generation of network protocol gateways
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
A Formally Verified Compiler Back-end
Journal of Automated Reasoning
A simple, verified validator for software pipelining
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Applicative Control-Flow Graph Based on Huet's Zipper
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of strategies in rule-based program transformation systems
Journal of Symbolic Computation
Automatic generation of network protocol gateways
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
An automated approach for finding variable-constant pairing bugs
Proceedings of the IEEE/ACM international conference on Automated software engineering
Proceedings of the 17th ACM conference on Computer and communications security
IDE support to facilitate the transition from rapid prototyping to robust software production
Proceedings of the 1st Workshop on Developing Tools as Plug-ins
Clean translation of an imperative reversible programming language
CC'11/ETAPS'11 Proceedings of the 20th international conference on Compiler construction: part of the joint European conferences on theory and practice of software
Q: exploit hardening made easy
SEC'11 Proceedings of the 20th USENIX conference on Security
Translating between language and logic: what is easy and what is difficult
CADE'11 Proceedings of the 23rd international conference on Automated deduction
BAP: a binary analysis platform
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
CC'05 Proceedings of the 14th international conference on Compiler Construction
Formal verification of coalescing graph-coloring register allocation
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
LearnPADS++: incremental inference of ad hoc data formats
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Lightweight generics in embedded systems through static analysis
Proceedings of the 13th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, Tools and Theory for Embedded Systems
Computing Properties of Numerical Imperative Programs by Symbolic Computation
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
A formally-verified alias analysis
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Formal Verification of an SSA-Based Middle-End for CompCert
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hi-index | 0.00 |
From the Publisher:This textbook describes all phases of a modern compiler: lexical analysis, parsing, abstract syntax, semantic actions, intermediate representations, instruction selection via tree matching, dataflow analysis, graph-coloring register allocation, and runtime systems. It includes good coverage of current techniques in code generation and register allocation, as well as functional and object-oriented languages, that is missing from most books. The most accepted and successful techniques are described in a concise way, rather than as an exhaustive catalog of every possible variant. Detailed descriptions of the interfaces between modules of a compiler are illustrated with actual ML signatures. A unique feature of the book is a well designed compiler implementation project in ML, including front-end and "high-tech" back-end phases, so that students can build a complete working compiler in one semester.