June 2012 - Haskell - Haskell.org

Haddock problems with Haskell-Platform2012.2.0.0
by Katsutoshi Itoh 07 Jun '12

07 Jun '12

Hi all. I installed ghc-7.4.1 and haskell-platform-2.12.2.0.0 on debian linux. I'm getting lots of complaints from 'ghc-pkg check', of the following form: ---- Warning: haddock-interfaces: /usr/pkg/share/doc/haskell- platform-2012.2.0.0/html/haskell-platform.haddock doesn't exist or isn't a file Warning: haddock-html: /usr/pkg/share/doc/haskell-platform-2012.2.0.0/ html doesn't exist or isn't a directory Warning: haddock-interfaces: /usr/pkg/share/doc/zlib-0.5.3.3/html/ zlib.haddock doesn't exist or isn't a file Warning: haddock-html: /usr/pkg/share/doc/zlib-0.5.3.3/html doesn't exist or isn't a directory ... ---- Any advice? -- ---- いとうかつとし cutsea110(a)gmail.com

1 0

Haskell Weekly News: Issue 230
by Daniel Santa Cruz 07 Jun '12

07 Jun '12

Welcome to issue 230 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of May 27 to June 02, 2012. Announcements Mark Lentczner had great news for us this week, announcing the release of the Haskell Platform 2012.2.0.0. Many many thanks to the platform team for getting this release out the door! [1] http://goo.gl/XX9P6 Top Reddit Stories * Conduit bugs Domain: haskellforall.com, Score: 45, Comments: 25 On Reddit: [2] http://goo.gl/hQCbs Original: [3] http://goo.gl/3wR5W * Response to "Conduit Bugs" Domain: yesodweb.com, Score: 43, Comments: 53 On Reddit: [4] http://goo.gl/TV5i3 Original: [5] http://goo.gl/N8uMM * Haskell fully async Chan/TChan vs. Go's channels Domain: plus.google.com, Score: 42, Comments: 14 On Reddit: [6] http://goo.gl/UJBXN Original: [7] http://goo.gl/K0zzA * Most Important GHC extensions to learn/use? Domain: permalink.gmane.org, Score: 38, Comments: 11 On Reddit: [8] http://goo.gl/i6ofz Original: [9] http://goo.gl/x7Mxg * What's so bad about Template Haskell? Domain: stackoverflow.com, Score: 35, Comments: 8 On Reddit: [10] http://goo.gl/fdiUm Original: [11] http://goo.gl/Vg4AT * stylish-haskell: A simple tool to clean up Haskell code Domain: github.com, Score: 32, Comments: 74 On Reddit: [12] http://goo.gl/QT9br Original: [13] http://goo.gl/TlZum * Understanding Haskell's monomorphism restriction Domain: self.haskell, Score: 27, Comments: 38 On Reddit: [14] http://goo.gl/tb1uC Original: [15] http://goo.gl/tb1uC * Pipes 2.0 vs pipes-core Domain: paolocapriotti.com, Score: 26, Comments: 40 On Reddit: [16] http://goo.gl/lmNeD Original: [17] http://goo.gl/najMM * FP Complete and Well-Typed delivered a two-day hands-on Haskell training at Qualcomm Domain: haskell.org, Score: 26, Comments: 2 On Reddit: [18] http://goo.gl/R3Ufl Original: [19] http://goo.gl/sC3O3 * ICFP'12 Accepted Papers (with links, where available!) Domain: github.com, Score: 26, Comments: 2 On Reddit: [20] http://goo.gl/361wt Original: [21] http://goo.gl/3ACvz Top StackOverflow Questions * What's so bad about Template Haskell? votes: 67, answers: 3 Read on SO: [22] http://goo.gl/Vg4AT * Which Haskell (GHC) extensions should users use/avoid? votes: 23, answers: 1 Read on SO: [23] http://goo.gl/s0TNH * Space leak with redundant use of seq in GHC interpreter votes: 17, answers: 2 Read on SO: [24] http://goo.gl/no97P * Is there a list of GHC extensions that are considered 'safe'? votes: 15, answers: 1 Read on SO: [25] http://goo.gl/10SJc * What are lenses used/useful for? votes: 14, answers: 4 Read on SO: [26] http://goo.gl/kn8uj * Haskell: Can I perform several folds over the same lazy list without keeping list in memory? votes: 12, answers: 2 Read on SO: [27] http://goo.gl/VuWQ7 * What are the advantages and disadvantages of using lenses? votes: 11, answers: 2 Read on SO: [28] http://goo.gl/kGX4B * Calculating work done by f x = (x,x) votes: 11, answers: 1 Read on SO: [29] http://goo.gl/838C2 * Why is function definition for all types at once not allowed in Haskell? votes: 10, answers: 5 Read on SO: [30] http://goo.gl/eoDXp * Generic variant of bi f a b = (f a, f b) votes: 9, answers: 4 Read on SO: [31] http://goo.gl/NPDMU * Unicode console I/O in Haskell on Windows votes: 9, answers: 1 Read on SO: [32] http://goo.gl/AFCQh Until next time, Daniel Santa Cruz References 1. http://comments.gmane.org/gmane.comp.lang.haskell.platform/1964 2. http://www.haskellforall.com/2012/05/conduit-bugs.html 3. http://www.reddit.com/r/haskell/comments/u7vyx/conduit_bugs/ 4. http://www.yesodweb.com/blog/2012/05/response-conduit-bugs 5. http://www.reddit.com/r/haskell/comments/u8fe6/response_to_conduit_bugs/ 6. https://plus.google.com/109566665911385859313/posts/FAmNTExSLtz 7. http://www.reddit.com/r/haskell/comments/ubmz7/haskell_fully_async_chantcha… 8. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/98574 9. http://www.reddit.com/r/haskell/comments/ufenx/most_important_ghc_extension… 10. http://stackoverflow.com/questions/10857030/whats-so-bad-about-template-has… 11. http://www.reddit.com/r/haskell/comments/ugd94/whats_so_bad_about_template_… 12. https://github.com/jaspervdj/stylish-haskell/blob/master/README.markdown 13. http://www.reddit.com/r/haskell/comments/u8u1y/stylishhaskell_a_simple_tool… 14. http://www.reddit.com/r/haskell/comments/udnx2/understanding_haskells_monom… 15. http://www.reddit.com/r/haskell/comments/udnx2/understanding_haskells_monom… 16. http://paolocapriotti.com/blog/2012/05/29/pipes-2.0-vs-pipes-core/ 17. http://www.reddit.com/r/haskell/comments/uav9d/pipes_20_vs_pipescore/ 18. http://www.haskell.org/pipermail/haskell-cafe/2012-June/101558.html 19. http://www.reddit.com/r/haskell/comments/ug4wq/fp_complete_and_welltyped_de… 20. https://github.com/technogeeky/icfp12-paper-links/blob/master/README.md 21. http://www.reddit.com/r/haskell/comments/uhhd2/icfp12_accepted_papers_with_… 22. http://stackoverflow.com/questions/10857030/whats-so-bad-about-template-has… 23. http://stackoverflow.com/questions/10845179/which-haskell-ghc-extensions-sh… 24. http://stackoverflow.com/questions/10793371/space-leak-with-redundant-use-o… 25. http://stackoverflow.com/questions/10830757/is-there-a-list-of-ghc-extensio… 26. http://stackoverflow.com/questions/10788261/what-are-lenses-used-useful-for 27. http://stackoverflow.com/questions/10803221/haskell-can-i-perform-several-f… 28. http://stackoverflow.com/questions/10774614/what-are-the-advantages-and-dis… 29. http://stackoverflow.com/questions/10825933/calculating-work-done-by-f-x-x-x 30. http://stackoverflow.com/questions/10811657/why-is-function-definition-for-… 31. http://stackoverflow.com/questions/10772121/generic-variant-of-bi-f-a-b-f-a… 32. http://stackoverflow.com/questions/10779149/unicode-console-i-o-in-haskell-…

