June 2012 - Haskell - Haskell.org

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

Haskell Weekly News: Issue 233
by Daniel Santa Cruz 27 Jun '12

27 Jun '12

Welcome to issue 233 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 17 to 23, 2012. Quotes of the Week * ciaranm: if it's ugly, it's imperative. if it's incomprehensible, it's functional. * xplat: when life gives you lemons, make lemonads Top Reddit Stories * What are everyone's favorite "aha" moments in learning Haskell? Domain: self.haskell, Score: 93, Comments: 156 On Reddit: [1] http://goo.gl/8YSyY Original: [2] http://goo.gl/8YSyY * Unit testing isn't enough. You need static typing too. Domain: evanfarrer.blogspot.ca, Score: 82, Comments: 22 On Reddit: [3] http://goo.gl/b73gf Original: [4] http://goo.gl/JF4ND * Snap Framework 0.9 Released Domain: snapframework.com, Score: 60, Comments: 7 On Reddit: [5] http://goo.gl/7fP9D Original: [6] http://goo.gl/7SoU6 * Haskell’s record system is a cruel joke Domain: labs.scrive.com, Score: 52, Comments: 100 On Reddit: [7] http://goo.gl/XKIch Original: [8] http://goo.gl/wOvyc * Polymorphic Update with van Laarhoven Lenses Domain: r6.ca, Score: 51, Comments: 9 On Reddit: [9] http://goo.gl/qvpPg Original: [10] http://goo.gl/34TbY * Building a blog with Snap and Heist Domain: bonus500.github.com, Score: 45, Comments: 30 On Reddit: [11] http://goo.gl/UDHCs Original: [12] http://goo.gl/eo9a3 * Totality vs. Turing completeness (McBride)[PDF, 35 slides, ±] Domain: personal.cis.strath.ac.uk, Score: 42, Comments: 22 On Reddit: [13] http://goo.gl/qua0n Original: [14] http://goo.gl/8auaP * GHC's imprecise (non-deterministic) "error" Domain: stackoverflow.com, Score: 41, Comments: On Reddit: [15] http://goo.gl/6WQWx Original: [16] http://goo.gl/MOCeT * Hackage comments — a simple user script Domain: chrisdone.com, Score: 39, Comments: 17 On Reddit: [17] http://goo.gl/t9oBH Original: [18] http://goo.gl/CmXuB * A Notation for Comonads (Orchard, Mycroft) [pdf] Domain: cl.cam.ac.uk, Score: 38, Comments: 48 On Reddit: [19] http://goo.gl/S4lz9 Original: [20] http://goo.gl/uw8ZY * Taming list syntax in Haskell Domain: labs.scrive.com, Score: 36, Comments: 29 On Reddit: [21] http://goo.gl/YLTZL Original: [22] http://goo.gl/UJpcB * Shell scripting with type-safety using Haskell « Linux-Magazin Online Domain: linux-magazin.de, Score: 36, Comments: 32 On Reddit: [23] http://goo.gl/yEMQ0 Original: [24] http://goo.gl/U3zO5 * Roy, A Statically Typed, Functional Language for Javascript. The Functional Web [PDF] Domain: brianmckenna.org, Score: 32, Comments: 9 On Reddit: [25] http://goo.gl/SBhec Original: [26] http://goo.gl/v0iH2 * [ANN] GenCheck - a generalized property-based testing framework Domain: permalink.gmane.org, Score: 30, Comments: On Reddit: [27] http://goo.gl/GCUGJ Original: [28] http://goo.gl/c2Y0s Top StackOverflow Questions * How do exceptions in Haskell work? votes: 53, answers: 1 Read on SO: [29] http://goo.gl/MOCeT * Has anyone ever compiled a list of the imports needed to avoid the “not polymorphic enough” definitions in Haskell's standard libraries? votes: 19, answers: 1 Read on SO: [30] http://goo.gl/kyXde * Why does adding a polymorphic type signature degrade performance? votes: 13, answers: 2 Read on SO: [31] http://goo.gl/Lf18k * To write or not to write `module Main where` in Haskell votes: 10, answers: 1 Read on SO: [32] http://goo.gl/IDSOx * Why aren't FingerTrees used enough to have a stable implementation? votes: 10, answers: 3 Read on SO: [33] http://goo.gl/wzw4e * What is the difference between PArray and [::] in Data Parallel Haskell? votes: 9, answers: 0 Read on SO: [34] http://goo.gl/FpUJX * Why discarded values are () instead of ⊥ in Haskell? votes: 8, answers: 5 Read on SO: [35] http://goo.gl/jIK26 * Is it possible to embed Haskell in a C library opaquely? votes: 8, answers: 1 Read on SO: [36] http://goo.gl/3H5tu * NoMonomorphismRestriction helps preserve sharing? votes: 8, answers: 2 Read on SO: [37] http://goo.gl/FDdeA * Why doesn't Haskell/GHC support record name overloading votes: 7, answers: 2 Read on SO: [38] http://goo.gl/NsHKM Until next time, Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/vi425/what_are_everyones_favorite_… 2. http://www.reddit.com/r/haskell/comments/vi425/what_are_everyones_favorite_… 3. http://evanfarrer.blogspot.ca/2012/06/unit-testing-isnt-enough-you-need.html 4. http://www.reddit.com/r/haskell/comments/vbwrv/unit_testing_isnt_enough_you… 5. http://snapframework.com/blog/2012/06/17/snap-0.9-released 6. http://www.reddit.com/r/haskell/comments/v779m/snap_framework_09_released/ 7. http://labs.scrive.com/2012/06/haskell-lacks-a-serious-record-system/ 8. http://www.reddit.com/r/haskell/comments/vdg55/haskells_record_system_is_a_… 9. http://r6.ca/blog/20120623T104901Z.html 10. http://www.reddit.com/r/haskell/comments/vhbf4/polymorphic_update_with_van_… 11. http://bonus500.github.com/sc2blog/ 12. http://www.reddit.com/r/haskell/comments/vg3q2/building_a_blog_with_snap_an… 13. https://personal.cis.strath.ac.uk/conor.mcbride/pub/Totality.pdf 14. http://www.reddit.com/r/haskell/comments/vazfp/totality_vs_turing_completen… 15. http://stackoverflow.com/questions/11070690/how-do-exceptions-in-haskell-wo… 16. http://www.reddit.com/r/haskell/comments/v6sec/ghcs_imprecise_nondeterminis… 17. http://chrisdone.com/hackage-comments/ 18. http://www.reddit.com/r/haskell/comments/v8gvc/hackage_comments_a_simple_us… 19. http://www.cl.cam.ac.uk/~dao29/drafts/codo-notation-orchard12.pdf 20. http://www.reddit.com/r/haskell/comments/v6ik6/a_notation_for_comonads_orch… 21. http://labs.scrive.com/2012/06/taming-list-syntax-in-haskell/ 22. http://www.reddit.com/r/haskell/comments/v9ilw/taming_list_syntax_in_haskel… 23. http://www.linux-magazin.de/Online-Artikel/Shell-scripting-with-type-safety… 24. http://www.reddit.com/r/haskell/comments/vdrt0/shell_scripting_with_typesaf… 25. http://brianmckenna.org/files/IC-Roy.pdf 26. http://www.reddit.com/r/haskell/comments/vhkgf/roy_a_statically_typed_funct… 27. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19371 28. http://www.reddit.com/r/haskell/comments/va5ao/ann_gencheck_a_generalized_p… 29. http://stackoverflow.com/questions/11070690/how-do-exceptions-in-haskell-wo… 30. http://stackoverflow.com/questions/11076062/has-anyone-ever-compiled-a-list… 31. http://stackoverflow.com/questions/11145503/why-does-adding-a-polymorphic-t… 32. http://stackoverflow.com/questions/11112371/to-write-or-not-to-write-module… 33. http://stackoverflow.com/questions/11151732/why-arent-fingertrees-used-enou… 34. http://stackoverflow.com/questions/11103707/what-is-the-difference-between-… 35. http://stackoverflow.com/questions/11076938/why-discarded-values-are-instea… 36. http://stackoverflow.com/questions/11137443/is-it-possible-to-embed-haskell… 37. http://stackoverflow.com/questions/11145904/nomonomorphismrestriction-helps… 38. http://stackoverflow.com/questions/11100322/why-doesnt-haskell-ghc-support-…

