Software engineering

ERC Advanced Investigator Grant: Concurrency Made Easy

by






We have just been awarded an ERC Advanced Investigator Grant project on concurrent programming (2.5 M EUR). This article is a brief introduction to the project and a first announcement of the positions (postdocs, phds, engineer) for which we will be advertising.




TOOLS 2012, “The Triumph of Objects”, Prague in May: Call for Workshops

by






The TOOLS federated conferences, held in Prague May 28 to June 1, will include five conferences (TOOLS EUROPE, ICMT, Software Composition, Tests And Proofs, Multicore Software Engineering) and a number of workshop. It is still possible to propose workshops; the instructions are given here.







Webinar today: the Varieties of Loop Invariants

by






I did not have time to complete my Monday post this week; it will be for next Monday (title: Never design a language). In the meantime, here is the announcement for today’s Saint Petersburg Software Engineering seminar , which can be followed live at http://sel.ifmo.ru/seminar/live (19:30 Saint Petersburg time, meaning 16:30 Zurich/Paris, 7:30 PDT on … Read more




Webinars Dec. 29: (1) Model-based contracts (2) Assessing agile methods

by






The Saint Petersburg Software Engineering seminar (organized jointly by ITMO and SPbSPU universities) takes place every Thursday, normally 18-21. You can find the program at   http://sel.ifmo.ru/seminar/ . Starting with the Dec. 29 seminar, the talks can now be attended remotely. You can follow them live (i.e. starting at 18:00 SP time, 15:00 Zurich/Paris, 9 … Read more




Guest article: funding great research

by






In a blog article posted in its original version on this blog [1] and in a revised version on the Communications of the ACM blog [2], I emphasized the relevance of incremental research. Recently Mikkel Thorup sent me some interesting comments, which I am publishing here as the first Guest Column of this blog. References … Read more




Ado About The Resource That Was (Not)

by






The resources we have at our disposal on a computing system may be huge, but they are always finite, and our programs’ appetite for resources will eventually exhaust them. At that stage, we have to deal with the SBYBAW rule, which sounds like a tautology but is an encouragement to look for clever algorithms: techniques for freeing resources when no resources remain may not request new resources.