Yannis Smaragdakis Associate Professor, Department of Computer Science, University of Massachusetts, Amherst Office: CS 346 Mailing Address: Computer Science, 140 Governors Drive, University of Massachusetts, Amherst, MA 01003, USA Phone: +1 413 577 0233 Fax: +1 413 545 1249 Email: yannis@cs.umass.edu

• My PhD rants-and-raves (after popular request)
• Yannis's law: Programmer Productivity Doubles Every 6 Years. (Yes, I'm only half serious, but half is enough.)
• My (favorite) academic humor

• Current Service: Oregon PL School. ICSE'09 Demos. PLDI'09. ICOOOLPS'09. ASE'09. ICSE'10. FSE 2010.
  
• Past edited proceedings: GPCE'03 proceedings from the ACM DL and from Springer-Verlag. MPOOL'01, MPOOL'02, TMPW'01
  

• X91oo/410ool/6246 (S08, S07, F05, F04, F03, F02, F01); 607 (S07, F08); 630 (F06, F07); 1322 (F05, S05); 4210 (S04, S03, S02, S01, S00); 8803 (F00).

Research

• Applied programming languages and software engineering:
• • Language mechanisms for abstraction (program generators, DSLs, modules and components, extensible languages, meta-programming, multi-paradigm programming)
  • Languages and tools for systems (programming models for concurrency, language support for distributed computing, memory management and program locality)
  • Program analysis and testing (automatic test generation, invariant inference, symbolic execution, pointer analysis).
  
  
• A fairly complete list of my publications in BibTeX format
• My CV

• My grad students: Jacob Evans, Shan Shan Huang, David Zook
• Ph.D. alumni: Brian McNamara, Eli Tilevich, Christoph Csallner
• Research Associates: I work with Reimer Behrends, Martin Bravenboer, and the LogicBlox developers.
  
• 
  