1 0

Final Call for Papers: IEEE Software Engineering Workshop (SEW-35), Heraclion, Crete, 12-13 October 2012
by Huibiao Zhu 27 Jun '12

27 Jun '12

[Note: Submission Deadline is 1 July 2012] IEEE Software Engineering Workshop (SEW-35) 12-13 October 2012 Heraclion, Crete, Greece http://www.seworkshop.org Co-located with 5th International Symposium on Leveraging Applications of Formal Methods (ISoLA 2012) http://www.cs.uni-potsdam.de/isola/isola2012/ Sponsored by IEEE Computer Society, Technical Council on Software Engineering (pending). Background The 35th IEEE Software Engineering Workshop, the longest continually running Software Engineering event in the world, will be held in Heraclion, Crete, collocated with ISoLA 2012. Scope The workshop aims to bring together all those with an interest in software engineering. Traditionally, the conference attracts industrial and government practitioners and academics pursuing the advancement of software engineering principles and techniques. The workshop provides a forum for reporting on past experiences, for describing new and emerging results and techniques, and for exchanging ideas on best practice and future directions. Topics of interest include, but are not limited to: * Metrics and experience reports * Software quality assurance * Formal methods and formal approaches to software development * Software engineering processes and process improvement * CMM and CMMI * Requirements engineering * Software architectures * Real-time Software Engineering * Software maintenance, reuse, and legacy systems * Agent-based software systems * Self-managing systems Submissions Long papers (maximum 10 pages in IEEE format) and short industrial/governmental experience reports (maximum 5 pages in IEEE format) are sought for inclusion in the conference program and publication in the postproceedings, which will be published by IEEE CS Press (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html for paper formatting instructions). All submissions will be reviewed for originality, relevance, and technical detail. At least one author per paper will be required to register and present at the workshop. Papers not presented will not be included in the proceedings. All submissions must be made in electronic format (.doc, .pdf, or .ps formats only), via the conference electronic submission site at: http://www.easychair.org/conferences/?conf=sew35 Publication All accepted papers will be published in the conference post proceedings, to be published by IEEE CS Press. Some authors will also be invited to submit a revised version of their paper for inclusion in Innovations in Systems and Software Engineering: A NASA Journal (Springer). Important Dates 1 July 2012 Long and short papers due 17 August 2012 Notification to authors 12-13 October 2012 SEW in Crete 12 December 2012 Final papers due for post-proceedings Enquiries Any program inquiries should be directed by email to the Programme Co-chairs: Jonathan Bowen, London South Bank University/Museophile Limited, UK jonathan.bowen(a)lsbu.ac.uk Huibiao Zhu, East China Normal University, Shanghai, China hbzhu(a)sei.ecnu.edu.cn Any general inquiries should be directed by email to the Workshop Chair: Mike Hinchey, Lero, University of Limerick, Republic of Ireland mike.hinchey(a)lero.ie For faster responses, please include "SEW" in the subject line.

