Process Algebra Diary

I should be grateful if you could help disseminate this call for nominations. Feel free to post it on your blogs, send it to your collaborators and your department members, and post it on social networks.

The Gödel Prize for outstanding papers in the area of theoretical computer science is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery, Special Interest Group on Algorithms and Computation Theory (ACM-SIGACT). The award is presented annually, with the presentation taking place alternately at the International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC). The 22nd Gödel Prize will be awarded at the 41st ICALP in Copenhagen in July 2014.

The Prize is named in honor of Kurt Gödel in recognition of his major contributions to mathematical logic and of his interest, discovered in a letter he wrote to John von Neumann shortly before von Neumann’s death, in what has become the famous “P versus NP” question. The Prize includes an award of USD 5000.

Award Committee: The winner of the Prize is selected by a committee of six members. The EATCS President and the SIGACT Chair each appoint three members to the committee, to serve staggered three-year terms. The committee is chaired alternately by representatives of EATCS and SIGACT. The 2014 Award Committee consists of Krzysztof Apt (CWI Amsterdam), Giuseppe F. Italiano (Università di Roma Tor Vergata), Joseph Mitchell (State University of New York at Stony Brook), Andrew Pitts (University of Cambridge), Daniel Spielman (Yale
University), and Éva Tardos (Cornell University).

Eligibility: The rules for the 2014 Prize are given below and they supersede any different interpretation of the generic rule to be found on websites of both SIGACT and EATCS. Any research paper or series of papers by a single author or by a team of authors is deemed eligible if

1. the paper was published in a recognized refereed journal no later than December 31, 2013;
2. the main results were not published (in either preliminary or final form) in a journal or conference proceedings before January 1st, 2001.

The research work nominated for the award should be in the area of theoretical computer science. The term “theoretical computer science” is meant to encompass, but is not restricted to, research areas covered by ICALP and STOC. Nominations are encouraged from the broadest spectrum of the theoretical computer science community so as to ensure that potential award winning papers are not overlooked. The Award Committee shall have the ultimate authority to decide whether a particular paper is eligible for the Prize.

Nominations: Nominations for the award should be submitted by email to the Award Committee Chair Giuseppe F. Italiano: goedelprize at gmail dot com

Please make sure that the Subject line of all nominations and related messages begin with Goedel Prize 2014. To be considered, nominations for the 2014 Prize must be received by January 17, 2014.

Any member of the scientific community can make nominations. The Award Committee may actively solicit nominations. A nomination should contain a brief summary of the technical content of the paper(s) and a brief explanation of its significance. A printable copy of the research paper or papers should accompany the nomination. The nomination must state the date and venue of the first conference or workshop publication or state that no such publication has
occurred. The work may be in any language. However, if it is not in English, a more extended summary written in English should be enclosed. To be considered for the award, the paper or series of papers must be recommended by at least two individuals, either in the form of two distinct nominations or one nomination including recommendations from two different people. Additional recommendations may also be enclosed and are generally useful. The Award
Committee encourages recommendation and support letters to be mailed separately, without being necessarily shared with the nominator(s). The rest of the nomination package should be sent in a single email whenever possible. Those intending to submit a nomination should contact the Award Committee Chair by email well in advance. The Chair will answer questions about eligibility, encourage coordination among different nominators for the same paper(s), and also accept informal proposals of potential nominees or tentative offers to prepare formal nominations. The committee maintains a database of past nominations for eligible papers, but fresh nominations for the same papers (especially if they highlight new evidence of impact) are always welcome.

Selection Process: The Award Committee is free to use any other sources of information in addition to the ones mentioned above. It may split the award among multiple papers or declare no winner at all. All matters relating to the selection process left unspecified in this document are left to the discretion of the Award Committee.

The European Association for Theoretical Computer Science (EATCS) annually honours a respected scientist from our community with the prestigious EATCS Distinguished Achievement Award. The award is given to acknowledge extensive and widely recognized contributions to theoretical computer science over a life long scientific career.

For the EATCS Award 2014, candidates may be nominated to the Award Committee consisting of

• Leslie Ann Goldberg (University of Oxford)
• Kim Guldstrand Larsen (Aalborg University)
• Vladimiro Sassone (University of Southampton)

The deadline for nominations is December 31, 2013. Nominations will be kept strictly confidential. They should include supporting justification and be sent by e-mail to the chair of the EATCS Award Committee:

Leslie Ann Goldberg,
Department of Computer Science,
University of Oxford,
Wolfson Bldg, Parks Rd,
Oxford OX1 3QD United Kingdom
Email: leslie.goldberg@cs.ox.ac.uk

The list of previous recipients of the EATCS Award may be found at http://eatcs.org/index.php/eatcs-award.

The next award will be presented during ICALP 2014, which will be held in the period 7-11 July 2014 in Copenhagen,

The preliminary call for papers for ICALP 2014 is available here. (Warning: it is 19 MB, so don't be surprised if it takes some time to download it.) In case, you do not want to download the file, here is the most relevant information. (In the light of a suggestion in one of the comments to this post, I copy-pasted the whole preliminary CFP below.)

Conference dates: 7-11 July 2014
Submission deadline: 14 Feb. 2014
Notification date: 11 Apr. 2014
Final version due: 28 Apr. 2014
Location: IT University Copenhagen

The PC chairs are Elias Koutsopias (Track A), Javier Esparza (Track B) and Pierre Fraigniaud (Track C).

The invited speakers are

• Sanjeev Arora (Princeton University, USA),
• Maurice Herlihy (Brown University, USA)
• Viktor Kuncak (EPFL, CH), and
• Claire Mathieu (ENS Paris, France).

I hope that you will submit your best work to the conference. There will be a lot going on in Copenhagen in early late June-early July, both scientifically (SEA 2014, SWAT 2014 and ICALP 2014 will all take place one after the other) and culturally.

------------------------ FULL PRELIMINARY CFP -------------

Final manuscript due: Monday, 28 April 201

The Italian Chapter of the EATCS has reached an agreement with Atlantis Press (an imprint of Springer) for the publication of the best Italian PhD theses in TCS in a special series. Fabio Mogavero's thesis, awarded last year, is the first volume published under this agreement and can be found here . The thesis of the other winner from last year, Rossano Venturini , will be released soon.

Jacopo Mauro and Alessandra Scafuro are the two recipients of the Best Italian Ph.D. Thesis in Theoretical Computer Science Award 2013, and their theses will appear in the above-mentioned series in due course.

Congratulations to the above-mentioned young researchers!

Today, the dean of my school shared a well-written article by Tara Brabazon entitled "10 truths a PhD supervisor will never tell you". Here it is, for your reading pleasure.

The article contains useful advice for postgraduate students who are looking for a suitable supervisors, as well as some priceless quotes. I especially liked these two:

1. "Time is finite. Bureaucracy is infinite."
2. "If the prospective supervisor needs a personality replacement, lacks the life skills to manage a trip to the supermarket or requires electronic tagging so that he (or she) does not sleep with the spouses of colleagues, then make another choice. Supervisors should be functional humans."

The comments to that article offer a valuable counterpoint to the "ten truths" and are well worth reading too.

This is not exactly news since the announcement of the award was made a few days ago and I heard about it already during the ICALP 2013 conference dinner. However, since I have not come across any mention of the 2013 Edsger W. Dijkstra Prize in Distributed Computing on the TCS blogs, let me "announce" that the Dijkstra Prize Committee has selected Nati Linial as the recipient of this year’s Edsger W. Dijkstra Prize in Distributed Computing. The prize is given to him for his outstanding paper

You can read the official award citation here. Congrats to Nati Linial and to the award committee for an excellent choice.

The June 2013 issue of the Bulletin of the EATCS is now available as a single PDF file and from the open journal system. With this issue, we say goodbye to Maria Serna, who has been the editor in chief of the BEATCS for the last five years, editing 15 issues of the Bulletin. As current president of the EATCS, I warmly thank Maria for all the hard work she has put into the challenging task of editing the BEATCS while taking care of all her other duties. Her efforts were way beyond the call of duty.

From the October 2013 issue, the BEATCS will be edited by Kazuo Iwama. I wish Kazuo the best of luck in this new role and look forward to working with him.

If you have any suggestion on how to improve the quality of the BEATCS even further, feel free to contact Kazuo or me, or simply post your suggestions as comments to this blog post.

At long last, the EATCS has a YouTube channel. (Thanks to the EATCS Secretary office in Patras for setting it up and for making us enter the 21st century :-)) In due course, the videos of the invited talks and of the EATCS-Award-2013 presentation by Martin Dyer from ICALP 2013 will be available from that channel. For the moment, you can enjoy Erik Demaine's wonderful Presburger Award 2013 video.