1 0

Call For Papers for HASE 2012
by Sanjukta Bhowmick 06 Jun '12

06 Jun '12

(We apologize if you have received multiple copies of this CFP) Dear Colleague We would like to invite you to submit papers to The 14th IEEE International Symposium on High Assurance Systems Engineering (HASE 2012), to be held at Omaha NE. October 25-27. HASE 2012 is a forum on tools and techniques used to design and construct systems that, in addition to meeting their functional objectives, are safe, secure, and reliable. Topics of interest include but are not limited to: SCADA systems and other critical infrastructures, cyber-physical systems, cloud computing, distributed systems, web services, embedded systems, emergent behavior, fault tolerance, simulation, monitoring, model-driven engineering, synthesis, formal methods, domain-specific languages, evolution and change, verification and validation, software analysis and visualization, tools, transformation-based development, security , as well as case studies and experiments. The following types of submissions are solicited: Research Papers HASE 2012 is soliciting original, unpublished research papers. The length is limited to eight pages, in IEEE style. More information can be found on the HASE 2012 website: http://hase2012.ist.unomaha.edu/ Fast Abstracts A fast abstract is a lightly reviewed, two-page technical article that requires a short talk at HASE. The goal of a fast abstract is to promote current work, research, practices, opinions, experiences, and issues related to any facet of high assurance systems. A fast abstract is early communication of technical work and does not require the completed results expected of a conference or journal publication. The length is limited to two pages, in IEEE style. Panel Proposals Proposals for panels are being solicited. Panels should focus on new challenges and emerging technologies related to high assurance systems, to stimulate a lively and thought provoking discussion. Controversial issues that encompass multiple viewpoints are desirable. The goal is to engage the audience with a lively debate that furthers their understanding of the topic. Panel proposals of at most two pages should be submitted by email, to rgandhi(a)unomaha.edu<mailto:rgandhi@unomaha.edu>, and should include the panel title and scope, and the organizers' contact information. The paper submission website is available at http://www.easychair.org/conferences/?conf=hase2012 Important Dates/Deadlines July 22, 2012 Paper Submission August 31, 2012 Paper Notification September 9, 2012 Camera-ready submission September 16, 2012 Preliminary Conference Program Sincerely, HASE 2012 Organizing Committee. Program Committee for HASE 2012 Ahamed Iqbal Marquette University, USA Babiceanu Radu University of Arkansas at Little Rock, USA Bastani Farrokh University of Texas at Dallas, USA Bharadwaj Ramesh Naval Research Laboratory, USA Bondavalli Andrea University of Florence, Italy Chunming Hu Beihang University Cukic Bojan West Virginia University, USA Dampier David Mississippi State University, USA Dimitrios Serpanos University of Patras Fu Jicheng University of Central Oklahoma, USA Gandhi Robin University of Nebraska at Omaha, USA Garg Vijay University of Texas at Austin, USA Ghafoor Arif Purdue University, USA Helene Waeselynck LAAS-CNRS Hong Zhu Oxford Brookes University Hurson Ali Missouri University of Science and Technology, USA I-Ling Yen University of Texas at Dallas Iyer Ravi University of Illinois, USA Kanoun Karama LAAS-CNRS, France Jianjun Zhao Shanghai Jiao Tong University Jie Xu University of Leeds Katerina Goseva West Virginia University Kenji Taguchi National Institute of Advanced Industrial Science and Technology (AIST), Japan Kenji Yoshigoe University of Arkansas at Little Rock Khan Farrukh Texas Southern University Liu Frank Missouri University of Science and Technology, USA Lu Jian Nanjing University, China Lu Xiaodong Tokyo Institute of Technology, Japan Lyu Michael Chinese University of Hong Kong McMillin Bruce Missouri University of Science and Technology, USA Mohammad Zulkernine Queen's University Neeraj Suri TU Darmstadt Pattabiraman Karthik University of British Columbia, Canada Paul Raymond Department of Defense Punnekkat Sasikumar Mälardalen University, Sweden Roach Steve University of Texas at El Paso, USA Rotella Pete Cisco Systems, USA Saglietti Francesca Universität Erlangen-Nürnberg, Germany Schoitsch Erwin Austrian Institute of Technology Sedigh Sahra Missouri University of Science and Technology, USA Seliya Naeem University of Michigan - Dearborn, USA Umit Topaloglu University of Arkansas for Medical Science Victor Winter University of Nebraska at Omaha, USA