1 0

ICFP Student Research Competition
by Wouter Swierstra 25 Jun '12

25 Jun '12

===================================================================== Student Research Competition Associated with the The 17th ACM SIGPLAN International Conference on Functional Programming (ICFP 2012) and affiliated events http://www.icfpconference.org/icfp2012/src.html Copenhagen, Denmark, Sep 9-15, 2012 ===================================================================== This year ICFP will host a Student Research Competition where undergraduate and postgraduate students can present posters. The SRC at the ICFP 2012 consists of three rounds: - Extended abstract round: All students are encouraged to submit an extended abstract outlining their research (800 words). - Poster session at ICFP 2012: Based on the abstracts, a panel of judges will select the most promising entrants to participate in the poster session which will take place at ICFP. Students who make it to this round will be supported to attend the conference, to a maximum of $500 for travel and housing. If your total costs are higher than these $500 your conference fee may be waived too. In the poster session, students will have the opportunity to present their work to the judges, who will select three finalists in each category* (graduate/undergraduate) to advance to the next round. - ICFP presentation: The next round consists of an oral presentation at the ICFP to compete for the final awards in each category. ** Prizes ** Both the top three graduate and the top three undergraduate contestants will receive prizes of $500, $300, and $200, respectively. All six winners will receive award medals and a two-year complimentary ACM student membership, including a subscription to ACM’s Digital Library. The names of the winners will be posted on the SRC web site. The winners in each category will be invited to participate in the ACM SRC Grand Finals, an on-line round of competitions among the winners of other conference-hosted SRCs. Grand Finalists and their advisors will be invited to the Annual ACM Awards Banquet for an all-expenses-paid trip, where they will be recognized for their accomplishments along with other prestigious ACM award winners, including the winner of the Turing Award (also known as the Nobel Prize of Computing). The top three graduate Grand Finalists will receive an additional $500, $300, and $200. Likewise, the top three undergraduate Grand Finalists will receive an additional $500, $300, and $200. All six Grand Finalists will receive Grand Finalist certificates. ** Eligibility ** The SRC is open to both undergraduate and graduate students. Upon submission, entrants must be enrolled as a student at their university. The abstract must describe the student’s individual research and must be authored solely by the student. If the work is collaborative with others and/or part of a larger group project, the abstract should make clear what the student’s role was and should focus on that portion of the work. The extended abstract must not exceed 800 words and must not be longer than 2 pages. The reference list does not count towards these limits. To submit an abstract, please register through the submission page and follow the instructions. Abstracts submitted after the deadline may be considered at the committee's discretion, but only after decisions have been made on all abstracts submitted before the deadline. If you have any problems, don't hesitate to contact the competition chair. More information about the submission process can be found online at: http://www.icfpconference.org/icfp2012/src.html ** Important Dates ** Deadline for submission: June 29th Notification of acceptance: July 8th ** Selection Committee ** Koen Claessen, Chalmers University of Technology Robby Findler (ICFP Program chair), Northwestern University Ken Friis Larsen, IT University of Copenhangen Jacques Garrigue, Nagoya University Doaitse Swierstra (Chair), Utrecht University

1 0

ANNOUNCE: dbus 0.10
by John Millikin 23 Jun '12

23 Jun '12

This is completing the merger of the "dbus-core" and "dbus-client" packages. The new package does everything they can do, but better. Hackage: http://hackage.haskell.org/package/dbus Homepage: https://john-millikin.com/software/haskell-dbus/ API reference: https://john-millikin.com/software/haskell-dbus/reference/haskell-dbus/0.10/ Examples: Included in the tarball, and also at https://john-millikin.com/branches/haskell-dbus/0.10/head:/examples/ Notable changes: * The module hierarchy was simplified. Most users will only ever need the "DBus" and "DBus.Client" modules. * Exports which were not used or useful have been removed. * Much better documentation -- most exports now have a description, and several have examples. * The source code isn't "literate" any more. Too many people expressed frustration at trying to contribute, so I just converted it all to standard flat .hs files. * Better support for custom socket transports and authentication mechanisms. * Added support for listening for socket connections. This allows users to implement both sides of a peer-peer session. * Various improvements to performance, including moving from "binary" to "cereal". * Various minor improvements to correctness.

1 0

*** Early Registration Ends Monday 6/25 *** CAV 2012: Call For Participation
by CAV 2012 CFP 23 Jun '12

23 Jun '12