Make sure that you subscribe to the channel to get updates on our postings.

The slides for Jon Kleinberg's inspiring EATCS lecture are available here. Several people asked me for the slides and Jon agreed to make them public. Thanks Jon!

Conference photos taken at ICALP 2013 can be found here. Enjoy.

The CAV Award for 2013 has been presented to Kim G. Larsen, Paul Pettersson and Wang Yi for their seminal work on Uppaal, which is the foremost tool suite for the verification of real-time systems and the synthesis of real-time controllers. Congratulations to the awardees for receiving this well deserved accolade and to the award committee for making such an excellent choice!

If you are interested in using the tool for research and/or teaching, simply download it and read this tutorial by Frits Vaandrager. You will be up and running in no time.


Uppaal has its roots in a tool originally developed in Uppsala and described in the conference paper Automatic verification of real-time communicating systems by constraint-solving co-authored by Wang Yi, Paul Pettersson and Mads Daniels (Proceedings of FORTE 1994). Since then, Uppaal has been jointly developed by Kim G. Larsen's research group at Aalborg University and by the group led by Wang Yi at Uppsala University. In this period, Uppaal has become an industrial-strength tool for computer-aided verification of computing systems that has been applied to many case studies by several research groups in academia and industry. The efficiency of its computational engine has been improved greatly by theoretical and practical advances relying on highly non-trivial insights. Moreover, the tool now supports the analysis of quantitative extensions of timed automata, automatic model-based testing of real-time systems and the synthesis of controllers in the context of timed games. It is still under continuous development.

Overall, the Uppaal tool is a real success story for the research community working on automated verification of computer systems. As all long-term research and tool development efforts, the work on Uppaal and its applications is due to many gifted researchers and their students. The CAV Award 2013 cannot recognize them all, but the list of authors of the many papers stemming from the work on UPPAAL gives a hint of the magnitude of the research effort involved in building such a tool over a period of nearly 20 years.

The best paper award session at ICALP 2013 was held last Monday before the welcome reception (which included excellent, and plentiful, finger food and wine). Mark Bun, John Fearnley and Dominik Pajak delivered very good presentations of the award-winning papers. I hope that you will check out their papers. In the case of the paper by Mark and Justin Thaler, you can also read this expository blog post.

The EATCS Award and the Presburger Award were delivered last Tuesday in a joint ceremony that also included the award of honorary doctorates to Josef Gruska and Juris Hartmanis. (See this earlier post of mine for some more information on the ceremony for the honorary doctorates.)

The master of ceremony for the award session was Paul Spirakis. First Martin Dyer received the EATCS Award from Friedhelm Meyer auf der Heide and delivered a presentation entitled Counting ain't easy. Martin started by citing the following fragment of a rhyme from the Winnie the Pooh books:

Cheers for Pooh!
(For who?)
For Pooh -
(Why, what did he do?)
I thought you knew

He then proceeded to give an accessible historical overview of what he did do, covering essentially all the work mentioned in the laudatio for the award.

Last, but by no means least, Tony Kucera presented the Presburger Award 2013 to Erik Demaine. Unfortunately, Erik could not be with us in Riga, but we had a virtual presentation of the award to him via Skype. Moreover, Erik produced an excellent video of a presentation that we could play and enjoy at the conference. Rather than attempting to summarize Erik's inspirational talk, I will simply limit myself to letting him speak for himself.

ICALP 2013 in Riga featured five invited presentations and a special EATCS lecture to celebrate the 40th edition of the ICALP conference.

The scientific program for the conference was preceded by short presentations by the rector of the University of Latvia and by Rusins Freivalds. The rector welcomed the ICALP participants, gave us some interesting information about the University of Latvia and wished us long coffee breaks. Rusins discussed the unity of science, and reminded us that, even at the time of the iron curtain, there was one Computer Science.

The conference proper was kicked off on Monday, 8 July, by an invited talk delivered by the Liverpool-bound Paul Spirakis. Paul's talk was entitled A Guided Tour in Random Intersection Graphs. Random Intersection Graphs are random graphs in which there is a universe M of labels and each one of the vertices selects a random subset of M. Two vertices are connected if, and only if, their corresponding subsets of labels intersect. Random intersection graphs were introduced by M. Karonski, E.R. Sheinerman and K.B. Singer-Cohen and have several applications, as well as a rich theory. Paul's talk provided a survey of the main results on the topic obtained by his research group on combinatorial problems over random intersection graphs, such as independent sets, Hamiltonian cycles, colouring, maximum cliques, expansion and random walks. Paul closed the talk by saying that this model is an excellent area of study for PhD students in TCS.

