Positions open at ETH in concurrency and verification

by






We have positions open at both the PhD and Postdoc levels at the Chair of Software Engineering at ETH Zurich, the Chair of Software Engineering. As noted in an earlier article, I recently received an Advanced Investigator Grant from the European Research Council (5 years, 2.5 million euros) on the theme “Concurrency Made Easy”; see … Read more




Domain Theory: precedents

by






Both Gary Leavens and Jim Horning commented (partly here, partly on Facebook) about my Domain Theory article [1] to mention that Larch had mechanisms for domain modeling and specification reuse. As Horning writes: The Larch Shared Language was really all about creating reusable domain theories, including theorems about the domains.  See, for example [2] and … Read more




Domain Theory: the forgotten step in program verification

by






  Program verification is making considerable progress but is hampered by a lack of abstraction in specifications. A crucial step is, almost always, absent from the process; this omission is the principal obstacle to making verification a standard component of everyday software development. 1. Steps in software verification In the first few minutes of any … Read more




Aliasing and framing: Saint Petersburg seminar next week

by






In  last Thursday’s session of the seminar, Kokichi Futatsugi’s talk took longer than planned (and it would have been a pity to stop him), so I postponed my own talk on Automatic inference of frame conditions through the alias calculus to next week (Thursday local date). As usual it will be broadcast live. Seminar page: here, … Read more




Seminar sessions in Saint Petersburg: CafeOBJ and the frame issue

by






The Saint Petersburg software engineering seminar has two sessions today (29 March 2012, 18 local time, see here for the date and time in your area), broadcast live: By Kokichi Futatsugi from KAIST (Japan): Combining Inference and Search in Verification with CafeOBJ. By me: Automatic inference of frame conditions through the alias calculus. See details … Read more




A carefully designed Result

by






  In the Eiffel user discussion group [1], Ian Joyner recently asked: A lot of people are now using Result as a variable name for the return value in many languages. I believe this first came from Eiffel, but can’t find proof. Or was it adopted from an earlier language? Proof I cannot offer, but … Read more




New LASER proceedings

by






Springer has just published in the tutorial sub-series of Lecture Notes in Computer Science a new proceedings volume for the LASER summer school [1]. The five chapters are notes from the 2008, 2009 and 2010 schools (a previous volume [2] covered earlier schools). The themes range over search-based software engineering (Mark Harman and colleagues), replication … Read more




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.