1 0

HaL7: Haskell-Treffen in Halle/Saale, Freitag 2012-07-13
by Henning Thielemann 06 Jun '12

06 Jun '12

For our German readers: Es ist wieder so weit: Am Freitag, 13. Juli laden wir zum 7. Haskell-Treffen HaL ein, diesmal nach Halle an der Saale. Wir bieten eine bunte Mischung aus Tutorien zum Mitmachen, Vortraegen zum Anhoeren und Gelegenheiten zum Fachsimpeln, theoretisches wie praktisches, ernstes wie heiteres. Das Programm im Schnelldurchlauf ist: vormittags 6 Tutorien 09:30 - 11:00 snap repa schule 11:30 - 13:00 reactive generics liveseq nachmittags 4 Vortraege 14:30 - 15:15 Dorn: Schule 15:15 - 16:00 Voigtlaender: ADP 16:30 - 17:15 Goergens: XenClient 17:15 - 18:00 Eijkel: Hommage sonstiges: 09:00 - 11:30 Installationshilfen 11:00 - 11:30 Kaffeepause 13:00 - 14:30 Mittagspause 16:00 - 16:30 Kaffeepause 19:00 - Ende Abendessen und Fachsimpelei im Restaurant Die Details finden Sie hier: http://iba-cg.de/hal7.html und die Anmeldung da: http://sim.mathematik.uni-halle.de:8080/hal7/ Bitte melden Sie sich bis zum 4. Juli an. Wir freuen uns auf Ihr zahlreiches Erscheinen! für das Programmkomitee Henning Thielemann

