- Haskell - Haskell.org

RV 2014: LAST Call for Papers, Deadline in 1 week
by Runtime Verification 31 Mar '14

31 Mar '14

[Apologizes for duplicates] 14th International Conference on Runtime Verification September 22 - 25, 2014 *Toronto, Canada* http://rv2014.imag.fr/ <http://rv2014.imag.fr/images/CfP.pdf> Scope: Runtime verification is concerned with monitoring and analysis of software and hardware system executions. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they are significantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include: - specification languages - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, containment, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization - monitoring techniques for safety/mission-critical systems - monitoring distributed systems, cloud services, and big data applications - monitoring security and privacy policies Application areas of runtime verification include safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. Technical Research Papers Track: Technical research papers can be submitted in two categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. All accepted technical papers will appear in an LNCS<http://www.springer.com/series/558> volume. Submitted papers must use the LNCS style<http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>. At least one author of each accepted paper must attend RV'14 to present the paper. Papers must be submitted electronically using the EasyChair<https://www.easychair.org/conferences/?conf=rv2014> system. - *Regular papers* (up to 15 pages) should present original unpublished results. Theoretical and experimental papers as well as papers on applications of runtime verification and case studies are all welcome. A non-monetary Best Paper Award will be given. A selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design. - *Short papers* (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (10 minutes) and poster sessions. Program committee Borzoo Bonakdarpour <https://cs.uwaterloo.ca/~bbonakda/> (University of Waterloo, Canada), *co-chair* Scott Smolka <http://www.cs.sunysb.edu/~sas/> (Stony Brook Universtiy, USA), *co-chair* Gul Agha <http://cs.illinois.edu/directory/profile/agha> (University of Illinois at Urbana-Champaign, USA) Thomas Ball <http://research.microsoft.com/en-us/people/tball/> (Microsoft Research, Redmond, USA) Howard Barringer <http://www.manchester.ac.uk/research/howard.barringer> (The University of Manchester, UK) Ezio Bartocci <http://www.eziobartocci.com/> (TU Wien, Austria) David Basin <http://www.inf.ethz.ch/personal/basin/> (ETH Zurich, Switzerland) Saddek Bensalem <http://www-verimag.imag.fr/~bensalem/> (Verimag, France) Ivona Brandic <http://www.infosys.tuwien.ac.at/staff/ivona/> (TU Wien, Austria) Marsha Chechik <http://www.cs.toronto.edu/~chechik/> (University of Toronto, Canada) Michael Clarkson <http://faculty.cs.gwu.edu/~clarkson/> (George Washington University, USA) Laura Dillon <http://www.cse.msu.edu/~ldillon/> (Michigan State University, USA) Shlomi Dolev <http://www.cs.bgu.ac.il/~dolev/> (Ben Gurion University, Israel) Alastair Donaldson <http://www.doc.ic.ac.uk/~afd/> (Imperial College London, UK) Dawson Engler <http://www.stanford.edu/~engler/> (Stanford University, USA) Ylies Falcone <http://www.ylies.fr/> (Université Joseph Fourier, France) Vijay Garg <http://users.ece.utexas.edu/~garg/> (University of Texas at Austin, USA) Steve Goddard <http://cse.unl.edu/~goddard/papers.html> (University of Nebraska-Lincoln, USA) Ganesh Gopalakrishnan <http://www.cs.utah.edu/~ganesh/> (University of Utah, USA) Wolfgang Grieskamp (Google, USA) Radu Grosu <http://www.cs.sunysb.edu/~grosu/> (TU- Wien, Austria) Klaus Havelund <http://www.havelund.com/> (NASA/JPL, USA) Mats Heimdahl <http://www.umsec.umn.edu/about/director> (University of Minnesota, USA) Laurie Hendren <http://www.sable.mcgill.ca/~hendren/> (McGill University, Canada) Gerard Holzmann <http://lars-lab.jpl.nasa.gov/people/gh.html> (NASA/JPL, USA) Daniel Keren <http://www.cs.haifa.ac.il/~dkeren/> (Haifa University, Israel) Sandeep Kulkarni <http://www.cse.msu.edu/~sandeep/>(Michigan State University, USA) Marta Kwiatkowska <http://www.cs.ox.ac.uk/marta.kwiatkowska/> (University of Oxford, UK) Insup Lee <http://www.cis.upenn.edu/~lee/home/home/index.shtml> (University of Pennsylvania, USA) Axel Legay <http://people.irisa.fr/Axel.Legay/> (IRISA/INRIA, France) Martin Leucker <http://www.isp.uni-luebeck.de/leucker/> (University of Lübeck, Germany) Leonardo Mariani<http://www.lta.disco.unimib.it/lta/personalPages/leonardoMariani/leonardoMa…> (University of Milano Bicocca, Italy) Patrick Meredith <http://fsl.cs.illinois.edu/index.php/Patrick_Meredith> (University of Illinois at Urbana-Champaign, USA) David Naumann <http://www.cs.stevens.edu/~naumann/> (Stevens Institute of Technology, USA) Doron Peled <http://u.cs.biu.ac.il/~doronp/> (Bar Ilan University, Israel) Mauro Pezze <http://www.inf.usi.ch/personal-info?id=1187> (University of Lugano, Switzerland) Lee Pike <http://www.cs.indiana.edu/~lepike/> (Galois Inc., USA) Zvonimir Rakamaric <http://www.zvonimir.info/> (University of Utah, USA) Grigore Rosu <http://fsl.cs.illinois.edu/index.php/Grigore_Rosu> (University of Illinois at Urbana-Champaign, USA) Andrey Rybalchenko <http://www7.in.tum.de/~rybal/> (TU-Munich, Germany) Andre Schiper <http://people.epfl.ch/andre.schiper?lang=fr> (EPFL, Switzerland) Oleg Sokolsky <http://www.cis.upenn.edu/~sokolsky/> (University of Pennsylvania, USA) Scott Stoller <http://www.cs.sunysb.edu/~stoller/> (Stony Brook University, USA) Serdar Tasiran <http://home.ku.edu.tr/~stasiran/> (Koc University, Turkey) Michael Whalen <http://www.umsec.umn.edu/directory/Michael-Whalen> (University of Minnesota, USA) Lenore Zuck <http://www.cs.uic.edu/~lenore/> (University of Illinois at Chicago, USA) Tool Demonstrations Track: The aim of the RV 2014 tool demonstration track is to provide an opportunity for researchers and practitioners to show and to discuss the latest advances, experiences and challenges in devising and developing reliable software tools for runtime verification. Tool demonstration papers will be reviewed by the Tools Track Program Committee. All accepted tool demonstration papers will appear in the conference proceedings LNCS volume. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'14 to present the paper. Papers must be submitted electronically using the EasyChair<https://www.easychair.org/conferences/?conf=rv2014> system. Tool papers should meet the following criteria: - A tool paper should present a new tool, a new tool component or novel extensions to existing tools supporting runtime verification. Each submission should be original and not published previously in a tool paper form. - Each submission must not exceed 8 pages in the LNCS/Springer proceeding format, including all text, references and figures. The paper must be written in English and provided in PDF format. - Each submission must be accompanied at the time of the submission by a short screencast (between 5-10 minutes), with voice and overlay text commentary illustrating the demonstration of the tool (a link to it should be provided in the paper). - The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. - Each tool paper must include a script in an appendix (not included in the page count) describing how the demo will be conducted during the conference presentation with screenshots presenting step-by-step the tool's capabilities, highlighting the main characteristics and the usage. Evaluation Each submission will be reviewed by at least four members of the tool demonstration track program committee. The evaluation criteria will include: - the presentation quality - the availability (possibly in a open-source format) of the software. - the relevance for the Runtime Verification audience - the technical soundness of the presented tool - the originality of the underlying ideas Tool Demonstration Committee Ezio Bartocci, (TU-Vienna, Austria), *Chair* Alastair Donaldson (Imperial College London, UK) Dawson Engler (Stanford University, USA) Ylies Falcone (Université Joseph Fourier, France) Klaus Havelund (NASA/JPL, USA) Michael Whalen (University of Minnesota, USA) Important Dates: Both research papers and tool demonstration tracks will follow the following timeline: - *Abstract deadline:* April 8, 2014 - *Full paper deadline:* April 15, 2014 - *Rebuttal phase:* May 18-20, 2014 - *Acceptance notification:* June 10, 2014 - *Camera ready submission:* June 25, 2014 - *Conference dates:* 22-25 September, 2014