*** EARLY REGISTRATION ENDS MONDAY 6/25 *** ====== CALL FOR PARTICIPATION ================================================== 24th International Conference on Computer Aided Verification (CAV 2012) July 7-13, 2012 Berkeley, California, USA Program Chairs: Madhusudan Parathasarathy and Sanjit A. Seshia Website: http://cav12.cs.illinois.edu/ Aims and Scope -------------------------------------------------------------------------------- The conference on Computer Aided Verification (CAV), 2012, is the 24th in a series dedicated to the advancement of the theory and practice of computer-aided formal analysis methods for hardware and software systems. CAV considers it vital to continue spurring advances in hardware and software verification while expanding to new domains such as biological systems and computer security. The conference covers the spectrum from theoretical results to concrete applications, with an emphasis on practical verification tools and the algorithms and techniques that are needed for their implementation. The proceedings of the conference will be published in the Springer-Verlag Lecture Notes in Computer Science series. A selection of papers will be invited to a special issue of Formal Methods in System Design and the Journal of the ACM. ** NEW in 2012 ** -------------------------------------------------------------------------------- CAV will have *special tracks* in the following four areas: 1. Hardware Verification (track chair: Andreas Kuehlmann) 2. Computer Security (track chair: Somesh Jha) 3. Embedded Systems (track chair: Stavros Tripakis) 4. SAT and SMT (track chair: Daniel Kroening) Invited Talks -------------------------------------------------------------------------------- - Wolfgang Thomas, RWTH Aachen University "Synthesis and Some of Its Challenges" - David Dill, Stanford University "Model Checking Cell Biology" - Alex Haldermann, University of Michigan On security of voting machines Invited Tutorials -------------------------------------------------------------------------------- - Rastislav Bodik and Emina Torlak, University of California, Berkeley "Synthesizing Programs with Constraint Solvers" - Aaron Bradley, University of Colorado at Boulder "IC3 and Beyond: Incremental, Inductive Verification" - Chris Myers, University of Utah "Formal Verification of Genetic Circuits" - Michał Moskal, Microsoft Research, Seattle "From C to infinity and back: Unbounded auto-active verification with VCC" ====== CONFERENCE PROGRAM ====================================================== Saturday July 7 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - LfSA 2012 Logics for System Analysis Co-chairs: André Platzer, Philipp Rümmer Sunday July 8 - WORKSHOPS ---------------------------------------- - NSV 2012 5th International Workshop on Numerical Software Verification Co-chairs: Swarat Chaudhuri, Sriram Sankaranarayanan - (EC)^2 2012 Workshop on Exploiting Concurrency Efficiently and Correctly Co-chairs: Sebastian Burckhardt, Azadeh Farzan, Ganesh Gopalakrishnan, Stephen Siegel, Helmut Veith, Josef Widder - SYNT 2012 1st Workshop on Synthesis Co-chairs: Doron Peled, Sven Schewe - AMFSB 2012 Applications of Formal Methods in Systems Biology Co-chairs: Vincent Danos, Mahesh Viswanathan - BOOGIE 2012 2nd International Workshop on Intermediate Verification Languages Chair: Zvonimir Rakamaric - REORDER 2012 First International Workshop on Memory Consistency Models Co-chairs: Sela Mador-Haim, Jade Alglave Monday July 9 - INVITED TUTORIALS ---------------------------------------- 8:30 - 10:00: "Synthesizing Programs with Constraint Solvers" (Ras Bodik and Emina Torlak) 10:00 - 10:30: Break 10:30 - 12:00: "IC3 and Beyond: Incremental, Inductive Verification" (Aaron Bradley) 12:00 - 1:30: Break 1:30 - 3:00: "Formal Verification of Genetic Circuits" (Chris Myers) 3:00 - 3:30: Break 3:30 - 5:00: "From C to infinity and back: Unbounded auto-active verification with VCC" (Michal Moskal) Tuesday July 10 ---------------------------------------- 8:30 - 9:00: Welcome 9:00 - 10:00: "Synthesis and Some of Its Challenges" (Wolfgang Thomas - Keynote) 10:00 - 10:30: Break 10:30 - 12:00: AUTOMATA AND SYNTHESIS R1 Jan Kretinsky and Javier Esparza "Deterministic Automata for the (F,G)-fragment of LTL" R2 Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny "Efficient Controller Synthesis for Consumption Games with Multiple Resource Types" R3 Rüdiger Ehlers "ACTL ∩ LTL Synthesis" T1 François Raskin "Acacia+, a tool for LTL synthesis" T2 Chih-Hong Cheng, Michael Geisinger, Harald Ruess, Christian Buckl and Alois Knoll "MGSyn: Automatic Synthesis for Industrial Automation" 12:00 - 1:30: Break 1:30 - 3:35: INDUCTIVE INFERENCE AND TERMINATION R4 Yu-Fang Chen and Bow-Yaw Wang "Learning Boolean Functions Incrementally" R5 Rahul Sharma, Aditya Nori and Alex Aiken "Interpolants as Classifiers" R6 Wonchan Lee, Bow-Yaw Wang and Kwangkeun Yi "Termination Analysis with Algorithmic Learning" R7 Marc Brockschmidt, Richard Musiol, Carsten Otto and Jürgen Giesl "Automated Termination Proofs for Java Programs with Cyclic Data" R8 Javier Esparza, Andreas Gaiser and Stefan Kiefer "Proving Termination of Probabilistic Programs Using Patterns" 3:35 - 4:00: Break 4:00 - 6:05: ABSTRACTION R9 Arnaud Venet "The Gauge Domain: Scalable Analysis of Linear Inequality Invariants" R10 Josh Berdine, Arlen Cox, Samin Ishtiaq and Christoph Wintersteiger "Diagnosing Abstraction Failure for Separation Logic-based Analyses" R11 Aditya Thakur and Thomas Reps "A Method for Symbolic Computation of Abstract Operations" R12 Simone Fulvio Rollini, Ondrej Sery and Natasha Sharygina "Leveraging Interpolant Strength in Model Checking" T3 Evan Driscoll, Aditya Thakur and Thomas Reps "OpenNWA: A Nested Word Automaton Library" T4 Aws Albarghouthi, Yi Li, Arie Gurfinkel and Marsha Chechik "UFO: A Framework for Abstraction- and Interpolation-Based Verification" T5 Francesco Alberti, Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise and Natasha Sharygina "SAFARI: SMT-based Abstraction For Arrays with Interpolants" 6:30 - 8:30: PC dinner Wednesday July 11 ---------------------------------------- 8:35 - 10:35: CONCURRENCY & SOFTWARE VERIFICATION R13 Mohamed Faouzi Atig, Ahmed Bouajjani, Michael Emmi and Akash Lal "Detecting Fair Non-Termination in Multithreaded Programs" R14 Vineet Kahlon and Chao Wang "Lock Removal for Concurrent Trace Programs" R15 Gerhard Schellhorn, John Derrick and Heike Wehrheim "How to prove algorithms linearisable" R16 Anthony Widjaja Lin and Matthew Hague "Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters" R17 Alessandro Cimatti and Alberto Griggio "Software Model Checking via IC3" 10:35 - 11:00: Break 11:00 - 12:00: "Model Checking Cell Biology" (David Dill - Keynote) 12:00 - 1:30: Lunch 1:30 - 3:00: BIOLOGY & PROBABILISTIC SYSTEMS R18 Calin Guet, Ashutosh Gupta, Thomas A. Henzinger, Maria Mateescu and Ali Sezgin "Delayed Continuous Time Markov Chains for Genetic Regulatory Circuits" R19 Anvesh Komuravelli, Corina S. Pasareanu and Edmund M. Clarke "Assume-Guarantee Abstraction Refinement for Probabilistic Systems" R20 Cyrille Jegourel, Axel Legay and Sean Sedwards "Cross entropy optimisation of importance sampling parameters for statistical model checking" T6 David Benque, Sam Bourton, Caitlin Cockerton, Byron Cook, Jasmin Fisher, Samin Ishtiaq, Nir Piterman, Alex Taylor and Moshe Vardi "Ripple: Visual Tool for Modeling and Analysis of Biological Networks" T7 Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Björn Wachter and James Worrell "APEX: An analyzer for open probabilistic programs" 3:30 - 4:00: Break 4:00 - 5:30: *EMBEDDED AND CONTROL SYSTEMS* - special track session R21 Adiya Zutshi, Sriram Sankaranarayanan and Ashish Tiwari "Timed Relational Abstractions For Sampled Data Control Systems" R22 Rupak Majumdar and Majid Zamani "Approximately Bisimilar Symbolic Models for Digital Control Systems" R23 Alessandro Cimatti, Raffaele Corvino, Armando Lazzaro, Iman Narasamdya, Tiziana Rizzo, Marco Roveri, Angela Sanseviero and Andrei Tchaltsev "Formal Verification and Validation of ERTMS Industrial Railway Train Spacing System" T8 Philip Armstrong, Joel Ouaknine, Hristina Palikareva and Bill Roscoe "Recent Developments in FDR" T9 Songzheng Song, Jun Sun, Yang Liu and Jin Song Dong "A Model Checker for Hierarchical Probabilistic Real-time Systems" 6:00 - 9:30: Banquet Thursday July 12 ---------------------------------------- 8:30 - 10:00: *SAT/SMT SOLVING AND SMT-BASED VERIFICATION* - special track session R24 Isil Dillig, Thomas Dillig, Kenneth McMillan and Alex Aiken "Minimum Satisfying Assignments for SMT" R25 Cheng-Shen Han and Jie-Hong Roland Jiang "When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way" R26 Akash Lal, Shaz Qadeer and Shuvendu Lahiri "Corral: A Solver for Reachability Modulo Theories" T10 Shuvendu Lahiri, Chris Hawblitzel, Ming Kawaguchi and Henrique Rebêlo "SymDiff: A language-agnostic semantic diff tool" T11 Sylvain Conchon, Amit Goel, Sava Krstic, Alain Mebsout and Fatiha Zaidi "Cubicle: A Parallel SMT-based Model Checker for Parameterized Systems" 10:00 - 10:30: Break 10:30 - 12:00: *TIMED & HYBRID SYSTEMS* - special track session R27 Shibashis Guha, Chinmay Narayan and S. Arun-Kumar "On Decidability of Prebisimulation for Timed Automata" R28 Ichiro Hasuo and Kohei Suenaga "Exercises in Nonstandard Static Analysis of Hybrid Systems" R29 Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle "A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx" T12 Ashish Tiwari "HybridSal Relational Abstracter" T13 Swarat Chaudhuri and Armando Solar-Lezama "Euler: A System for Numerical Optimization of Programs" 12:00 - 1:30: Lunch 1:30 - 2:45: *HARDWARE VERIFICATION* - special track session R30 Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Scott Owens, Jade Alglave, Kayvan Memarian, Rajeev Alur, Milo Martin, Peter Sewell and Derek Williams "An Axiomatic Memory Model for Power Multiprocessors" R31 Flavio M de Paula, Alan Hu and Amir Nahir "nuTAB-BackSpace: Rewriting to Normalize Non-Determinism in Post-Silicon Debug Traces" R32 Zyad Hassan, Aaron Bradley and Fabio Somenzi "Incremental Inductive CTL Model Checking" 2:45 - 3:35: Miscellaneous Tools T14 Rishabh Singh and Armando Solar-Lezama "SPT : Storyboard Programming Tool" T15 Patrick Rondon, Ming Kawaguchi, Alexander Bakst and Ranjit Jhala "CSolve: Verifying C With Liquid Types" T16 Daniel Schwartz-Narbonne, Feng Liu, David August and Sharad Malik "PASSERT: A tool for debugging parallel programs" T17 Joxan Jaffar, Vijayaraghavan Murali, Jorge A. Navas and Andrew E. Santosa "TRACER: A Symbolic Execution Tool for Verification" T18 Stephan Arlt and Martin Schäf "Joogie: Infeasible Code Detection for Java" T19 David Hopkins, Andrzej Murawski and Luke Ong "Hector: An Equivalence Checker for a Higher-Order Fragment of ML" T20 Jan Hoffmann, Klaus Aehlig and Martin Hofmann "Resource Aware ML" 3:35 - 4:00: Break 4:00 - 5:30: Tool demo/poster session 5:30 - 6:30: CAV business meeting 6:30 - 9:00: SC dinner Friday July 13 ---------------------------------------- 9:00 - 10:00: On security of voting machines (Alex Haldermann - Invited talk) 10:00 - 10:30: Break 10:30 - 11:45: *SECURITY* - special track session R33 Matt Fredrikson, Richard Joiner, Somesh Jha, Thomas Reps, Phillip Porras, Hassen Saidi and Vinod Yegneswaran "Efficient Runtime Policy Enforcement Using Counterexample-Guided Abstraction Refinement" R34 Boris Köpf, Laurent Mauborgne and Martín Ochoa "Automatic Quantification of Cache Side-Channels" R35 William Harris, Somesh Jha and Thomas Reps "Secure Programming via Visibly Pushdown Safety Games" 11:45 - 11:50: Mini-break 11:50 - 1:05: VERIFICATION AND SYNTHESIS R36 Nishant Sinha, Nimit Singhania, Satish Chandra and Manu Sridharan "Alternate and Learn: Finding witnesses without looking all over" R37 Duc Hiep Chu and Joxan Jaffar "A Complete Method for Symmetry Reduction in Safety Verification" R38 Rishabh Singh and Sumit Gulwani "Synthesizing Number Transformations from Input-Output Examples" 1:00 - 1:15: Conference Wrap-up