2 1

HOPE 2012 (a new workshop co-located with ICFP): Final Call for Talk Proposals
by Amal Ahmed 06 Jun '12

06 Jun '12

The deadline for HOPE 2012 talk proposals is this Friday, June 8th. Short submissions of a few paragraphs are quite welcome! ------------------------------------------------------------------- FINAL CALL FOR TALK PROPOSALS HOPE 2012 The 1st ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 9, 2012 Copenhagen, Denmark (the day before ICFP 2012) http://hope2012.mpi-sws.org HOPE is a *new workshop* that is intended to bring together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. This 1st edition of HOPE is dedicated to John Reynolds, whose work is an inspiration to us all. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2012(a)mpi-sws.org. Deadline for talk proposals: June 8, 2012 (Friday) Notification of acceptance: July 1, 2012 (Sunday) Workshop: September 9, 2012 (Sunday) The submission website is now open: http://www.easychair.org/conferences/?conf=hope2012 --------------------- Workshop Organization --------------------- Program Co-Chairs: Amal Ahmed (Northeastern University) Derek Dreyer (MPI-SWS, Germany) Program Committee: Jim Laird (University of Bath) Rasmus Møgelberg (IT University of Copenhagen) Greg Morrisett (Harvard University) Aleks Nanevski (IMDEA Software Institute) David Naumann (Stevens Institute of Technology) Matthew Parkinson (Microsoft Research Cambridge) François Pottier (INRIA Rocquencourt) Amr Sabry (Indiana University) Eijiro Sumii (Tohoku University) Nikhil Swamy (Microsoft Research Redmond) Nobuko Yoshida (Imperial College London)

1 0

*** Early registration ends June 20 *** CAV 2012: Call for Participation
by CAV 2012 CFP 05 Jun '12

05 Jun '12

*** Early registration ends June 20 *** ====== 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

Announce: Haskell Platform 2012.2.0.0
by Mark Lentczner 03 Jun '12

03 Jun '12

We're pleased to announce the next release of Haskell Platform: a single, standard Haskell distribution for everyone. Download Haskell Platform 2012.2.0.0: http://haskell.org/platform/ The specification, along with installers (including Windows, Macintosh, and Unix installers for a full Haskell environment) are available. Notable version changes with this release: ghc 7.4.1 cabal 1.14 & cabal-install 0.14 mtl 2.1.1 & transformers 0.3.0.0 alex 3.0.1 full package and version list: http://hackage.haskell.org/platform/changelog.html Thanks to: Joachim Breitner, George Colpitts, Duncan Coutts, Jason Dagit, Chris Dornan, Yitzchak Gale, Mikhail Glushenkov, Andres Löh, Gábor Páli, Jens Petersen, Don Stewart, David Terei, Johan Tibell, & Mark Wright for their efforts and help in putting together this release. -- The Platform Infrastructure Team Mark Lentczner, release manager --------------------------------------------------------------------- The Haskell Platform is a single, standard Haskell distribution for every system, in the form of a blessed library and tool suite for Haskell distilled from the thousands of libraries on Hackage, along with installers for a wide variety of systems. It saves developers work picking and choosing the best Haskell libraries and tools to use for a task. When you install the Haskell Platform, you get the latest stable compiler, an expanded set of core libraries, additional development tools, and cabal-install – so you can download anything else you need from Hackage.

2 1

Call for Participation - Workshop on Reversible Computation 2012
by Janis Voigtländer 01 Jun '12

01 Jun '12