1 0

ANN: Haskell bindings for Z3: package z3 0.3.2 released
by Iago Abal 27 Mar '14

27 Mar '14

I am happy to announce a new version of the z3 package http://hackage.haskell.org/package/z3 the (unofficial) Haskell bindings for Microsoft's Z3 theorem prover. We didn't announce this package before, but we believe that now it is stable enough to be useful for a broader audience. These bindings are especially appropriate in the following cases: * If your program runs lot of queries, and probably would benefit from incremental solving. Here the performance benefit w.r.t. translating each query to SMT-LIB and calling an external solver should be significant. * If you need to extract interpretations for arrays and functions. * If you need to access specific Z3 features such as Quantifiers or Solvers. We offer three different interfaces: * Z3.Base: a low-level interface, it just performs marshalling. * Z3.Monad: introduces a class MonadZ3 and a concrete monad Z3 that does some bookkeeping for you. Most people seem to be using this interface. * Z3.Lang: a high-level interface in the form of an embedded language. This interface has been deprecated in the current release, we will continue to develop it, but it will be in separate package. The bindings are still incomplete as there are some API functions that have not been added yet. The infrastructure is there, and adding support for new API functions is (most of the times) straightforward. We appreciate that, if you fork the project and add extra functions, then you send the changes back to us. These bindings still use the old Z3 API of Z3 3.x versions, but there is some support for the new API that some people is using satisfactorily. (Z3 4.0 was released while we were still exploring the design of the library and we preferred not to switch to the new API at that time). Full support for the new API should come in the next release. Iago

