Personal tools
You are here: Home Events Previous

Previous

Past events

Event Murray Cole: Why Parallel Programming is Hard, and What We Should Do About It (from May 15, 2012 01:00 PM to May 15, 2012 02:00 PM)
Technological trends dictate that future commodity hardware will be highly parallel and heterogeneous. We will need programming models and tools which allow us to develop software which is performance portable, productively constructed, and energy aware(not to mention correct). I will offer opinions as to why current de facto standard approaches are not appropriate, and why a methodology based around the exploitation of patterns is the way forward.
Event Leonid Libkin: Atacama desert and incomplete information (from May 08, 2012 01:00 PM to May 08, 2012 02:00 PM)
Atacama desert is the driest place on earth and is so similar to Mars that Nasa uses it to test instruments for its Mars missions. As any other desert, it has oases which be used as nice escape places to discuss reseacrh. Running a workshop there would entail a not-so-short trip from Santiago (which takes a full day to get to from here), so I’ll tell you about the place first, and then briefly mention one question discussed there. It has to do with the old idea of connecting powerdomains with incompleteness in databases. It had to be revisited lately; I’ll tell you why, and then we’ll see how Gordon’s name (Plotkin powerdomain) appears in a somewhat unusual context.
Event LFCS Seminar: Phil Wadler (IF 4.31-33, from May 03, 2012 02:00 PM to May 03, 2012 03:00 PM)
Propositions as Sessions
Event Vijayanand Nagarajan: Towards Semantics-directed Hardware Memory Consistency (Mini Forum 2, from May 01, 2012 01:00 PM to May 01, 2012 02:00 PM)
The memory consistency model which mandates what value a memory read can return, is at the heart of shared memory concurrency. With regard to memory consistency models, an inherent trade-off between programmability and performance is presumed. For instance, it is thought that implementing sequential consistency (SC) would be too expensive as it is presumed that it would preclude hardware optimisations such as write-buffering. In this talk, we show that prior hardware SC implementations are overly restrictive in that they do not exploit most of the concurrency opportunities allowed by SC. We proceed to show how SC can be implemented efficiently while retaining hardware optimisations such as write-buffering. We conclude by arguing for semantics-directed hardware design for realising programmable, yet efficient shared memory consistency models.
Event LFCS Seminar: Fred Long (IF G.03, from Apr 20, 2012 11:00 AM to Apr 20, 2012 12:00 PM)
The CERT Oracle Secure Coding Standard for Java
Event Milner Symposium 2012 (Informatics Forum, from Apr 15, 2012 04:15 PM to Apr 18, 2012 04:15 PM)
 
Event LFCS Seminar: Sven Schewe (IF 4.31-4.33, from Apr 03, 2012 04:00 PM to Apr 03, 2012 05:00 PM)
Beautiful games you cannot stop playing
Event Database Seminar: Paris Koutris (IF 4.31-4.33, from Mar 22, 2012 02:00 PM to Mar 22, 2012 03:00 PM)
Query-based Data Pricing
Event LFCS Seminar: Dmitrios Vytiniotis (IF 4.31-33, from Mar 20, 2012 04:00 PM to Mar 20, 2012 05:00 PM)
Static contract checking for Haskell through FOL semantics
Event LFCS Seminar: Dave Parker (from Mar 13, 2012 04:00 PM to Mar 13, 2012 05:00 PM)
Automatic Verification of Competitive Stochastic Systems.
Event LFCS/ICSA Joint Seminar: Laurence Tratt, 29 Feb 2012 (Informatics Forum IF4.31+4.33, from Feb 29, 2012 03:30 PM to Feb 29, 2012 04:30 PM)
Domain specific languages: why? how? and where next?
Event ICSA/LFCS Joint Colloquium: Laurence Tratt (from Feb 29, 2012 03:30 PM to Feb 29, 2012 04:30 PM)
Domain specific languages: why? how? and where next?
Event LFCS/ICSA Joint Seminar: Laurence Tratt (from Feb 28, 2012 04:00 PM to Feb 28, 2012 05:00 PM)
Experiences of implementing a VM with RPython
Event LFCS Seminar: Christel Baier (from Feb 23, 2012 03:00 PM to Feb 23, 2012 04:00 PM)
Quantitative Analysis of Randomized Systems and Probabilistic Automata
Event LFCS Seminar: Christian Urban (from Feb 21, 2012 04:00 PM to Feb 21, 2012 05:00 PM)
Formalising Regular Language Theory with Regular Expressions
Event LFCS Seminar: Gilles Dowek (from Feb 07, 2012 04:00 PM to Feb 07, 2012 05:00 PM)
Pre-Heyting algebras and proof normalization.
Event LFCS Seminar: Anthony Widjaja Lin (IF 4.31-33, from Jan 27, 2012 02:00 PM to Jan 27, 2012 03:00 PM)
Tractability Results for Automata on (Vectors of) Numbers with Applications
Event LFCS Seminar: Dan Ghica (from Jan 20, 2012 02:00 PM to Jan 20, 2012 03:00 PM)
Towards a system-level semantics
Event LFCS Seminar: Ohad Kammar (from Jan 10, 2012 04:00 PM to Jan 10, 2012 05:00 PM)
Title: Algebraic Foundations to Effect-Dependent Optimisations
Event LFCS end of year quiz (Informatics Forum, from Dec 13, 2011 04:30 PM to Dec 14, 2011 04:30 PM)
 