Please distribute to anyone who may be interested. ============================================================== Call for Participation 4th Workshop on Reversible Computation (RC 2012) July 2nd-3rd, 2012, Copenhagen, Denmark http://www.reversible-computation.org ============================================================== Reversible computation has a growing number of promising application areas such as low power design, coding/decoding, program debugging, testing, database recovery, discrete event simulation, reversible algorithms, reversible specification formalisms, reversible programming languages, process algebras, and the modeling of biochemical systems. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented recently and are seen as promising alternatives to conventional CMOS technology. The workshop will bring together researchers from computer science, mathematics, and electrical engineering to discuss new developments and directions for future research in Reversible Computation. This also includes applications of reversibility in quantum computation. The 4th Workshop on Reversible Computation will take place on July 2nd and 3rd, 2012 in Copenhagen, Denmark and is organized by the University of Copenhagen. Previous editions of the Workshop on Reversible Computation took place in York (UK), Bremen (Germany), and Gent (Belgium). ===== Technical Program ===== This year, we received a record number of 46 submissions out of which 15 full papers, 7 work-in-progress papers, and 1 tutorial paper have been accepted. A full list of all papers accepted for RC 2012 is provided at http://www.reversible-computation.org/2012/cms/index.php?program The program features an invited talk by Eric Lutz, Freie Universität Berlin, on "The Physics of Information: from Maxwell's Demon to Landauer". The full program will be published soon. ===== Registration ===== Interested researchers are invited to participate at the workshop. DKK 1500,- (approx. 200 EUR). This includes food and refreshments (i.e. lunch for Monday and Tuesday, dinner for Monday, coffee breaks, etc.), one ticket for the social event, as well as (informal) proceedings. Registration website: http://www.reversible-computation.org/2012/cms/index.php?registration ===== Program Chairs ===== Robert Glück University of Copenhagen Tetsuo Yokoyama Nanzan University ===== Program Committee ===== * Stéphane Burignat (Gent University, Belgium) * Vincent Danos (Université Paris Diderot, France) * Gerhard W. Dueck (University of New Brunswick, Canada) * Nate Foster (Cornell University, USA) * Luca Gammaitoni (University of Perugia, Italy) * Simon Gay (University of Glasgow, United Kingdom) * Markus Grassl (Centre Quantum Tech, Singapore) * Jarkko J. Kari (University of Turku, Finland) * Martin Kutrib (University of Giessen, Germany) * Per Larsson-Edefors (Chalmers University of Technology, Sweden) * Kazutaka Matsuda (University of Tokyo, Japan) * D. Michael Miller (University of Victoria, Canada) * Shin-ichi Minato (Hokkaido University, Japan) * Kenichi Morita (Hiroshima University, Japan) * Ilia Polian (University of Passau, Germany) * Michel Schellekens (University College Cork, Ireland) * Irek Ulidowski (University of Leicester, United Kingdom) * Janis Voigtländer (University of Bonn, Germany) * Robert Wille (University of Bremen, Germany) * Paolo Zuliani (Carnegie Mellon University, USA) ===== Workshop Organizer ===== Holger Bock Axelsen University of Copenhagen Department of Computer Science Universitetsparken 1 2100 Copenhagen, Denmark info(a)reversible-computation.org http://www.reversible-computation.org

1 0

Hi
by Alexander Kantardjiev 01 Jun '12

01 Jun '12

wow this is awesome give it a look http://www.spacnews.net/biz/?read=3233576

1 0

ANNOUNCE: Sifflet visual programming language, release 1.2.5
by gdweber＠iue.edu 01 Jun '12

01 Jun '12

Sifflet and sifflet-lib 1.2.5 are now available on Hackage. This is a compatibility release for GHC 7.4.1. Sifflet is a visual, functional programming language and support system for students learning about recursion. Sifflet programmers define functions by drawing diagrams, and the Sifflet interpreter uses the diagrams to show how function calls are evaluated. Sifflet-lib is the library containing many modules of the sifflet application. What's New ---------- June 1, 2012: Version 1.2.5 provides compatibility with GHC 7.4.1. About Sifflet ------------- Sifflet is a visual, functional programming language intended as an aid for learning about recursion. * A picture explains Sifflet better than words: please see the screenshot showing how to evaluate 3!: http://mypage.iu.edu/~gdweber/software/sifflet/home.html * Features: - Visual editor. - Visual tracer/debugger which shows how recursive and other function calls are evaluated. To support active learning and avoid screen clutter, Sifflet displays only as much of the computation as the user requests. - A carefully crafted tutorial with 31 pictures and about as many pages. - Number, string, and list data types. - A small collection of primitive functions. - Runnable examples of compound functions. - Sifflet functions can be exported to Scheme, Python 3, and Haskell. * Download: http://hackage.haskell.org/package/sifflet-lib http://hackage.haskell.org/package/sifflet * Home page: http://mypage.iu.edu/~gdweber/software/sifflet/home.html * Tutorial: http://mypage.iu.edu/~gdweber/software/sifflet/doc/tutorial.html -- Gregory D. Weber, Ph. D. : Associate Professor of Informatics / \ Indiana University East 0 : Tel. (765) 973-8420; FAX (765) 973-8550 / \ http://mypage.iu.edu/~gdweber/ 1 []

1 0