1 0

Open PhD position in Formal Methods for Software Product Lines at IT University of Copenhagen
by Iago Abal 26 Mar '14

26 Mar '14

(Apologies for duplicates) The VARIETE project seeks an excellent PhD student to work on analysis methods for code and models found in highly configurable software systems (software product lines). Find more details at: http://variete.wikit.itu.dk/Positions Prospective starting date is in fall 2014. Duration of the scholarship is 3 or 4 years. The position comes with entry level public servant salary (ca. 2200 EUR per month after taxes are deducted), social benefits (like paid vacation time, health care and pension saving scheme) along with a travel budget and all other support funds required for executing the research project. Personal contact via email prior to applying is strongly encouraged. Contact: Associate Professor Andrzej Wąsowski (wasowski(a)itu.dk) Postdoc Aleksandar Dimovski (adim(a)itu.dk) Deadline for application is April 23 at 23:59 CET. Application: https://delta.hr-manager.net/ApplicationInit.aspx?cid=119&ProjectId=168671&… Iago

1 0

AI4FM 2014: Call for Participation
by Iain Whiteside 25 Mar '14

25 Mar '14

------------------------------------------------- AI4FM 2014 - the 5th International Workshop on the use of AI in Formal Methods http://www.ai4fm.org/ai4fm-2014/ Singapore, 13th May, 2014 In association with FM 2014 ------------------------------------------------- --- Call For Participation --- Workshop information --------------- Workshop: May 13th, 2014 Registration: http://www.comp.nus.edu.sg/~pat/FM2014/registration.html Confirmed Speakers --------------- Gerwin Klein, NICTA Rustan Leino, Microsoft Research Chin Wei Ngan, National University of Singapore Dominique Méry, LORIA and Université de Lorraine Andrius Velykis, Newcastle University Ligia Nistor and Jonathan Aldrich, CMU Cliff Jones, Newcastle University Gudmund Grov, Heriot-Watt University About the workshop --------------- This workshop will bring together researchers from formal methods, automated reasoning and AI; it will address the issue of how AI can be used to support the formal software development process, including requirement analysis, modelling and proof. Previous AI4FM workshops have included a mix of industrial and academic participants and we anticipate attracting a similarly diverse audience. Rigorous software development using formal methods allows the construction of an accurate characterisation of a problem domain that is firmly based on mathematics; by applying standard mathematical analyses, these methods can be used to prove that systems satisfy formal specifications. Research has shown that with tools backed by mature theory, formal methods are becoming cost effective and their use is easier to justify, not as an academic exercise, legal requirement or niche markets -- but as part of a business case. However, while industrial use of formal methods is increasing, in order to make it more mainstream, the cost of applying formal methods, in terms of mathematical skill level and development time, must still be reduced. A desirable outcome of the workshop is to identify key areas where AI can help with such issues as well as discussions about how it can be utilised. Organisers --------------- * Leo Freitas (Newcastle University, UK) * Gudmund Grov (Heriot-Watt University, UK) * Iain Whiteside (Newcastle University, UK) Contact Details ---------------- If you have any queries, please email the organisers at the following email address: ai4fm2014(a)ai4fm.org<mailto:ai4fm2014@ai4fm.org>

