The workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (time, space) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. The following list of topics is non-exhaustive:
Up to now a few similar events have taken place. In 2006, 2008 application-oriented resource analysis workshops ( EmBounded Open Workshop in Budapest, 2006, and Resource Analysis Workshop in Hertfordshir, 2008) were held as affiliated events of International Symposium on the Implementation and Application of Functional Languages (IFL) . Participated: University of St. Andrew (UK), Heriot-Watt University of Edinburgh (UK), Ludwig-Maximilians University of Munich (Germany), University Complutense of Madrid (Spain), Politechnical University of Madrid (Spain). Another large group of research schools is presented in series of workshops on Implicit Computational Complexity, see, for instance, WICC'08 in Paris . The series gather researchers working in theoretical foundations of resource analysis, mainly from in France (Universities of Paris Diderot and Paris Nord, LORIA Nancy), Italy (Universities of Bologna and Turin), Norway, Germany and Portugal. FOPARA aims to bringing these various directions in resource analysis together and possibly to extend the community by other groups.
Submission is closed <! a href="http://www.easychair.org/conferences/?conf=fopara09" !>
The program committee will select 10-15 papers that are to be published first in the preliminary workshop proceedings by the 3d of November. After the workshop we will publish revised versions of the papers in the FOPARA volume of Lecture Notes in Computer Science. The agreement with the LNCS board is achieved.
The talk: The Reachability-Bound Problem
The "reachability-bound problem" is the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in terms of the inputs to that procedure. This has applications in bounding resources consumed by a program such as time, memory, network-traffic, power, as well as estimating quantitative properties (as opposed to boolean properties) of data in programs, such as amount of information leakage or uncertainty propagation.
Our approach to solving the reachability-bound problem brings together two very different techniques for reasoning about loops in an effective manner. One of these techniques is an abstract-interpretation based iterative technique for computing precise disjunctive invariants (to summarize nested loops). The other technique is a non-iterative proof-rules based technique (for loop bound computation) that takes over the role of doing inductive reasoning, while deriving its power from use of SMT solvers to reason about abstract loop-free fragments.
We have implemented our solution to the reachability-bound problem in a tool called SPEED, which computes symbolic computational complexity bounds for procedures in .Net code-bases.
The workshop will take place at the Technical University of Eindhoven ("Auditorium"). Our room in the Auditorium is CZ13a.
It is located on the second ring of class rooms upstairs. You will find this information in your delegate pack.
Beamer and screen as well as a blackboard are available. However, you can only use one at the time in this room as you are projecting with the blackboard down. At the room there will a sign saying FOPARA. There will be FMweek directives all over the place outside the Auditorium. Coffee and tea breaks will be served downstairs in the main hall, rather close to the workshop room. Lunch will be served at that same spot nearby. <! The address of the venue is: > <! The full map of the campus can be found> <! a href="http://www.ru.nl/contents/pages/124/ruwegw.siteeng03-05.pdf" here /a> <! and the close-up of the conference center
Registered participants (by 19/10)
You can choose a hotel during on-line registration.
<! b The weather in NL: do not enter the Netherlands without a (big) umbrella and/or a good raincoat. If you want to take a risk and leave your hotel/venue without an umbrella or a rain coat, please first consult a href="http://www.buienradar.nl" the "rainradar" /a !>
Train schedules can be checked at:
Important notes on railway tickets: ticket machines in the Netherlands do not accept Master Card or Visa cards, nor do they accept bank notes. You can use coins, international Maestro cards, or dutch Chip-Knip cards. You can also buy the ticket at the ticket office at the train station at the airport. Since recently getting on a train in the Netherlands without a valid ticket will always cost you extra 30 Euro of penalty.Bus tickets. You can ride on a bus with a nation wide blue Strippenkaart, which can be bought at a train station, for example, at the book/newspaper store, like "Bruna". You can also buy the ticket from the driver.