Tuesday's invited address was delivered by Daniel Marx. Daniel's talk has three chapters (his words) and was entitled The Square Root Phenomenon in Planar Graphs. Its starting point was the observation that most of the classic NP-hard problems remain NP-hard when restricted to planar graphs, and only exponential-time algorithms are known for the exact solution of these planar problems. However, in many cases, the exponential-time algorithms on planar graphs are significantly faster than the algorithms for general graphs: for various problems on planar graphs, one often sees a square root appearing in the exponent of the running time of the best algorithms for their solution. Daniel told his audience that, by now, we have a good understanding of why this square root appears: most of these algorithms rely on the notion of treewidth and its relation to grid minors in planar graphs. Daniel also argued that, under the Exponential Time Hypothesis, one can show that these algorithms are essentially best possible, and therefore the square root must appear in the running time.

In passing, Daniel contributed also one paper to ICALP Track A and one to ICALP Track B!

Susanne Albers delivered the invited talk on Wednesday, 10 July, on Recent Advances for a Classical Scheduling Problem. In her talk, Susanne revisited the classic on-line makespan minimization problem, which has been studied since the 1960s. After presenting the classic results on this problem, starting from Graham's 1966 List algorithm and its competitive analysis, she surveyed recent research on settings in which an online algorithm is given extra information or power while processing a job sequence.

The scientific programme on Thursday, 11 July, started with an invited talk by Orna Kupferman, who gave the only invited address that could be readily classified as belonging to ICALP Track B. Orna's presentation dealt with Formalizing and Reasoning about Quality. Traditionally, formal approaches to the verification of reactive systems are boolean in nature: either a system satisfies its specification or it doesn't. In case a system does not meet its specification, one expects a good verification framework to provide a counter-example, that is, a reason why the system is not correct. Orna and her co-authors have generalized formal specification and verification methods to address the quality of systems. In her talk, Orna introduced the linear temporal logic LTL[F], where F is a set arbitrary functions over the interval [0, 1]. Formulae in LTL[F] are interpreted over computations consisting of sequences of atomic propositions. The satisfaction value of an LTL[F] formula is a number between 0 and 1 that describes how well a computation satisfies a formula. The logic generalizes traditional LTL with the functions in F; examples of functions that might be in F are the maximum or minimum between the satisfaction values of subformulas (these are the quantitative counterparts of boolean OR and AND, respectively), their product and their average. In her talk, Orna showed us how to generalize classic decision problems in formal methods, such as satisfiability, model checking and synthesis, to search and optimization problems in the quantitative setting. This is achieved by means of an extension of the automata-theoretic approach to LTL to the setting of LTL[F].

Before the conference dinner, Jon Kleinberg delivered a special EATCS lecture to celebrate the 40th ICALP. Jon gave an inspiring and very articulate talk entitled Algorithms, Networks, and Social Phenomena. The talk discussed the development of computational models for systems involving social networks and large human audiences. In particular, Jon focused on how information spreads through such systems, and the ways in which this spread is affected by the underlying network structure. Jon said a few times that, despite having so much data at our disposal, we still do not understand human behaviour. However, IMHO, the work by Jon and his coworkers is shedding some light on some aspects of our behaviour.

Peter Widmayer delivered the last invited talk on Friday, 12 July. His presentation was entitled To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous, and was accessible and well paced. The starting point of Peter's talk was a "Socratic dialogue" between a statistical physicist and himself. Traditionally, in combinatorial optimization one assumes that an input instance is given with absolute certainty. The goal is then to find an optimum solution for the given instance. In contrast, as the statistical physicist would argue, input data are in reality uncertain, noisy and inaccurate. As a consequence, an optimum solution to a combinatorial optimization problem might not be meaningful in practice. (For example, the shortest path to our work place we computed yesterday evening might not be usable this morning because of changed traffic conditions.) Peter advocated the development of algorithms that find "meaningful" solutions in the presence of uncertain inputs, proposed an approach towards reaching this goal. and argued that it leads to good solutions in the real world.