1 0

2nd Call For Papers: Erlang Workshop 2014
by Laura M. Castro 25 Mar '14

25 Mar '14

Hello all, Please find below the second Call for Papers for the Thirteenth ACM SIGPLAN Erlang Workshop. Apologies for any duplicates you may receive. CALL FOR PAPERS =============== Thirteenth ACM SIGPLAN Erlang Workshop ----------------------------------------------------------- Göteborg, Sweden, September 5, 2014 Satellite event of the 19th ACM SIGPLAN International Conference on Functional Programming (ICFP 2014) September 1-3, 2014 http://www.erlang.org/workshop/2014 Erlang is a concurrent, distributed functional programming language aimed at systems with requirements of massive concurrency, soft real time response, fault tolerance, and high availability. It has been available as open source for 15 years, creating a community that actively contributes to its already existing rich set of libraries and applications. Originally created for telecom applications, its usage has spread to other domains including e-commerce, banking, databases, and computer telephony and messaging. Erlang programs are today among the largest applications written in any functional programming language. These applications offer new opportunities to evaluate functional programming and functional programming methods on a very large scale and suggest new problems for the research community to solve. This workshop will bring together the open source, academic, and industrial programming communities of Erlang. It will enable participants to familiarize themselves with recent developments on new techniques and tools tailored to Erlang, novel applications, draw lessons from users' experiences and identify research problems and common areas relevant to the practice of Erlang and functional programming. We invite three types of submissions. 1. Technical papers describing language extensions, critical discussions of the status quo, formal semantics of language constructs, program analysis and transformation, virtual machine extensions and compilation techniques, implementations and interfaces of Erlang in/with other languages, and new tools (profilers, tracers, debuggers, testing frameworks, etc.). The maximum length for technical papers is restricted to 12 pages. 2. Practice and application papers describing uses of Erlang in the "real-world", Erlang libraries for specific tasks, experiences from using Erlang in specific application domains, reusable programming idioms and elegant new ways of using Erlang to approach or solve a particular problem. The maximum length for the practice and application papers is restricted to 12 pages. Note that this is a maximum length; we welcome shorter papers also, and the program committee will evaluate all papers on an equal basis independent of their lengths. 3. Poster presentations describing topics related to the workshop goals. Each includes a maximum of 2 pages of the abstract and summary. Presentations in this category will be given an hour of shared simultaneous demonstration time. Workshop Co-Chairs ------------------ Laura M. Castro, University of A Coruña, Spain Hans Svensson, QuviQ AB, Sweden Program Committee ----------------------------- (Note: the Workshop Co-Chairs are also committee members) Jesper L. Andersen, Erlang Solutions Ltd., UK Richard Carlsson, Klarna AB, Sweden Lars-Åke Fredlund, Universidad Politécnica de Madrid, Spain Fréd Hébert, Heroku, USA Kostis Sagonas, Uppsala University, Sweden & NTUA, Greece Simon Thompson, University of Kent, UK Steve Vinoski, Basho Technologies, USA Philip Wadler, University of Edinburgh, UK Important Dates ----------------------- Submissions due: Sunday, 11 May, 2014 Author notification: Friday, 6 June, 2014 Final copy due: Sunday, 22 June, 2014 Workshop date: September 5, 2014 Instructions to authors -------------------------------- Papers must be submitted online via EasyChair (via the "Erlang2014" event). The submission page is https://www.easychair.org/conferences/?conf=erlang2014 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Each submission must adhere to SIGPLAN's republication policy. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. Paper submissions will be considered for poster submission in the case they are not accepted as full papers. Venue & Registration Details ------------------------------------------ For registration, please see the ICFP 2014 web site at: http://icfpconference.org/icfp2014/ Related Links -------------------- ICFP 2014 web site: http://www.icfpconference.org/icfp2014/ Past ACM SIGPLAN Erlang workshops: http://www.erlang.org/workshop/ Open Source Erlang: http://www.erlang.org/ EasyChair submission site: https://www.easychair.org/conferences/?conf=erlang2014 Author Information for SIGPLAN Conferences: http://www.sigplan.org/authorInformation.htm Atendee Information for SIGPLAN Events: http://www.sigplan.org/Resources/Policies/Anti-harassment -- Laura M. Castro Department of Computer Science Universidade da Coruña (Spain) http://www.madsgroup.org/staff/laura