1 0

WLPE 2012 - Deadline extension
by Wim Vanhoof 22 Jun '12

22 Jun '12

[Apologies for multiple copies...] * Submission deadline extended until July 1 * ----------------------------------------------------------- WLPE 2012 - CALL FOR PAPERS Workshop on Logic-based Methods in Programming Environments (satellite workshop of ICLP 2012) September 8, 2012 Budapest, Hungary http://users.dsic.upv.es/workshops/wlpe2012/ ----------------------------------------------------------- The workshop aims at providing an informal meeting for researchers working on logic-based tools for development and analysis of programs. In addition to papers describing more conceptual work on environmental tools, we solicit papers describing the implementation of and experimentation with such tools. We hope to attain the same friendly atmosphere as in past workshops, which enabled fruitful exchanges leading to joint research and subsequent publications. Areas particularly relevant to the workshop include: * static and dynamic analysis * debugging and testing * program verification and validation * code generation from specifications * termination and non-termination analysis * reasoning on occurs-check freeness and determinacy * frameworks and resources for sharing in the logic programming community * profiling and performance analysis * type- and mode analysis * shape, point-to and escape analysis * module systems * optimization tools * program understanding * refactoring * logical meta-languages Note that this list is not exhaustive and, if you are interested in taking part in the workshop but unsure if your work falls within its scope, do contact the organisers who will be happy to advise. The 22nd Workshop on Logic-based methods in Programming Environments will take place in Budapest, Hungary, as a satellite workshop of ICLP 2012, the 28the International Conference on Logic Programming. This workshop will continue the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington, USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium and Port Jefferson, USA (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004), Sitges, Spain (2005), Seattle, Washington USA (2006), Porto, Portugal (2007), Udine, Italy (2008), Pasadena, USA (2009), Edinburgh, UK (2010), and Odense, Denmark (2011). This year WLPE will be coordinated with CICLOPS. In particular, there will be two special events organised: (a) SWI-25, a celebration and retrospective of the open source SWI-Prolog engine on the occasion of its 25th birthday, and (b) OpenPL, an event on (1) coordinating efforts towards furthering cross-engine compatibility, with a focus on libraries and add-on packages, and (2) the creation of a user-contributing repository of Prolog code. Submission guidelines --------------------- We encourage the submission of original research in the area as well as relevant results that have been submitted, rejected, or accepted elsewhere as long as they are relevant for the WLPE community. All papers must be written in English and should not exceed 15 pages. We welcome also shorter submissions, e.g., extended abstracts and short papers, of at least 3 pages. Papers should be submitted electronically via the submission page: https://www.easychair.org/conferences/?conf=wlpe2012 An informal proceedings will be distributed electronically at the workshop. After the workshop, the proceedings will be publicly available on-line in the Computing Research Repository (CoRR). Important dates --------------- Submission: July 1, 2012 Notification: July 16, 2012 Camera-ready: July 27, 2012 Workshop: September 8, 2012 Workshop organizers ------------------- Win Vanhoof Faculty of Computer Science University of Namur Namur, Belgium Email: wlpe2012(a)dsic.upv.es Alicia Villanueva Department of Computer Science (DSIC) Universitat Politècnica de València Valencia, Spain Email: wlpe2012(a)dsic.upv.es Program committee ----------------- Salvador Abreu Universidade de Évora, Portugal Petra Hofstedt University of Technology Berlin, Germany Jacob Howe City University London, UK Yoshitaka Kameya Tokyo Institute of Technology, Japan Roland Kaminski Universität Postdam, Germany Lunjin Lu Oakland University, USA Alexander Serebrenik Eindhoven University of Technology, The Netherlands Peter Schneider-Kamp University of Southern Denmark, Denmark Zoltan Somogyi University of Melbourne, Australia Win Vanhoof University of Namur, Belgium Alicia Villanueva Universitat Politècnica de València, Spain Damiano Zanardini Universidad Politécnica de Madrid, Spain