Also in this section

Event Murray Cole: Why Parallel Programming is Hard, and What We Should Do About It (from May 15, 2012 01:00 PM to May 15, 2012 02:00 PM)
Technological trends dictate that future commodity hardware will be highly parallel and heterogeneous. We will need programming models and tools which allow us to develop software which is performance portable, productively constructed, and energy aware(not to mention correct). I will offer opinions as to why current de facto standard approaches are not appropriate, and why a methodology based around the exploitation of patterns is the way forward.
Event Leonid Libkin: Atacama desert and incomplete information (from May 08, 2012 01:00 PM to May 08, 2012 02:00 PM)
Atacama desert is the driest place on earth and is so similar to Mars that Nasa uses it to test instruments for its Mars missions. As any other desert, it has oases which be used as nice escape places to discuss reseacrh. Running a workshop there would entail a not-so-short trip from Santiago (which takes a full day to get to from here), so I’ll tell you about the place first, and then briefly mention one question discussed there. It has to do with the old idea of connecting powerdomains with incompleteness in databases. It had to be revisited lately; I’ll tell you why, and then we’ll see how Gordon’s name (Plotkin powerdomain) appears in a somewhat unusual context.
Event LFCS Seminar: Phil Wadler (IF 4.31-33, from May 03, 2012 02:00 PM to May 03, 2012 03:00 PM)
Propositions as Sessions
Event Vijayanand Nagarajan: Towards Semantics-directed Hardware Memory Consistency (Mini Forum 2, from May 01, 2012 01:00 PM to May 01, 2012 02:00 PM)
The memory consistency model which mandates what value a memory read can return, is at the heart of shared memory concurrency. With regard to memory consistency models, an inherent trade-off between programmability and performance is presumed. For instance, it is thought that implementing sequential consistency (SC) would be too expensive as it is presumed that it would preclude hardware optimisations such as write-buffering. In this talk, we show that prior hardware SC implementations are overly restrictive in that they do not exploit most of the concurrency opportunities allowed by SC. We proceed to show how SC can be implemented efficiently while retaining hardware optimisations such as write-buffering. We conclude by arguing for semantics-directed hardware design for realising programmable, yet efficient shared memory consistency models.
Event LFCS Seminar: Fred Long (IF G.03, from Apr 20, 2012 11:00 AM to Apr 20, 2012 12:00 PM)
The CERT Oracle Secure Coding Standard for Java
Event Milner Symposium 2012 (Informatics Forum, from Apr 15, 2012 04:15 PM to Apr 18, 2012 04:15 PM)
 
Event LFCS Seminar: Sven Schewe (IF 4.31-4.33, from Apr 03, 2012 04:00 PM to Apr 03, 2012 05:00 PM)
Beautiful games you cannot stop playing
Event Database Seminar: Paris Koutris (IF 4.31-4.33, from Mar 22, 2012 02:00 PM to Mar 22, 2012 03:00 PM)
Query-based Data Pricing
Event LFCS Seminar: Dmitrios Vytiniotis (IF 4.31-33, from Mar 20, 2012 04:00 PM to Mar 20, 2012 05:00 PM)
Static contract checking for Haskell through FOL semantics
Event LFCS Seminar: Dave Parker (from Mar 13, 2012 04:00 PM to Mar 13, 2012 05:00 PM)
Automatic Verification of Competitive Stochastic Systems.
Event LFCS/ICSA Joint Seminar: Laurence Tratt, 29 Feb 2012 (Informatics Forum IF4.31+4.33, from Feb 29, 2012 03:30 PM to Feb 29, 2012 04:30 PM)
Domain specific languages: why? how? and where next?
Event ICSA/LFCS Joint Colloquium: Laurence Tratt (from Feb 29, 2012 03:30 PM to Feb 29, 2012 04:30 PM)
Domain specific languages: why? how? and where next?
Event LFCS/ICSA Joint Seminar: Laurence Tratt (from Feb 28, 2012 04:00 PM to Feb 28, 2012 05:00 PM)
Experiences of implementing a VM with RPython
Event LFCS Seminar: Christel Baier (from Feb 23, 2012 03:00 PM to Feb 23, 2012 04:00 PM)
Quantitative Analysis of Randomized Systems and Probabilistic Automata
Event LFCS Seminar: Christian Urban (from Feb 21, 2012 04:00 PM to Feb 21, 2012 05:00 PM)
Formalising Regular Language Theory with Regular Expressions
Event LFCS Seminar: Gilles Dowek (from Feb 07, 2012 04:00 PM to Feb 07, 2012 05:00 PM)
Pre-Heyting algebras and proof normalization.
Event LFCS Seminar: Anthony Widjaja Lin (IF 4.31-33, from Jan 27, 2012 02:00 PM to Jan 27, 2012 03:00 PM)
Tractability Results for Automata on (Vectors of) Numbers with Applications
Event LFCS Seminar: Dan Ghica (from Jan 20, 2012 02:00 PM to Jan 20, 2012 03:00 PM)
Towards a system-level semantics
Event LFCS Seminar: Ohad Kammar (from Jan 10, 2012 04:00 PM to Jan 10, 2012 05:00 PM)
Title: Algebraic Foundations to Effect-Dependent Optimisations
Event LFCS end of year quiz (Informatics Forum, from Dec 13, 2011 04:30 PM to Dec 14, 2011 04:30 PM)
 
Document Actions