1 0

HaL-9 - Call for Contributions
by Henning Thielemann 24 Mar '14

24 Mar '14

HaL ist ein lokaler Haskell-Workshop mit überregionaler Bedeutung, der nun bereits das 9. Mal stattfindet. Dieses Jahr laden wir für den 20. Juni ins Institut für Informatik an der Martin-Luther-Universität Halle-Wittenberg ein. Wir suchen Beiträge zu Haskell im Besonderen und der funktionalen Programmierung im Allgemeinen, aber auch Anknüpfungen an andere Programmierparadigmen. Dabei interessieren wir uns unter anderem für die Themenbereiche * Neues von Sprache, Bibliotheken, Werkzeugen, * Anwendungen von Kunst bis Industrie, * Lehre und Forschung an Schulen und Hochschulen. Die Beiträge können präsentiert werden als * Tutorium (etwa 90 min) * Vortrag (etwa 30 min) * Demonstration, künstlerische Aufführung Die Veranstaltungssprache ist Deutsch, nach Absprache auch Englisch. Presentations will be given in German but we can switch to English if requested. Bitte reichen Sie Kurzfassungen der Beiträge ein (max. 3 Seiten), die dem Programmkomitee eine Einschätzung ermöglichen, sowie eine knappe Zusammenfassung von etwa 100 Wörtern. Teilnehmer des Workshops sind Interessenten (keine Erfahrung mit Haskell oder funktionaler Programmierung), Anfänger (wenig Erfahrung) und Experten. Wir bitten die Vortragenden, die Zielgruppe des Beitrags anzugeben und die nötigen Vorkenntnisse zu beschreiben. Bei Tutorien sollen Teilnehmer auf eigenen Rechnern arbeiten. Bitte beschreiben Sie dazu die vorher zu installierende Software. Senden Sie die Beitragsvorschläge als PDF-Dokument bis zum 27. April 2014 an hal-committee(a)iba-cg.de Wir werden Ihnen bis zum 9. Mai mitteilen, ob wir Ihren Beitrag in das Programm aufnehmen. Für das Organisationsteam Henning Thielemann

1 0

[JOB] Summer internships at Jane Street
by Yaron Minsky 24 Mar '14

24 Mar '14

Jane Street is looking to hire functional programmers for our offices in New York, London and Hong Kong. Right now we're especially looking for interns for this upcoming summer. Interning at Jane Street is a challenging and varied experience. Here are some of the projects our interns have completed. - Developing an FRP-style toolkit for building sophisticated text-mode UIs - Rewriting and generalizing our RPC messaging library using session types - Prototyping optimizations to the OCaml compiler - Working on the internals of Async, our monadic concurrency library Many of our intern projects make their way out as open-source projects. Interns also learn about Jane Street's trading business through lectures and more interactive training sessions. Plus, there are a lot of fun social activities throughtout the summer. If you're interested in an internship, or know someone who might be, applications can be submitted here. http://janestreet.com/apply And as usual, we're also hiring developers for fulltime positions in NYC, Hong Kong and London as well! Cheers, y