1 0

CUFP 2012: only 8 days left to submit your talk proposal
by Stefan Wehr 21 Jun '12

21 Jun '12

Hi everyone, the talk proposals for CUFP 2012 are due June 29, so hurry up if you intend to give a talk! Thanks, Stefan --- Commercial Users of Functional Programming 2012: Call for Presentations COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING 2012 CUFP 2012 http://cufp.org/conference CALL FOR PRESENTATIONS Copenhagen, Denmark Sep 13-15 Co-located with ICFP 2012 Sponsored by SIGPLAN Talk Proposal Submission Deadline 29 June 2012 The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. Giving a CUFP Talk ================== If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: Experience reports are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. Technical talks are also 25 minutes long, and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to sperber(at)deinprogramm(dot)de or avsm2(at)cl(dot)cam(dot)ac(dot)uk by 29 June 2012 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! Note that we will need all presenters to register for the CUFP workshop and travel to Copenhagen at their own expense. Program Committee ================= Mike Sperber (Active Group), co-chair Anil Madhavapeddy (University of Cambridge), co-chair Ashish Agarwal (New York University) Thomas Arts (QuviQ AB) Chris Houser (LonoCloud) Tomas Petricek (University of Cambridge) Heiko Seeberger (Typesafe) Stefan Wehr (factis research) Noel Welsh (untyped) More information ================ For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 16th. Guidance on giving a great CUFP talk ==================================== Focus on the interesting bits: Think about what will distinguish your talk, and what will engage the audience, and focus there. There are a number of places to look for those interesting bits. Setting: FP is pretty well established in some areas, including formal verification, financial processing and server-side web-services. An unusual setting can be a source of interest. If you're deploying FP-based mobile UIs or building servers on oil rigs, then the challenges of that scenario are worth focusing on. Did FP help or hinder in adapting to the setting? Technology: The CUFP audience is hungry to learn about how FP techniques work in practice. What design patterns have you applied, and to what areas? Did you use functional reactive programming for user interfaces, or DSLs for playing chess, or fault-tolerant actors for large scale geological data processing? Teach us something about the techniques you used, and why we should consider using them ourselves. Getting things done: How did you deal with large software development in the absence of a myriad of pre-existing support that are often expected in larger commercial environments (IDEs, coverage tools, debuggers, profilers) and without larger, proven bodies of libraries? Did you hit any brick walls that required support from the community? Don't just be a cheerleader: It's easy to write a rah-rah talk about how well FP worked for you, but CUFP is more interesting when the talks also spend time on what doesn't work. Even when the results were all great, you should spend more time on the challenges along the way than on the parts that went smoothly. ---