Videos of these talks (with the exception of Kleinberg's talk, which, as far as I know, was not recorded) will be available in due course.

ICALP 2013 has just finished. It has been an action packed conference and there has been next to no breathing space. I think that the conference was a great success and the organizers deserve our most heartfelt thanks for all their work.

In case you do not know, the conference has being held in Riga at the University of Latvia. This has been the first time that ICALP has been organized in a country of the former Soviet Union and this was the 40th edition of the ICALP conference. First of all, kudos to the local organizers, who did their very best to make the conference a festive occasion and a very pleasant experience for all the attendees. The city of Riga is very pretty and all ICALP participants had a very warm welcome. The University of Latvia was also enrolling a new batch of students during ICALP and this meant that there was a continuous flow of young and happy-looking people on the university premises. This made the main hall of the university a very lively place to be. We were also blessed with sunny and warm weather, which also helped (especially coming from rainy Iceland).

According to the data presented by Agnis Škuškovniks, on behalf of the organizing committee, to the EATCS council and to the EATCS general assembly, there were 193 registered participants in ICALP 2013, of which 67 are students. Including the local participants, the six invited speakers and the two recipients of the honorary doctorates awarded on Tuesday (Josef Gruska and Juris Hartmanis), 217 people attended ICALP 2013. The pre-conference workshops were attended by 102 participants, which is a very healthy number.

The honorary doctorates were an excellent addition to the standard session devoted to the EATCS Awards. Gruska and Hartmanis delivered lucid and inspirational presentations. It was truly awesome to see Juris Hartmanis deliver an off-the-cuff speech on how he left Latvia and ended up at Cornell as chair of the newly-funded CS department. At 85, he is very articulate and sharp. I had the pleasure of discussing several subjects with him during a very pleasant dinner arranged by the organizers. He is still a truly inspirational figure.

Here are some quick EATCS- and ICALP-related news.

• ICALP 2014 will be held in Copenhagen, Denmark, immediately after SWAT 2013. It will be a four-day ICALP and the general chair for the conference is Thore Husfeldt.
• ICALP 2015 will be held in Kyoto, Japan, and will be co-located with LICS 2015. Kazuo Iwama is the ICALP 2015 general chair. This will be the first ever ICALP outside Europe.
• The EATCS will soon announce and EATCS Fellows programme. The first deadline for nominations will be at the end of this year and we plan to make the first announcement of fellows at ICALP 2014 in Copenhagen.
• The EATCS will begin a new EATCS Young Researcher School Series from 2014. The first school in the series will be organized by Tony Kucera in a beautiful location in Moravia in late July/early August. The theme of the school will be "Automata, Logic and Games".
• Orna Kupferman gave a thought-provoking talk on "The Gender Challenge in TCS" at the EATCS General Assembly. It really got the audience thinking about this important matter.

In case you are interested in having a look, the slides I used for the EATCS general assembly, where the above decisions where made or communicated, are here.

In a subsequent post, which I will write when I get home, I will try to discuss some of the many scientific highlights at ICALP 2013.

To conclude, at the conference I heard that Paul Spirakis is moving to the University of Liverpool. Good luck to Paul!

I have been asked to advertise this position, which might be of interest to several of my readers and their graduating PhD students/postdocs.

The Language Based Technology section of DTU Applied Mathematics and Computer Science has a new opening for associate and/or assistant professors.

The School of Computer Science at Reykjavik University has, at long last, created its own YouTube channel. See https://www.youtube.com/user/rucomputerscience. We are uploading videos of talks from season one of our Pearls of Computation seminar series and from last year's Alan Turing Year events, as well as other material that might be of general interest.

In case you are interested in following the events we organize, I'd be grateful if you could spend approximately 5 seconds to open the page and click "Subscribe". Thanks in advance!

I would like to have some blog coverage for ICALP 2013. If you are attending the 40th ICALP in Riga and you are interested in guest blogging, drop me a line. Ideally, I would like to have a guest blogger for each of the tracks in the conference. You are, of course, also most welcome to blog about the five invited talks and the award ceremonies.

I have been asked to distribute this call for applications for PhD positions in a newly founded international PhD School in Italy, the Gran Sasso Science Institute. I hope that you will encourage some of your best students to apply.

------ PhD Positions at GSSI L'Aquila, Italy - CALL FOR APPLICATIONS -------

Dear Colleagues,

I would like to ask for your help in spreading around the call for application for PhD candidates in Computer Science at the Gran Sasso Science Institute (GSSI)

<http://www.gssi.infn.it/index.php/en/announcements-all/400-ph-d-call-forapplications>

We are particularly interested in attracting foreign students. So it would be great if you can deliver this announcement through your emailing lists in your countries.

The deadline for applying to the program is 15th july.

Students will be offered free housing and meals plus the standard three years PhD grant. The official language is English.

GSSI is a new initiative that is starting in L'Aquila as a consequence of the redevelopment plan after the earthquake. The school is managed by INFN (http://www.infn.it/index.php?lang=en) and will start a PhD program in Computer science that is centered around new generation computing, including distributed, ubiquitous and autonomous systems, with emphasis on three main disciplinary pillars: algorithms, software engineering and specification and analysis.

There will be other three Phd programs offered by GSSI, one concerning urban studies, one in Physics mainly centered around astro-particles phisics because of the proximity with the famous Lab
(http://www.lngs.infn.it/), and another in Mathematics centered around mathematical modeling.

The school is supported by other three Italian already established graduate schools, IMT in Lucca for computer science (www.imtlucca.it<http://www.imtlucca.it/> ), SISSA in Trieste for mathematics and physics
(http://www.sissa.it/), and Scuola Superiore S. Anna in Pisa for urban studies (www.sssup.it <http://www.sssup.it/> ).

Thank you in advance for your attention and your support.

As some of you might know already, the Gödel Prize 2013, which is awarded jointly by ACM SIGACT and the EATCS, goes to the authors of the following two papers:


The press release issued by the ACM is available at

www.acm.org/press-room/news-releases/2013/goedel-prize-13/

Congrats to the award recipients.

Anna and I are running a three-week, intensive, first-year course in which the students use Uppaal to make models of computing systems and games, and to analyze them using the verification capabilities of that excellent tool. The students find it very easy to use the tool, and can start solving modelling and verification problems with it in a jiffy.

One of the groups of students taking the course delivered a neat video with their solution to one of the problems we posed them. It is the first time I ever received a video as part of a student report. I expect that this will be the first of many.

The leadership of the EATCS has decided to decouple the production of the Bulletin of the EATCS (BEATCS) from its editorship. Starting from the October 2013 issue, the BEATCS will be produced, printed and shipped by our Secretary Office in Greece. We think that this change was overdue, and that it will help us improve both the production and the scientific quality of the BEATCS. From the October 2013 issue, the editor in chief of the BEATCS will focus solely on the scientific content of the Bulletin.

Our colleague Maria Serna has served as editor in chief of the BEATCS for a long time and has many other commitments. Therefore, we feel that the time has come to appoint a new editor, whose job will be to continue improving the quality and the impact of the Bulletin, in cooperation with the Council of the EATCS and following on Maria's footsteps.

We hereby ask you for expressions of interest to the role of editor in chief of the BEATCS. Each expression of interest for the position should be accompanied by a couple of paragraphs describing your vision for the future of the BEATCS. You are also most welcome to propose suitable candidates for the position other than yourselves.

Please send your nominations to me via email by the 30th of April at the latest.

I take this opportunity to offer Maria Serna our heartfelt thanks, on behalf of the EATCS, for all the work that she has done over the years as editor in chief of the Bulletin. We really appreciate the effort she has put into this important service to the EATCS and the TCS community as a whole.

All the best,

Luca Aceto
President of the EATCS

Season one of the new Pearls of Computation seminar series at Reykjavik University is in full swing.

On Friday, 15 February 2013, my ICE-TCS colleague Eyjólfur Ingi Ásgeirsson (School of Science and Engineering, Reykjavik University) delivered a talk on E.W. Dijkstra entitled The shortest path to beautiful code ( - DEATH TO GOTO - ).

• Recording of the talk (slides and audio) in .avi format.
• Slides with the three "silly games" mentioned in the talk. [Solutions]
• An Interview With Edsger W. Dijkstra by Thomas J. Misa, Communications of the ACM, Vol. 53 No. 8, Pages 41-47.
• E. W. Dijkstra Archive.
• K.R. Apt, Edsger Wybe Dijkstra (1930 -- 2002): A Portrait of a Genius. Formal Aspects of Computing, 14, pp. 92-98, 2002.

The following talk was held on Friday, 5 April 2013, when Kristinn R. Thorisson (School of Computer Science, Reykjavik University) delivered a presentation on the work of Marvin Minsky entitled Marvin Minsky: Pioneer, Critic, Optimist.

• Recording of the talk (slides and audio) in .mp4 format.
• Human Interface video played by Kristinn during the talk.
• NOVA Interview with Marvin Minsky.

Enjoy!

The best paper awards at ICALP 2013 will go to the following papers:

• Track A: Mark Bun and Justin Thaler. Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities.
• Track B: John Fearnley and Marcin Jurdziński. Reachability in Two-Clock Timed Automata is PSPACE-complete.
  
• Track C: Dariusz Dereniowski, Yann Disser, Adrian Kosowski, Dominik Pajak and Przemysław Uznański. Fast Collaborative Graph Exploration.

The best student paper awards will instead go to:

• Track A: Radu Curticapean. Counting matchings of size k is #W[1]-hard.
• Track B: Nicolas Basset. A maximal entropy stochastic process for a timed automaton.

None of the accepted papers for Track C was a student paper.

Congratulations to all the recipients of the best paper awards! I look forward to listening to their talks at ICALP 2013.

The list of accepted papers for ICALP 2013 is now available (with and without abstracts). ICALP 2013 is the 40th ICALP conference. I hope to see many of you in Riga to celebrate this event.

The School of Computer Science at Reykjavik University seeks to hire a faculty member for a new academic position in the field of interactive narrative and game design. We are interested in an ambitious, highly qualified academic who can combine innovative teaching and cutting-­edge research in the rapidly evolving area of interactive digital entertainment within our school.

The faculty position is funded through a collaboration with massively multiplayer game developer CCP Games Inc. We are particularly interested in active researchers who see opportunities in breaking new ground with CCP and with existing faculty within Reykjavík University, in particular within CADIA, the school's artificial intelligence research center. CCP will fund the faculty position for a minimum of 5 years; following that period, CCP and Reykjavík University will seek continued funding for the position. Full academic freedom is respected, however, by both CCP and Reykjavík University.

See here for more information. The application deadline is 30 April 2013 and interviews will be held in May 2013.

This is not news anymore, but the list of accepted papers for LICS 2013 is available here.

As usual, the accepted papers look very interesting and I hope to find the time to read several of them when they become available. (This might be wishful thinking. It seems that finding time to read papers is getting harder by the day, alas.)

For what it is worth, here are two papers that immediately caught my attention browsing through the list of accepted papers and that are available on line.

• Dexter Kozen, Kim Guldstrand Larsen, Radu Mardare and Prakash Panangaden. Stone Duality for Markov Processes.
• Mikołaj Bojańczyk, Bartek Klin, Sławomir Lasota and Szymon Toruńczyk. Turing Machines with Atoms.

To whet your appetite, here is what is probably the main result in the latter paper.

Theorem: In sets with equality atoms, there is a language that is decidable in nondeterministic polynomial time, but not deterministically semi-decidable.

Before you get carried away, here is what the authors write below the statement of this theorem.

A consequence of the theorem is that, with atoms, P is not equal to NP. It is not our intention to play up the significance of this result. In a sense, the theorem is too strong for its own good: it shows that computation with atoms is so different from computation without atoms, that results on the power of nondeterminism in the presence of atoms are unlikely to shed new light on the power of nondeterminism without atoms.

Congratulations to all the authors of accepted papers.

Happy Easter news for the TCS community. Samson Abramsky is being awarded the British Computer Society (BCS) Lovelace Medal for 2013. (The press release is here.) The BCS Lovelace Medal was established in 1998 in honour of Lady Augusta Ada Byron, Countess of Lovelace and daughter of Lord Byron. The Medal is presented annually to individuals who, in the opinion of BCS, have made a significant contribution to the advancement of Information Systems.

Quoting Samson,

It is particularly pleasing that this award recognizes work of a highly foundational character, and shows the commitment of BCS to support the study of computing not only for its manifold applications, but as a fundamental scientific discipline in its own right.

As the press release states, Samson

is pre-eminent in setting the modern agenda in the foundations of computer science, an area where he has made immense contributions since the 1980s. His contributions in each of the past three decades had a major impact on the field, notably: Domain Theory in Logical Form, Game Semantics and Categorical Quantum Mechanics. He has shown the ability to change research fields and to establish new interdisciplinary approaches. His work over the past decade has shown that methods and concepts developed in theoretical computer science can be applied very directly in quantum information, and the foundations of quantum mechanics itself.

Another recent example of application of methods from "volume B TCS" to other fields is in this short paper, where Samson and Wiktor Winschel apply coalgebraic and other structural methods originating from computer science to economics and game theory.

Congratulations to Samson!

Courtesy of Robbert Dijkgraaf's media page.

The following piece of text has been going through my head since the meeting of an award committee I attended earlier this week. I had to get rid of it by writing it down. So here it is, for your reading pleasure. I thought that it was best to choose a "How to have your abstract rejected" style for this piece.

You have just seen the call for nominations for an award and you have an excellent candidate for this accolade in mind. The call for nominations asks for a letter of nomination and gives some criteria that a nominee for the award should satisfy. How can you increase the chances that your nomination will be unsuccessful? The aim of this short piece is to present some simple approaches that are guaranteed to increase the chances that your nomination will be unsuccessful, even if you were nominating Albert Einstein for the Relativity Award 2013.

The first step in ensuring lack of success of a nomination is not to read the guidelines in the call for nominations. This will make it highly likely that your letter will not address at least some of the criteria that a good nomination should have. However, this leaves open the possibility that, by chance, your letter of nomination address some of the most important criteria for nominating your candidate. The best approach to prevent this from happening is to be systematic. Do read the call for nominations and make sure that you avoid addressing each of the criteria listed there. For example, if the call asks for (a link to) a CV, do not provide any!

However, the systematic approach requires precious time, effort and organization. Isn't there a better way to achieve your goal of submitting an unsuccessful nomination without sweating too much? Indeed there is! The perfect, no-sweat unsuccessful letter of nomination is a one liner that reads:

Submitting this letter template, which you should feel free to reuse, will strongly indicate to the award committee that is in charge of evaluating the nominations and of selecting the award recipient(s)

1. that you really do not know why the nominee deserves the award, and
2. that you are not willing to invest any time and effort in finding out why the nominee is worthy of the honour and in convincing the committee that (s)he is the one to select.
   

Is there a better way of achieving your goal? If so, I should really like to know.

I am enjoying reading Out of Their Minds (The Lives and Discoveries of 15 Great Computer Scientists) by Dennis Shasha and Cathy Lazere. IMHO, the book does a great job in making the lives and ideas of some of the leaders in our field accessible to a general public. I will recommend it to my students and to the colleagues of mine who will prepare future Pearls of Computation seminars.

At the end of the chapter devoted to Donald E. Knuth, the authors quote Don Knuth as saying:

I do one thing at a time. This is what computer scientists call batch processing---the alternative is swapping in and out. I do not swap in and out.

This quote reminded me a TED talk, in which Italian designer Paolo Cardini encourages his audience to consider the virtues of monotasking.


For several years in my career, I was largely a monotasking person. In my research, I mostly worked on one thing at the time. However, this has changed substantially over the years. Now I find myself multitasking and context switching a lot and this leads to more stress at work. I guess that most of us have a similar story to tell; the length of the list of things to do increases much faster than our ability to get things done, alas.

Stephen Cook has received Canada's highest honour, the Gerhard Herzberg Canada Gold Medal for Science and Engineering. More on Stephen Cook's Herzberg Canada Gold Medal can be found here.

The EATCS Awards Committee, consisting of Leslie Ann Goldberg, Vladimiro Sassone and Friedhelm Meyer auf der Heide (chair), has unanimously decided to give the EATCS Award to Martin Dyer. The laudatio for Martin Dyer is available here. Martin's Wikipedia page mentions his key achievements in

(1) - polynomial time algorithm for approximating the volume of convex bodies (with Alan Frieze and Ravindran Kannan)
(2) - linear programming in fixed dimensions
(3) - the path coupling method for proving mixing of Markov chains (with Russ Bubley)
(4) - complexity of counting constraint satisfaction problems.

In addition, the laudatio singles out his work with Alan Frieze on developing the probabilistic analysis of algorithms. Dyer and Frieze showed that many NP-hard problems arising in combinatorial optimisation can be solved in polynomial expected time when the instances are drawn from natural distributions.

Congratulations to Martin!

Source: One of the Computer Science students at Reykjavík University

The Presburger Award Committee, consisting of Peter Widmayer, Antonin Kucera and Monika Henzinger (chair), has unanimously decided to propose Erik Demaine (MIT, USA) as recipient of the 2013 EATCS Presburger Award for young scientists. Congratulations to Erik!

The Presburger Award is sponsored by CWI, Centrum Wiskunde & Informatica.


The citation for the award reads as follows.

Erik Demaine, born in 1981, has made outstanding contributions in several fields of algorithms, namely computational geometry, data structures, graph algorithms and recreational algorithms. In computational geometry and data structures he has solved or made significant progress on classic problems such as the carpenter’s rule problem, the hinged-dissection problem, the prefix-sum problem, and the dynamic optimality conjecture. In graph algorithms he used the powerful theory of graph minors to develop a suite of algorithms for approximately solving a general family of intractable problems. He also started the new field of computational origami, where his book is the leading authority in the field. His work has shown promising applications to computer graphics, sensor networks, molecular biology, programmable matter, and manufacturing and engineering.

The committee recommends Erik Demaine as an exceptional young scientist who fully deserves the Presburger Award.

The committee would also like to mention that the quality of all nominations submitted this year was very high. The Presburger Award is attracting the best young scientists in the field of theoretical computer science worldwide.

Addendum, 14 February 2013: Check out a Popular Science article on Erik's work here: http://www.popsci.com/science/article/2013-01/dazzling-sometimes-absurd-always-playful-genius-erik-demaine.

The poster has been designed by the talented team at Podpunkt. In case you need a good design for book covers, logos or posters, you might wish to consider them. Look at their portfolio and enjoy their work. As I remarked in an earlier post, the Podpunkt studio has strong connections with mathematics and TCS.

The second call for papers for ICALP 2013 is available here. I hope that several readers of this blog will submit some of their best work to the conference. The deadline for submissions is February 15.

This is the 40th ICALP and, in addition to the invited talks and the award addresses, will also feature a special EATCS Lecture by Jon Kleinberg to celebrate this festive occasion.

This coming Friday I will kick off a new seminar series organized by ICE-TCS at Reykjavik University. The seminar series is called Pearls of Computation and aims at presenting the work of some of the recipients of the ACM Turing Award (or of some other major award related to computer science) in an accessible way. The target audience consists of students in computer science and anyone with a potential interest in the subject. (The inspiration for this seminar series comes from the Pearls of Theory talks that were held at BRICS in Aarhus in a past that looks so far away now.)

We will try to tell the stories behind the scientific contributions of some of the key figures in computer science in a non-technical way, highlighting the context in which they were made, the state of the art at the time, why they are important and what impact they have had. In the process, I believe that both the attendees and the speakers will all learn something new and develop an increased appreciation (and, why not, pride) for the contributions of some of the people who have shaped our field.

My inaugural talk in this series will be devoted to the life and work of Robin Milner (1934-2010), whose work has had a deep and lasting influence on my modest contribution to concurrency theory. The schedule for the talks that will take place this semester is available here.

Jaco de Bakker, one of the founding fathers of the EATCS and a prominent Dutch TCS researcher, passed away on December 13, 2013. The following obituary by Jan Bergstra, Jan Willem Klop and Jan Rutten has been circulated recently on the Concurrency mailing list and appears on the web site of the Academia Europaea as well as on the EATCS web site.

On December 13, 2012, our colleague Jacobus Willem (Jaco) de Bakker,member of the Section Informatics of the Academia Europaea since 1990, passed away surrounded by his family in his home in Amsterdam after a short illness. He is survived by his wife Angeline, his children Bas, Jaska, Catrien, Jacob and Lisa, and two grandchildren.

Jaco was born on March 7, 1939, in Ede, the Netherlands. He was for more than 38 years, from 1964 until 2002, connected as Head of the Computer Science Department to the Mathematical Centre, later called CWI (Centrum Wiskunde & Informatica) in Amsterdam. He was a Fellow of CWI since 2002. In 1973 he was appointed as Professor in Computer Science, in particular for the mathematical semantics of programming languages and reasoning on program correctness, at the VU University Amsterdam, at that time called Vrije Universiteit Amsterdam. He occupied this professorship until his emeritate in 2002. In 1989 he was appointed as a member of the Royal Netherlands Academy of Arts and Sciences (KNAW), in the Section Mathematics. In 1972, Jaco was one of the founding fathers of the EATCS, the European Association for Theoretical Computer Science; he was Vice-President of the EATCS from 1972 until 1982, and Member of the Board until 1988. Since 1998 he was honorary member of IFIP Working Group 2.2, Formal Description of Programming Concepts. In 2002, during his retirement symposium at CWI, he received the Royal Decoration Knight of the Order of the Lion of the Netherlands (Ridder in de Orde van de Nederlandse Leeuw).

Jaco de Bakker started his scientific career with his Ph.-D. thesis in 1967 at the University of Amsterdam, with promotor Adriaan (Aad) van Wijngaarden, entitled: Formal Definition of Programming Languages: with an Application to the Definition of ALGOL 60. Jaco de Bakker was world-wide known and recognized for his pioneering work in developing the denotational and operational semantics of many basic features in programming languages, in a precise and rigorous mathematical style. One of its highlights became known as
the induction rule of De Bakker and Scott. This culminated in his book Mathematical Theory of Program Correctness (1980). Later on, in the early eighties, he turned to the theory of communicating processes, introduced by Hoare and Milner, a theory known in those days as "concurrency". His initial investigations in this field were in cooperation with Jeffery Zucker. The basic features in this theoretical area were treated in the same mathematically rigorous style in his book Control Flow Semantics (1996) together with Erik
de Vink. Apart from these books, he wrote more than 150 scientific articles.

In the Netherlands Jaco de Bakker was the originator of an extensive school of theoretical computer scientists. He supervised many Ph.D.-theses, and was the driving force in the eighties, together with Willem-Paul de Roever and Grzegorz Rozenberg, behind several nation-wide programmes for research and education in the Netherlands, such as REX (Research and Education in Concurrent Systems). REX lasted from 1988 to 1993; it was preceded by LPC (Landelijk Project Concurrency, National Project Concurrency) from 1984-1988. Prior to these programmes Jaco was Director, together with Jan van Leeuwen, of the 'Advanced Course on Foundations of Computer Science', a biennial series of influential courses with international attendance, from 1974 to 1982, held in Amsterdam. Jaco was also one of the founding fathers in 1979 of the Dutch Association for Theoretical Computer Science (WTI, Werkgemeenschap Theoretische Informatica), since 1995 called NVTI (Nederlandse Vereniging voor Theoretische Informatica). Jaco was Chairman of the WTI from 1979 until 1987. Jaco was proud of the fact that 32 scientists who at some time worked in his group were eventually appointed full professor.

Also in the eighties, Jaco was instrumental in stimulating the involvement and participation of the Dutch research community in the big European computer science frameworks such as FAST, Meteor, ESPRIT (European Programme for Research in Information Technology) and BRA (Basic Research Actions). As Head of the CWI Department Software Engineering he stimulated intensive contacts with the European research community, resulting in a lively and productive research atmosphere in which researchers of many nationalities cooperated on a regular basis.

In addition to playing a crucial role in education and research in theoretical computer science, Jaco de Bakker was also a gifted and respected science director and administrator. He influenced the lives of many of us. We all remember him as a great scientist and an amiable person. Moreover many computer scientists will remember him as a friend.

Jan Bergstra, Jan Willem Klop and Jan Rutten

I have been asked to distribute this announcement, which was sent on the IMU Newsletter. This sounds like a potentially interesting initiative, which might be of interest to some of the young researchers in TCS.

You may have heard of the Lindau Nobel Laureate Meetings
which are now in their 63rd year and have become a unique
platform for the dialogue between different scientific
generations in medicine, physics, chemistry, and the
economic sciences, fields for which Nobel Prizes are
awarded, see http://www.lindau-nobel.org/.

Creating a similar event for mathematics and/or computer
science has been contemplated by various persons and groups.
Thanks to Klaus Tschira and his foundation, this idea has
now become reality.

The first Heidelberg Laureate Forum will take place from
September 22 until 27, 2013 and bring together the best
students in mathematics and computer science with winners
of the most prestigious awards in these two disciplines:
Abel, Fields, and Turing Laureates. Detailed information
can be found at http://www.heidelberg-laureate-forum.org/.

The Heidelberg Laureate Forum is supported by various
institutions, among these are
- The Norwegian Academy of Science and Letters
- The Association for Computing Machinery (ACM)
- The International Mathematical Union (IMU)
which award the three outstanding prizes.

Application:
============
In the attachment is the press release which describes
how young researchers in the fields of mathematics and
computer science can apply for participation. The
application Web page is:
http://www.heidelberg-laureate-forum.org/heidelberg-laureate-forum-2013/application/.

IMU asks the readers of IMU-Net to distribute this
information among their friends and colleagues so
that as many potential candidates for participation
as possible are reached. Please note that the
application deadline is

February 15, 2013.

TCS folks might like to know that the American Mathematical Society has announced that Alexander Razborov is the recipient of the 2013 AMS David P. Robbins Prize. The Robbins Prize is given every three years for a paper that reports on novel research in algebra, combinatorics, or discrete mathematics.

Razborov receives the prize for his paper "On the minimal density of triangles in graphs" (Combinatorics, Probability and Computing, 17 (2008), no. 4, 603-618), and for introducing flag algebras to solve problems in extremal combinatorics.

The full citation for this prize and additional information can be found in the massive Joint Mathematics Meetings Prize Booklet. Bloggers may like to read the response by John Baez to receiving the 2013 AMS Levi L. Conant Prize. (Presented annually, the Conant Prize recognizes the best expository paper published in either the Notices of the AMS or the Bulletin of the AMS in the preceding five years.) John writes:

I put a lot of energy into explaining math and physics online. Blogging is no substitute for more formal writing about academic subjects, but it fills a gap, especially for the millions who don’t live near a good research university. Socrates complained that “writing is unfortunately like painting, for the creations of the painter have the attitude of life, yet if you ask them a question they preserve a solemn silence.” This is no longer true with blogs: the author is there to answer your questions! So, I am hoping that eventually blogs will be taken seriously by academia and the AMS will have an award for the best mathematics blog. But I am very happy to receive this prize for a more traditional form of mathematics exposition.

Congratulations to all the prize recipients and happy 2013 to everyone.

The inspiration from this piece, which I post as a finale for the Turing Year events at Reykjavik University, comes from "Il Bivio di Alan" by Mario Cristiani, Chiara Bodei and Maria Rita Lagana, which was in turn inspired by the radio drama "Turing's Test" by Phil Collinge and Andy Lord. I thank Chiara Bodei for sharing their piece with me. The text below is not much more than a translation of "Il Bivio di Alan", which you can watch here (in the original Italian version). The version of the play below was acted at Reykjavik University on Thursday, 29 March 2012.




This dialogue is set in a simply furnished bedroom. A man, Alan Turing, is lying on the bed motionless. On the side table lies a half-eaten red apple. A desktop computer suddenly materializes out of thin air on a desk next to the bedroom's window. The computer screen lights up, the machine boots up and produces a jingle similar to the Window's one .

Computer: Start-up completed. Time reset. Welcome everyone. Today is the 7th of June 1954. The man who lies on the bed next to me is Alan Mathison Turing. He just committed suicide by eating an apple poisoned with cyanide, just like Snow White in his favourite fairy tale.

Many of you probably won't know who Alan Turing was, but you all use computers like me without knowing that we are children of his genius. His code-breaking work at Bletchley Park during World War II was instrumental in deciphering the Enigma code used by the Nazi Navy, and definitely shortened the war. Alan Turing is also considered by many to be the father of Artificial Intelligence. He realized very early on that computing machines could be used to solve symbolic manipulation problems, such as playing checkers and chess, and solving jigsaw puzzles. This realization led him to ask a fundamental philosophical and scientific question: "When can a computing machine be said to be intelligent?" To answer this question, Turing proposed the Turing Test, which was based on the idea that a computer could be said to exhibit intelligence if a human interrogator could not distinguish it from a human being. HAL 9000, the computer in 2001 Space Odyssey supposedly passed the Turing test. To this day, I am not aware of any of my fellow machines that can do so. However, in 2012, often humans are tested using CAPTCHAs, which are reverse forms of the Turing Test in which humans try to convince a computer that they are indeed humans!

One would expect that, during his life, Turing would have been celebrated for all these monumental achievements. However, nothing could be further from the truth. Turing's life was a sad one. He was a homosexual at a time when homosexuality was a crime in the UK, he was convicted of gross indecency and was given a choice between imprisonment or chemical castration via oestrogen hormone injections. He chose the latter and, on this day, he committed suicide.

Computer: Alan, Alan, wake up! Can you hear me?

Turing: Who....what are you?

Computer: I am the product of your imagination. I am your machine.

Turing (as if talking to himself): I did not know that poison had this effect.

Computer: This has nothing to do with poison. I am the incarnation of your Universal Turing Machine, of the programmable computer you dreamt up in 1936 while solving a problem in mathematical logic. Since then, it was only a matter of time before someone built me based on your detailed plans. You could have done so yourself, had you not stopped dreaming.

Turing: I did not want to stop, but they turned my life into a nightmare. They came to ask for my help when my nation needed me to understand encrypted messages exchanged by the Nazi forces, but then I became a liability because of my homosexuality.

In all honesty, I loved to work at Bletchey Park and to develop algorithms for code breaking, to discover meaning where there seemed to be none, to develop machines that could help us analyze increasingly more sophisticated encrypted messages. It was like a game, it was like testing oneself by running a marathon in 2 hours and 46 minutes. I am still proud of that time.

Then, the same people who enlisted my help forced me to act against my own self. But why am I saying this to you? You do not think!

Computer: Are you sure? After all, you are the one who argued that machine intelligence might be possible and invented the Turing Test! Didn't you suggest that a machine be built to emulate the thinking process of a child and that it be trained to develop into a machine that could think like an adult human being?

Turing: Yes, I did. The times were not ripe though. Just as they were not ripe for my active homosexuality. The authorities were afraid that I could leak secrets to handsome Russian spies, I guess. (Laughs bitterly.)

Turing the scientist was of help to them: they treated that one well during the war and honoured him with an OBE. However, Turing the man was indecent, immoral and even dangerous for national security.

Computer: But, the man and the scientist are one! They should have seen what your worth to humanity had been.

Turing: My worth.... Do you know how much I am worth? A shirt, five fish knives, a pair of trousers, three pairs of shoes, a compass, an electric shaver and an open bottle of sherry. This is what I am worth!

Computer: What is that?

Turing: This is what my boyfriend took from my apartment. This is the list of things I denounced to the police as stolen goods. I was in love with him. I do not think that you can understand.

Computer: Perhaps not. What happened afterwards?

Turing: I admitted my homosexuality and told them that there was nothing wrong with it, that one day homosexuality will not be a crime any more.

They offered me a choice: imprisonment or a "cure" via injections with female hormones.

Computer: I know that you chose the latter.

Turing: Yes, and look at what I have become. I have started growing breasts, I have the voice of a female actress and my mind has gone with my body. Do you know how it feels not to be able to recognize yourself any more? This is what remains of Alan Turing: a broken mind in a broken body --- the body of a loser.

Computer: You are wrong. This is not what will remain of you. So many ideas and technological advances converged to create a modern computer like me that it is foolhardy to give one person the credit for inventing it. But the fact remains that everyone who, in the year 2012, taps at a keyboard, sending an email, or opening a spreadsheet or a word-processing program, is working on an incarnation of your Universal Turing Machine.

You will be remembered for your scientific legacy, which will have a far greater impact than, perhaps, even a visionary like you could have ever imagined.

Turing: This will not help me now that I am dead.

Computer: May I ask you why someone like you, who could run a marathon and endure the ensuing pain, ended up committing suicide?

Turing (after a long pause): Perhaps so that the memory of Turing the man could live forever like the one of Turing the scientist. Perhaps, for once and unexpectedly, logic failed me.

The lights slowly fade and the room darkens.

The deadline for submitting nominations for the EATCS Award 2013 and the Presburger Award 2013 is December 31. You have a little longer to propose papers for the Gödel Prize 2013 (deadline for nomination: 11 January 2013), which is jointly awarded with SIGACT.

I hope that you will take the time to send in nominations for those awards and to honour the work of some of the many outstanding researchers in TCS.

Xavier Leroy of the Paris-Rocquencourt research center of INRIA, France, is the recipient of the 2012 Microsoft Research Verified Software Milestone Award. The award is given in recognition of Xavier's role as architect of the CompCert C Verified Compiler as well as his leadership of the development team.

The formal presentation of the Award will be made to Xavier at POPL 2013, which will take place in Rome, January 23-25, 2013.

The full award citation can be accessed here . Its executive summary reads:

"Microsoft Research is delighted to celebrate the advances made by Dr Leroy in the vital field of software verification. Compilers are the basis for all the software we generate, and by ruling out compiler-introduced bugs, the CompCert project has taken a huge leap in producing strengthening guarantees for reliable critical embedded software across platforms. We congratulate Dr Leroy on his significant achievement in winning this Award."

Congratulations to Xavier for this important recognition of his long-term work on CompCert.

I just received this call from Bartek Klin. Since it might be of interest to readers of this blog, I decided to post it. Warsaw is a hotbed for TCS research. Follow the links below for more details.

-----------------

Call for post-doctoral research positions at the Warsaw Center of Mathematics and Computer Science.

Warsaw Center of Mathematics and Computer Science (WCMCS) is a joint project of two scientific units: the Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw (MIMUW), and the Institute of Mathematics of the Polish Academy of Sciences (IMPAN). The Center is built on the long-standing cooperation between the two units, in both teaching and research. The Center was designated as a Leading National Research Center (Krajowy Naukowy Osrodek Wiodacy, KNOW) by the Polish Ministry of Science and Higher Education in July 2012. The award comes with a substantial grant which will provide financing of the Center for the next five years. The grant will be used for enhancing the research potential of both participating institutions; this includes financing post-doctoral positions.

The post-doctoral research positions at the WCMCS are aimed at young researchers who have just received their PhD. Successful candidates will be employed as an adiunkt (assistant professor) at one of the following institutions, as indicated in the candidate’s application:
* the Faculty of Mathematics, Informatics and Mechanics at the University
of Warsaw, http://www.mimuw.edu.pl; or
* the Warsaw branch of the Mathematical Institute of the Polish Academy of
Sciences, http://www.impan.pl

The positions are for 6-12 months, with a possible extension to at most 18 months, altogether. The salary will be 7000 PLN per month, before taxes. In addition, the holder of the position will be eligible for financial support to participate in scientific meetings.

The position comes with a teaching load of up to 60 hours per semester. At least 3/4 of the position’s duration should be between October 1 and June 30.

The applicant should have defended their PhD not earlier than 4 years before the planned beginning of the position. This period can be prolonged by the parental leave.

The candidate applying for a post-doc position at the WCMCS should submit the following documents:
* a cover letter of application addressed to the Board of WCMCS,
indicating the institution (MIMUW or IMPAN) and the period of his/her
employment,
* a CV including a list of publications, and copies of 5 best papers, at
most,
* a document that confirms holding the PhD Degree or information about the
expected date of obtaining such a degree,
* a research plan including a collaboration scheme with researchers from
MIMUW or IMPAN.

All documents should be sent as pdf files to the following e-mail address: wcmcs.postdoc@mimuw.edu.pl In addition, the applicant should ask at most two senior researchers to send their letters of support to the same e-mail address. The deadline for application is December 10, 2012.

A successful candidate can take his or her job immediately after the announcement of the results of the selection and not later than 8 months after that moment. If the candidate has no PhD degree while submitting, before starting the work he or she should present a document that confirms holding the degree.

More information about WCMCS at http://www.wcmcs.edu.pl