1 1

RV 2014: Call for Papers, Deadline in 2 weeks
by Runtime Verification 23 Mar '14

23 Mar '14

[Apologizes for duplicates] 14th International Conference on Runtime Verification September 22 - 25, 2014 *Toronto, Canada* http://rv2014.imag.fr/ <http://rv2014.imag.fr/images/CfP.pdf> Scope: Runtime verification is concerned with monitoring and analysis of software and hardware system executions. Runtime verification techniques are crucial for system correctness, reliability, and robustness; they are significantly more powerful and versatile than conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include: - specification languages - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, containment, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization - monitoring techniques for safety/mission-critical systems - monitoring distributed systems, cloud services, and big data applications - monitoring security and privacy policies Application areas of runtime verification include safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. Technical Research Papers Track: Technical research papers can be submitted in two categories: regular and short papers. Papers in both categories will be reviewed by the conference Program Committee. All accepted technical papers will appear in an LNCS<http://www.springer.com/series/558> volume. Submitted papers must use the LNCS style<http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0>. At least one author of each accepted paper must attend RV'14 to present the paper. Papers must be submitted electronically using theEasyChair<https://www.easychair.org/conferences/?conf=rv2014> system. - *Regular papers* (up to 15 pages) should present original unpublished results. Theoretical and experimental papers as well as papers on applications of runtime verification and case studies are all welcome. A non-monetary Best Paper Award will be given. A selection of accepted regular papers will be invited to appear in a special issue of the Springer Journal on Formal Methods in System Design. - *Short papers* (up to 5 pages) may present novel but not necessarily thoroughly worked out ideas, for example emerging runtime verification techniques and applications, or techniques and applications that establish relationships between runtime verification and other domains. Accepted short papers will be presented in special short talk (10 minutes) and poster sessions. Program committee Borzoo Bonakdarpour <https://cs.uwaterloo.ca/~bbonakda/> (University of Waterloo, Canada), *co-chair* Scott Smolka <http://www.cs.sunysb.edu/~sas/> (Stony Brook Universtiy, USA), *co-chair* Gul Agha <http://cs.illinois.edu/directory/profile/agha> (University of Illinois at Urbana-Champaign, USA) Thomas Ball <http://research.microsoft.com/en-us/people/tball/> (Microsoft Research, Redmond, USA) Howard Barringer <http://www.manchester.ac.uk/research/howard.barringer> (The University of Manchester, UK) Ezio Bartocci <http://www.eziobartocci.com/> (TU Wien, Austria) David Basin <http://www.inf.ethz.ch/personal/basin/> (ETH Zurich, Switzerland) Saddek Bensalem <http://www-verimag.imag.fr/~bensalem/> (Verimag, France) Eric Bodden <http://www.bodden.de/> (TU - Darmstadt, Germany) Ivona Brandic <http://www.infosys.tuwien.ac.at/staff/ivona/> (TU Wien, Austria) Marsha Chechik <http://www.cs.toronto.edu/~chechik/> (University of Toronto, Canada) Michael Clarkson <http://faculty.cs.gwu.edu/~clarkson/> (George Washington University, USA) Laura Dillon <http://www.cse.msu.edu/~ldillon/> (Michigan State University, USA) Shlomi Dolev <http://www.cs.bgu.ac.il/~dolev/> (Ben Gurion University, Israel) Alastair Donaldson <http://www.doc.ic.ac.uk/~afd/> (Imperial College London, UK) Dawson Engler <http://www.stanford.edu/~engler/> (Stanford University, USA) Ylies Falcone <http://www.ylies.fr/> (Université Joseph Fourier, France) Vijay Garg <http://users.ece.utexas.edu/~garg/> (University of Texas at Austin, USA) Steve Goddard <http://cse.unl.edu/~goddard/papers.html> (University of Nebraska-Lincoln, USA) Ganesh Gopalakrishnan <http://www.cs.utah.edu/~ganesh/> (University of Utah, USA) Wolfgang Grieskamp (Google, USA) Radu Grosu <http://www.cs.sunysb.edu/~grosu/> (TU- Wien, Austria) Klaus Havelund <http://www.havelund.com/> (NASA/JPL, USA) Mats Heimdahl <http://www.umsec.umn.edu/about/director> (University of Minnesota, USA) Laurie Hendren <http://www.sable.mcgill.ca/~hendren/> (McGill University, Canada) Gerard Holzmann <http://lars-lab.jpl.nasa.gov/people/gh.html> (NASA/JPL, USA) Daniel Keren <http://www.cs.haifa.ac.il/~dkeren/> (Haifa University, Israel) Sandeep Kulkarni <http://www.cse.msu.edu/~sandeep/>(Michigan State University, USA) Marta Kwiatkowska <http://www.cs.ox.ac.uk/marta.kwiatkowska/> (University of Oxford, UK) Insup Lee <http://www.cis.upenn.edu/~lee/home/home/index.shtml> (University of Pennsylvania, USA) Axel Legay <http://people.irisa.fr/Axel.Legay/> (IRISA/INRIA, France) Martin Leucker <http://www.isp.uni-luebeck.de/leucker/> (University of Lübeck, Germany) Leonardo Mariani<http://www.lta.disco.unimib.it/lta/personalPages/leonardoMariani/leonardoMa…> (University of Milano Bicocca, Italy) Patrick Meredith <http://fsl.cs.illinois.edu/index.php/Patrick_Meredith> (University of Illinois at Urbana-Champaign, USA) David Naumann <http://www.cs.stevens.edu/~naumann/> (Stevens Institute of Technology, USA) Doron Peled <http://u.cs.biu.ac.il/~doronp/> (Bar Ilan University, Israel) Mauro Pezze <http://www.inf.usi.ch/personal-info?id=1187> (University of Lugano, Switzerland) Lee Pike <http://www.cs.indiana.edu/~lepike/> (Galois Inc., USA) Zvonimir Rakamaric <http://www.zvonimir.info/> (University of Utah, USA) Grigore Rosu <http://fsl.cs.illinois.edu/index.php/Grigore_Rosu> (University of Illinois at Urbana-Champaign, USA) Andrey Rybalchenko <http://www7.in.tum.de/~rybal/> (TU-Munich, Germany) Andre Schiper <http://people.epfl.ch/andre.schiper?lang=fr> (EPFL, Switzerland) Oleg Sokolsky <http://www.cis.upenn.edu/~sokolsky/> (University of Pennsylvania, USA) Scott Stoller <http://www.cs.sunysb.edu/~stoller/> (Stony Brook University, USA) Serdar Tasiran <http://home.ku.edu.tr/~stasiran/> (Koc University, Turkey) Michael Whalen <http://www.umsec.umn.edu/directory/Michael-Whalen> (University of Minnesota, USA) Lenore Zuck <http://www.cs.uic.edu/~lenore/> (University of Illinois at Chicago, USA) Tool Demonstrations Track: The aim of the RV 2014 tool demonstration track is to provide an opportunity for researchers and practitioners to show and to discuss the latest advances, experiences and challenges in devising and developing reliable software tools for runtime verification. Tool demonstration papers will be reviewed by the Tools Track Program Committee. All accepted tool demonstration papers will appear in the conference proceedings LNCS volume. Submitted papers must use the LNCS style. At least one author of each accepted paper must attend RV'14 to present the paper. Papers must be submitted electronically using the EasyChair<https://www.easychair.org/conferences/?conf=rv2014> system. Tool papers should meet the following criteria: - A tool paper should present a new tool, a new tool component or novel extensions to existing tools supporting runtime verification. Each submission should be original and not published previously in a tool paper form. - Each submission must not exceed 8 pages in the LNCS/Springer proceeding format, including all text, references and figures. The paper must be written in English and provided in PDF format. - Each submission must be accompanied at the time of the submission by a short screencast (between 5-10 minutes), with voice and overlay text commentary illustrating the demonstration of the tool (a link to it should be provided in the paper). - The paper must include information on tool availability, maturity, selected experimental results and it should provide a link to a website containing the theoretical background and user guide. Furthermore, we strongly encourage authors to make their tools and benchmarks available with their submission. - Each tool paper must include a script in an appendix (not included in the page count) describing how the demo will be conducted during the conference presentation with screenshots presenting step-by-step the tool's capabilities, highlighting the main characteristics and the usage. Evaluation Each submission will be reviewed by at least four members of the tool demonstration track program committee. The evaluation criteria will include: - the presentation quality - the availability (possibly in a open-source format) of the software. - the relevance for the Runtime Verification audience - the technical soundness of the presented tool - the originality of the underlying ideas Tool Demonstration Committee Ezio Bartocci, (TU-Vienna, Austria), *Chair* Eric Bodden (TU - Darmstadt, Germany) Alastair Donaldson (Imperial College London, UK) Dawson Engler (Stanford University, USA) Ylies Falcone (Université Joseph Fourier, France) Klaus Havelund (NASA/JPL, USA) Michael Whalen (University of Minnesota, USA) Important Dates: Both research papers and tool demonstration tracks will follow the following timeline: - *Abstract deadline:* April 8, 2014 - *Full paper deadline:* April 15, 2014 - *Rebuttal phase:* May 18-20, 2014 - *Acceptance notification:* June 10, 2014 - *Camera ready submission:* June 25, 2014 - *Conference dates:* 22-25 September, 2014