1 0

Haskell Weekly News: Issue 232
by Daniel Santa Cruz 21 Jun '12

21 Jun '12

Welcome to issue 232 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 10 to 16, 2012. Quotes of the Week * irene-knapp: ewtoombs: the universe is already an interactive quantum physics simulator * Philipp: "While in Python every problem can be solved with a big enough Hashtable, in Haskell, every problem can be solved with an additional type parameter." * kulin: man, i am loving this existential quantification, i feel like now i will use it incorrectly to solve every problem for sure * mekeor: xmonad is awesome (ignore the ambiguity, please) Top Reddit Stories * Waldo - the Haskell powered codebase behind xkcd’s Umwelt comic Domain: self.haskell, Score: 75, Comments: 16 On Reddit: [1] http://goo.gl/M2fGv Original: [2] http://goo.gl/M2fGv * “ARM is now a fully supported target platform for GHC, complete with GHCi support” Domain: haskell.org, Score: 60, Comments: 17 On Reddit: [3] http://goo.gl/O0XK3 Original: [4] http://goo.gl/0Fajp * 3D Mandelbrot in OpenGL from imperative to functional style. Domain: yannesposito.com, Score: 36, Comments: 8 On Reddit: [5] http://goo.gl/5MKK1 Original: [6] http://goo.gl/nzpvl * ANN: clckwrks - a Haskell blogging and CMS framework Domain: groups.google.com, Score: 35, Comments: 21 On Reddit: [7] http://goo.gl/ROrHt Original: [8] http://goo.gl/WneBw * web server C10k benchmark: snap vs. erlang, go, node.js, java Domain: github.com, Score: 35, Comments: 5 On Reddit: [9] http://goo.gl/r1Q1j Original: [10] http://goo.gl/eFlTm * GADTs Domain: haskellforall.com, Score: 33, Comments: 74 On Reddit: [11] http://goo.gl/B41Ef Original: [12] http://goo.gl/rcL6I * Announcing Elm 0.2: Haskell integration (Yesod, HAppStack, and Snap), better error messages, larger examples, and more. Domain: self.haskell, Score: 30, Comments: 8 On Reddit: [13] http://goo.gl/ENBPH Original: [14] http://goo.gl/ENBPH * command line options using applicative without Template Haskell Domain: github.com, Score: 28, Comments: 13 On Reddit: [15] http://goo.gl/zqKGw Original: [16] http://goo.gl/eVSAb * Haskell and Yesod - Book on writing web applications in Haskell Domain: shop.oreilly.com, Score: 28, Comments: 5 On Reddit: [17] http://goo.gl/0RdvE Original: [18] http://goo.gl/9qCEu Top StackOverflow Questions * Tying the Knot with a State monad votes: 33, answers: 3 Read on SO: [19] http://goo.gl/cMcRf * Lazy evaluation of terms in an infinite list in Haskell votes: 32, answers: 4 Read on SO: [20] http://goo.gl/IyRJ1 * What is going on with the types in this ghci session? votes: 17, answers: 1 Read on SO: [21] http://goo.gl/3RVnN * the seq function and strictness votes: 14, answers: 2 Read on SO: [22] http://goo.gl/f8u9G * Is it possible to “hide” language extensions? votes: 11, answers: 2 Read on SO: [23] http://goo.gl/q4JQx * Rebinding do notation for indexed monads votes: 11, answers: 1 Read on SO: [24] http://goo.gl/Z4lnx * Haskell: “how much” of a type should functions receive? and avoiding complete “reconstruction” votes: 9, answers: 1 Read on SO: [25] http://goo.gl/2FFHu * Intelligent purely functional sets votes: 8, answers: 1 Read on SO: [26] http://goo.gl/I7Tzb * Is there a better way to express the absolute error function in point-free notation? votes: 8, answers: 2 Read on SO: [27] http://goo.gl/FFFek * GADTs vs. MultiParamTypeClasses votes: 7, answers: 2 Read on SO: [28] http://goo.gl/3DYKI Until next time, Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/uved7/waldo_the_haskell_powered_co… 2. http://www.reddit.com/r/haskell/comments/uved7/waldo_the_haskell_powered_co… 3. http://www.haskell.org/pipermail/haskell-cafe/2012-June/101704.html 4. http://www.reddit.com/r/haskell/comments/uv07c/arm_is_now_a_fully_supported… 5. http://yannesposito.com/Scratch/en/blog/Haskell-OpenGL-Mandelbrot/ 6. http://www.reddit.com/r/haskell/comments/v4pzk/3d_mandelbrot_in_opengl_from… 7. https://groups.google.com/forum/#!msg/clckwrks/58AwDSRRGoI/prrMP6fhtqMJ 8. http://www.reddit.com/r/haskell/comments/uyr0y/ann_clckwrks_a_haskell_blogg… 9. https://github.com/ericmoritz/wsdemo/blob/results-v1/results.md 10. http://www.reddit.com/r/haskell/comments/v595l/web_server_c10k_benchmark_sn… 11. http://www.haskellforall.com/2012/06/gadts.html 12. http://www.reddit.com/r/haskell/comments/v5ewa/gadts/ 13. http://www.reddit.com/r/haskell/comments/uugne/announcing_elm_02_haskell_in… 14. http://www.reddit.com/r/haskell/comments/uugne/announcing_elm_02_haskell_in… 15. https://github.com/pcapriotti/optparse-applicative 16. http://www.reddit.com/r/haskell/comments/uw7eq/command_line_options_using_a… 17. http://shop.oreilly.com/product/0636920023142.do 18. http://www.reddit.com/r/haskell/comments/v64f5/haskell_and_yesod_book_on_wr… 19. http://stackoverflow.com/questions/11060565/tying-the-knot-with-a-state-mon… 20. http://stackoverflow.com/questions/10972429/lazy-evaluation-of-terms-in-an-… 21. http://stackoverflow.com/questions/11003535/what-is-going-on-with-the-types… 22. http://stackoverflow.com/questions/11046590/the-seq-function-and-strictness 23. http://stackoverflow.com/questions/11035676/is-it-possible-to-hide-language… 24. http://stackoverflow.com/questions/11042685/rebinding-do-notation-for-index… 25. http://stackoverflow.com/questions/10967832/haskell-how-much-of-a-type-shou… 26. http://stackoverflow.com/questions/10971237/intelligent-purely-functional-s… 27. http://stackoverflow.com/questions/11006772/is-there-a-better-way-to-expres… 28. http://stackoverflow.com/questions/10994508/gadts-vs-multiparamtypeclasses

1 0