• Latest work:
• • "Strictly Declarative Specification of Sophisticated Points-to Analyses" (OOPSLA'09)
  • "Adaptive Locks: Combining Transactions and Locks for Efficient Concurrency" (TRANSACT'09, updated formal publication upcoming at PACT'09)
  • "Exception Analysis and Points-To Analysis: Better Together" (ISSTA'09)
  • "Statically Safe Program Generation with SafeGen" (SCP, to appear)
  • "Scalable Satisfiability Checking and Test Data Generation from Modeling Diagrams" (JASE)
  • "J-Orchestra: Enhancing Java Programs with Distribution Capabilities" (ACM TOSEM, to appear)
  • "Expressive and Safe Static Reflection with MorphJ" (PLDI'08)
  • "DySy: Dynamic Symbolic Execution for Invariant Inference" (ICSE'08)
  • "General and Efficient Locking without Blocking" (MSPC'08)
  • "DSD-Crasher: A Hybrid Analysis Tool for Bug Finding" (ACM TOSEM)
  • "Domain-Specific Languages and Program Generation with Meta-AspectJ" (ACM TOSEM)
  
  
• Project areas, each with representative publications and links:
  
• • Program Generators: MorphJ and cJ are our latest work. MorphJ is a language for safe "morphing", i.e., creating classes by iterating over members of other classes. cJ enhances Java generics with a safe static-if construct. Meta-AspectJ (MAJ) is a state-of-the-art meta-programming tool for Java and AspectJ. In the 90s, I also worked (as an intern) on the Intentional Programming (IP) project at Microsoft.
  • • "Morphing: Safely Shaping a Class in the Image of Others" (ECOOP'07)
    • "cJ: Enhancing Java with Safe Type Conditions" (AOSD'07)
      
    • "Morphing Software for Easier Evolution" (RAM-SE'07)
      
    • "Easy Language Extension with Meta-AspectJ" (ICSE'06 Emerging Results)
    • "Statically Safe Program Generation with SafeGen" (GPCE'05) shows a language that can certify a generator under all possible inputs to assert that it will only produce well-formed programs.
    • "Program Generators and the Tools to Make Them" (PEPM'04)
      
    • "Generating AspectJ Programs with Meta-AspectJ" (GPCE'04)
      
    • "A Personal Outlook on Generator Research" (Domain-Specific Program Generation)
      
    • "Application Generators": survey article in the Encyclopedia of Electrical and Electronics Engineering, (John Wiley and Sons)
    • "JTS: Tools for Implementing Domain-Specific Languages" (ICSR 98)
    • "Scoping Constructs for Program Generators" (GCSE'99)
    • "DiSTiL: a Transformation Library for Data Structures" in the Domain-Specific Languages conference (DSL)'97.
      
      
  • Automatic testing: JCrasher and its followups, CnC and DSD-Crasher. JCrasher is a system for random testing of Java programs. CnC combines static checking (the ESC/Java system) with automatic test case generation. DSD-Crasher adds a dynamic invariant detection step to CnC. The ORM- modeling formalism allows efficient satisfiability checking and test data generation.
  • • "Scalable Automatic Test Data Generation from Modeling Diagrams" (ASE'07) : the ORM- paper
      
    • "Combining Static and Dynamic Reasoning for Bug Detection" (TAP, 2007)
      
    • "DSD-Crasher: a Hybrid Analysis Tool for Bug Finding" (ISSTA'06)
      
    • "Dynamically Discovering Likely Interface Invariants" (ICSE'06 Emerging Results)
      
    • "CnC: Combining Static Checking and Testing" (ICSE'05)
      
    • "JCrasher: an Automatic Robustness Tester for Java" (Software: Practice and Experience)
      
      
  • Language tools for distributed and concurrent computing: J-Orchestra is an automatic partitioning system for Java programs. It manages to enable distributed execution over a network, as if the program was running on a single VM, using only rewrite techniques over standard runtimes. NRMI is Java middleware offering a programming model for distributed computing that resembles single-machine programming. Latest work includes the TIC model for transactional memory.
    
  • • "Transactions with Isolation and Cooperation" (OOPSLA'07)
    • "NRMI: Natural and Efficient Middleware" (IEEE TPDS)
      
    • "J-Orchestra: Automatic Java Application Partitioning": the main J-Orchestra paper from ECOOP'02. Extended version in CoC Tech Report 02-17. 
    • "NRMI: Natural and Efficient Middleware" (ICDCS'03)
    • "Transparent Program Transformations in the Presence of Opaque Code" (GPCE'06)
      
    • "Appletizing: Running Legacy Java Code Remotely From a Web Browser" (ICSM'05) uses J-Orchestra to convert a regular Java application into an applet-server combination.
      
    • "Portable and Efficient Distributed Threads for Java" (ACM Middleware'04) explains the distributed synchronization in J-Orchestra.
      
    • "Binary Refactoring: Improving Code Behind the Scenes" (ICSE'05): a refactoring-for-optimization technique that does not pollute the source code
      
    • "Automatic Partitioning: A Promising Approach to Prototyping Ubiquitous Computing Applications" (IEEE Pervasive Computing)
    • "Automatic Application Partitioning: The J-Orchestra approach" (8th ECOOP workshop on Mobile Object systems)
    • "Aspectizing Server-Side Distribution": a description of GOTECH, (ASE'03)
      
      
  • Memory management: I am currently working on adaptive memory management algorithms, i.e., ways to combine two policies and get the best of both, with theoretical guarantees. In the past, I proposed the EELRU replacement algorithm for virtual memory systems, which consistently outperforms LRU. Additionally, I have worked on techniques for compressed virtual memory and for the reduction (i.e., simulation-specific compression) of program reference traces.
  • • "Adaptive Caching: Effective Shaping of Cache Behavior to Workloads" (MICRO'06)
      
    • "General Adaptive Replacement Policies" (ISMM'04)
      
    • "The EELRU adaptive replacement algorithm" (Performance Evaluation--Elsevier)
    • • "EELRU: Simple and Effective Adaptive Page Replacement" (SIGMETRICS'99): the original EELRU paper
        
    • "Flexible Reference Trace Reduction for VM Simulations" (ACM TOMACS)
    • • "Trace Reduction for Virtual Memory Simulations" (SIGMETRICS'99): the original trace reduction paper
    • "The Case for Compressed Caching in Virtual Memory Systems", at the 1999 USENIX Annual Technical Conference
    • "Performing Replacement in Modem Pools" (USENIX'00): an algorithm for managing modem pools efficiently. Directly related to replacement algorithms in virtual memory!
    • • Some pointers to supplementary material.
    
    
  • Multiparadigm Programming: FC++ is a really cool library for programming functionally in C++. It is the first library to fully combine higher-order and polymorphic functions, by neatly exploiting C++ type inference. LC++ is its small sibling.
    
  • • "Functional Programming with the  FC++ library" (Journal of Functional Programming)
    • • "Functional Programming in C++" (ICFP'00): the original FC++ paper
        
    • "FC++: Functional Tools for OO Tasks" (Software Practice & Experience) shows how common OO programming tasks benefit from FC++
    • The FC++ Web page contains pointers to more FC++ publications and information
    • Also related: "Static Interfaces in C++" (2000 C++ Template Programming Workshop): How can we enforce interface requirements in C++?
    
    
  • Object-Oriented components: I have proposed the concept of a "mixin layer". A mixin layer is a static component encapsulating fragments of several different classes (mixins) so that all fragments are composed consistently. Mixin layers are a good implementation technique for layered designs.
  • • "Implementing Layered Designs with Mixin Layers": the original mixin layers paper from ECOOP 98
    • "Implementing Large-Scale Object-Oriented Components" (Ph.D. Dissertation)
    • "Mixin Layers: An Object-Oriented Implementation Technique for Refinements and Collaboration-Based Designs" (ACM TOSEM)
    • "Mixin-Based Programming in C++" (GCSE'00)
    • "Layered Development with (Unix) Dynamic Libraries" (ICSR'02): Unix dynamic libraries (shared objects) offer great support for layered programming
    • • source code