1 0

ANNOUNCE: wxHaskell 0.90.1.0
by Henk-Jan van Tuyl 21 Mar '14

21 Mar '14

L.S., I am happy to announce a new version of wxHaskell. This version binds to wxWidgets 2.9 [0]. What is it? ----------- wxHaskell is a portable and native GUI library for Haskell. The goal of the project is to provide an industrial strength GUI library for Haskell, but without the burden of developing (and maintaining) one ourselves. wxHaskell is therefore built on top of wxWidgets – a comprehensive C++ library that is portable across all major GUI platforms; including GTK, Windows, X11, and MacOS X. Furthermore, it is a mature library (in development since 1992) that supports a wide range of widgets with the native look-and-feel. What's new? ----------- - Added functionality: wxGrid: cell spans, cell renderers (numeric, auto string wrapping), wxScrolledWindow, wxSplitterWindow - Reanimated wxToggleButton, added wxBitmapToggleButton - Solved problem with spaces in pathnames (installation procedure, Windows) - Increased max version of dependencies - The external preprocessor (CPP) is now used - The presence of the wx-config executable is checked at installation time - The bitness of the wxWidgets dynamic libraries is compared to the bitness of the wxHaskell libraries to generate, at installation time; a warning is given when the bitness is incompatible - Documentation improvements - Bugs fixed Links ----- See the homepage of wxHaskell for more information: https://www.haskell.org/haskellwiki/WxHaskell The packages are: - wxc https://hackage.haskell.org/package/wxc - wxdirect https://hackage.haskell.org/package/wxdirect - wxcore https://hackage.haskell.org/package/wxcore - wx https://hackage.haskell.org/package/wx Regards, Henk-Jan van Tuyl [0] https://www.wxwidgets.org/ -- Folding@home What if you could share your unused computer power to help find a cure? In just 5 minutes you can join the world's biggest networked computer and get us closer sooner. Watch the video. http://folding.stanford.edu/ http://Van.Tuyl.eu/ http://members.chello.nl/hjgtuyl/tourdemonad.html Haskell programming --

1 0

Last call for Google Summer of Code 2014 applications
by Shachaf Ben-Kiki 21 Mar '14

21 Mar '14

Haskell.org is participating in Google Summer of Code again this year, and the student application deadline is nigh. Edward Kmett and I are the administrators this year. The deadline is 2014-03-21 at 19:00 UTC (noon PDT), or roughly 11 hours from now, so make sure to get your applications in before then. For a full timeline see <http://www.google-melange.com/gsoc/events/google/gsoc2014>. If you have any questions, feel free to ask on IRC (#haskell-gsoc on Freenode), or to contact me or Edward directly! Shachaf

1 0