Design and Implementation of Modern Programming Languages (Seminar)

Transcription

1 Design and Implementation of Modern Programming Languages (Seminar)

2 Outline Administrivia Intro Schedule Topics

3 GENERAL INFORMATION

4 Intro Introduce students to the core techniques of scientific work Give a scientific talk Process of writing and publishing research papers Review a paper Learn an advanced topic on PL Compare and evaluate existing solutions

5 Timeline paper submission: peer review submission: 19.1 feedback meetings: camera ready: 2.2 Presentation day: 7.2 Please let us know if you have a conflict with the presentation day Start Early!

6 Guidelines and Suggestions Find new references Try not to summarize everything that's written in references or in the references' references. Be complete in the bibliography, deep in the analysis Tell a coherent story about one aspect of the topic. Please present technologies, with your own words and your own examples. E.g. : the same running example through the paper

7 Reviews A summary of the paper To demonstrate that you read and understood Suggestions for the author, regarding both content and presentation Be realistic and concrete A list of the major positive and negative issues Honest! mainly used to grade the reviewer, not the paper

8 Grades Paper 40 % Talk 40 % Reviews 20 % Once more. Tell a nice story. Compare things. Find advantages and limitations. Provide examples in different cases. Papers are there to read This is the value that you add

9 Where to start Send me an with your name and a list of 3 topics Order by preference. Or consider synergies with DAIMPL Check the details on the course website. Time slots for seminars Paper length and format Topics will be assigned We provide you some references as a starting point

10 TOPICS

11 Computation over compressed data Technique to operate on data without decompression Application to data structures, compact indices, etc Potential application: Big data systems They are communication bound They compress data before transmission Compression/decompression takes time

12 Programming Languages for the Blockchain "an open, distributed ledger that can record transactions between two parties efficiently and in a verifiable and permanent way. How to write smart contracts? Need a (specification?) language

13 Consistency in PL Distributed systems adopt a consistency level Eventual consistency Causal consistency So far, considered only in the middleware Review papers that consider consistency at the language level (e.g., annotations on values, transactions)

14 Languages for Software Defined Networks Network configuration is a traditionally complex task Heterogeneous, proprietary hardware Variety of custom scripts for switch configuration Low level details of packet matching and forwarding SDN can be programmed via software! Dedicated languages High-level abstractions

15 Symbolic execution Execute a program with symbolic input Collect constraints along the execution path to know more about values. Application: Guide testing with symbolic execution

16 Compiler optimizations for Advanced Hardware Architectures Hardware evolves continuously Compiler technology needs to adapt to keep up Application area: big data Columnar representation of data

17 Refactoring (focus on Asynchronous Applications) Refactoring is essential for software quality Need to port a lot of existing software Automatic tools solve this problem but have a number of limitations A number of applications are asynchronous Web applications, mobile apps Support via dedicated abstractions Async constructs, Event streams

18 Advanced type systems for Functional Reactive Programming Requirements for reactive systems Liveness Bounded memory Bounded execution time (real-time) Language techniques such as type systems can enforce constraints Survey of existing approaches Comparison with traditional type systems

19 THE END

20 Software Transactional Memories Concurrent programming is hard Thread-and-lock, race conditions, deadlocks, STM is a promising solution // Insert a node into a doubly linked list atomically atomic { newnode->prev = node; newnode->next = node->next; node->next->prev = newnode; node->next = newnode; } atomic { if (queuesize > 0) { remove item from queue and use it } else { retry } } Analyze and compare existing solutions for STMs

21 Tierless Languages Traditional development of Web applications Server side (e.g. servlet, php script,..) Client side (Javascript, ) Tierless languages unify the development of serverside and client-side components Network communication is hidden The compiler automatically generates the code for the server and for the client