June 2012 - Haskell - Haskell.org

[ANN] GenCheck - a generalized property-based testing framework
by Jacques Carette 19 Jun '12

19 Jun '12

Test.GenCheck is a Haskell library for /generalized proposition-based testing/. It simultaneously generalizes *QuickCheck* and *SmallCheck*. Its main novel features are: * introduces a number of /testing strategies/ and /strategy combinators/ * introduces a variety of test execution methods * guarantees uniform sampling (at each rank) for the random strategy * guarantees both uniqueness and coverage of all structures for the exhaustive strategy * introduces an /extreme/ strategy for testing unbalanced structures * also introduces a /uniform/ strategy which does uniform sampling along an enumeration * allows different strategies to be mixed; for example one can exhaustively test all binary trees up to a certain size, filled with random integers. * complete separation between properties, generators, testing strategies and test execution methods The package is based on a lot of previous research in combinatorics (combinatorial enumeration of structures and the theory of Species), as well as a number of established concepts in testing (from a software engineering perspective). In other words, further to the features already implemented in this first release, the package contains an extensible, general framework for generators, test case generation and management. It can also be very easily generalized to cover many more combinatorial structures unavailable as Haskell types. The package also provides interfaces for different levels of usage. In other words, there is a 'simple' interface for dealing with straightforward testing, a 'medium' interface for those who want to explore different testing strategies, and an 'advanced' interface for access to the full power of GenCheck. See http://hackage.haskell.org/package/gencheck for further details. In the source repository (https://github.com/JacquesCarette/GenCheck) the file tutorial/reverse/TestReverseList.lhs shows the simplest kinds of tests (standard and deep for structures, or base for unstructured types) and reporting (checking, testing and full report) for the classical list reverse function. The files in tutorial/list_zipper show what can be done with the medium level interface (this tutorial is currently incomplete). The brave user can read the source code of the package for the advanced usage -- but we'll write a tutorial for this too, later. User beware: this is gencheck-0.1, there are still a few rough edges. We plan to add a Template Haskell feature to this which should make deriving enumerators automatic for version 0.2. Jacques and Gordon

2 1

Haskell Implementors' Workshop 2012, Second CFT
by Johan Tibell 19 Jun '12

19 Jun '12

Call for Talks ACM SIGPLAN Haskell Implementors' Workshop http://haskell.org/haskellwiki/HaskellImplementorsWorkshop/2012 Copenhagen, Denmark, September 14th, 2012 The workshop will be held in conjunction with ICFP 2012 http://www.icfpconference.org/icfp2012/ Important dates Proposal Deadline: 10th July 2012 Notification: 27th July 2012 Workshop: 14th September 2012 The Haskell Implementors' Workshop is to be held alongside ICFP 2012 this year in Copenhagen, Denmark. There will be no proceedings; it is an informal gathering of people involved in the design and development of Haskell implementations, tools, libraries, and supporting infrastructure. This relatively new workshop reflects the growth of the user community: there is a clear need for a well-supported tool chain for the development, distribution, deployment, and configuration of Haskell software. The aim is for this workshop to give the people involved with building the infrastructure behind this ecosystem an opportunity to bat around ideas, share experiences, and ask for feedback from fellow experts. We intend the workshop to have an informal and interactive feel, with a flexible timetable and plenty of room for ad-hoc discussion, demos, and impromptu short talks. Scope and target audience ------------------------- It is important to distinguish the Haskell Implementors' Workshop from the Haskell Symposium which is also co-located with ICFP 2012. The Haskell Symposium is for the publication of Haskell-related research. In contrast, the Haskell Implementors' Workshop will have no proceedings -- although we will aim to make talk videos, slides and presented data available with the consent of the speakers. In the Haskell Implementors' Workshop, we hope to study the underlying technology. We want to bring together anyone interested in the nitty-gritty details behind turning plain-text source code into a deployed product. Having said that, members of the wider Haskell community are more than welcome to attend the workshop -- we need your feedback to keep the Haskell ecosystem thriving. The scope covers any of the following topics. There may be some topics that people feel we've missed, so by all means submit a proposal even if it doesn't fit exactly into one of these buckets: * Compilation techniques * Language features and extensions * Type system implementation * Concurrency and parallelism: language design and implementation * Performance, optimisation and benchmarking * Virtual machines and run-time systems * Libraries and tools for development or deployment Talks ----- At this stage we would like to invite proposals from potential speakers for a relatively short talk. We are aiming for 20 minute talks with 10 minutes for questions and changeovers. We want to hear from people writing compilers, tools, or libraries, people with cool ideas for directions in which we should take the platform, proposals for new features to be implemented, and half-baked crazy ideas. Please submit a talk title and abstract of no more than 200 words to: johan.tibell(a)gmail.com We will also have a lightning talks session which will be organised on the day. These talks will be 2-10 minutes, depending on available time. Suggested topics for lightning talks are to present a single idea, a work-in-progress project, a problem to intrigue and perplex Haskell implementors, or simply to ask for feedback and collaborators. Organisers ---------- * Lennart Augustsson (Standard Chartered Bank) * Manuel M T Chakravarty (University of New South Wales) * Gregory Collins - co-chair (Google) * Simon Marlow (Microsoft Research) * David Terei (Stanford University) * Johan Tibell - co-chair (Google)

1 0

4th *OPEN* Answer Set Programming Competition 2013 - New Call for benchmarks
by Francesco Calimeri 19 Jun '12

19 Jun '12

[apologies for any cross-posting] ........................................................................ 4th OPEN Answer Set Programming Competition 2013 Call for Benchmark Problems University of Calabria - Vienna University of Technology Fall/Winter 2012/2013 http://aspcomp2013.mat.unical.it/ ........................................................................ The 4th Open Answer Set Programming Competition is open to ASP systems and *any other system* based on a declarative specification paradigm. The event is currently open and in the Call for Benchmarks stage. == Call for Benchmark Problems == Participants will compete on a selected collection of declarative specifications of benchmark problems, taken from a variety of domains as well as real world applications, and instances thereof. These include, but are not limited to: - Deductive database tasks on large data-sets - Sequential and Temporal Planning - Classic and Applicative graph problems - Puzzles and Combinatorics - Scheduling, Timetabling, and other resource allocation problems - Combinatorial Optimization Problems - Ontology reasoning - Automated Theorem Proving and Model Checking - Reasoning tasks over large propositional instances - Constraint Programming problems - Other AI problems We encourage to provide help by proposing and/or devising new challenging benchmark problems. The submission of problems arising from applications of practical impact are strongly encouraged; problems used in the former ASP Competitions, or variants thereof, can be re-submitted. Benchmark authors are expected to produce a problem specification and an instance set (or a generator thereof). The detailed benchmark problems submission procedure is available at: http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission === About the ASP Competition Series === Answer Set Programming is a well-established paradigm of declarative programming with close relationship to other declarative modelling paradigms and languages, such as SAT Modulo Theories, Constraint Handling Rules, FO(.), PDDL, CASC, and many others. Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems compare themselves in the nowadays customary ASP Competition: the 4th ASP Competition will be run jointly at the University of Calabria (Italy) and the Vienna University of Technology (Austria), in the first half of 2013. The event is the sequel to the ASP Competition series, held at the University of Potsdam (Germany) in 2006-2007, at the University of Leuven (Belgium) in 2009, and at University of Calabria (Italy) in 2011. The current competition takes place in cooperation with the 13th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013), where the results will be announced. The ASP competition is held as an open tournament. The "Model & Solve" competition track fosters the spirit of integration among communities, and is thus open to all types of solvers: ASP systems, SAT solvers, SMT solvers, CP systems, FOL theorem provers, Description Logics reasoners, planning reasoners, or any other. The "System" competition track is instead set up on a fixed language based on the answer set semantics. == Important Dates == * Problem selection stage Problem submission deadline: Aug 31th, 2012 * Competition stage "Model & Solve" submission deadline: Mar 1st, 2013 "System" submission deadline: Mar 1st, 2013 * Sep 15-19th, 2013 Announcement of results and awards at LPNMR 2013 - Corunna, Spain For further information please visit the competition web site http://aspcomp2013.mat.unical.it/ or contact us by email: aspcomp2013(a)kr.tuwien.ac.at.

1 0

Call for Papers: STVR Special Issue on Tests and Proofs
by Achim D. Brucker 19 Jun '12

19 Jun '12

Apologies for duplicates. CALL FOR PAPERS STVR Special Issue on Tests and Proofs http://lifc.univ-fcomte.fr/tap2012/stvr/ The Software Testing, Verification & Reliability (STVR) journal (http://www3.interscience.wiley.com/journal/13635/home) invites authors to submit papers to a Special Issue on Tests and Proofs. Background ========== The increasing use of software and the growing system complexity make focused software testing a challenging task. Recent years have seen an increasing industrial and academic interest in the use of static and dynamic analysis techniques together. Success has been reported combining different test techniques such as model-based testing, structural testing, or concolic testing with static techniques such as program slicing, dependencies analysis, model-checking, abstract interpretation, predicate abstraction, or verification. This special issue serves as a platform for researchers and practitioners to present theory, results, experience and advances in Tests and Proofs (TAP). Topics ====== This special issue focuses on all topics relevant to TAP. In particular, the topics of interest include, but are not limited to: * Program proving with the aid of testing techniques * New challenges in automated reasoning emerging from specificities of test generation * Verification and testing techniques combining proofs and tests * Generation of test data, oracles, or preambles by deductive techniques such as: theorem proving, model checking, symbolic execution, constraint logic programming, SAT and SMT solving * Model-based testing and verification * Automatic bug finding * Debugging of programs combining static and dynamic analysis * Transfer of concepts from testing to proving (e.g., coverage criteria) and from proving to testing * Formal frameworks for test and proof * Tool descriptions, experience reports and evaluation of test and proof * Case studies combining tests and proofs * Applying combination of test and proof techniques to new application domains such as validating security procotols or vulnerability detection of programs * The processes, techniques, and tools that support test and proof Submission Information ====================== The deadline for submissions is 17th December, 2012. Notification of decisions will be given by April 15th, 2013. All submissions must contain original unpublished work not being considered for publication elsewhere. Original extensions to conference papers - identifing clearly additional contributions - are also encouraged unless prohibited by copyright. Submissions will be refereed according to standard procedures for Software Testing, Verification and Reliability. Please submit your paper electronically using the Software Testing, Verification & Reliability manuscript submission site. Select "Special Issue Paper" and enter "Tests and Proofs" as title. Important Dates: ================ * Paper submission: December 17, 2012 * Notification: April 15, 2013 Guest Editors ============= * Achim D. Brucker, SAP Research, Germany http://www.brucker.ch/ * Wolfgang Grieskamp, Google, U.S.A. http://www.linkedin.com/in/wgrieskamp * Jacques Julliand, University of Franche-Comté, France http://lifc.univ-fcomte.fr/page_personnelle/accueil/8 -- Dr. Achim D. Brucker, SAP Research, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch

1 0

*** Early registration extended through June 25 *** CAV 2012: Call for Participation
by CAV 2012 CFP 19 Jun '12

19 Jun '12

*** Early registration extended through June 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/ *UPDATE* Hotel accommodation is filling up fast. Book your rooms soon! 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: language-objc
by John Lato 19 Jun '12

19 Jun '12

Hello, I am pleased to announce the initial release to hackage of language-objc, an objective-C AST, parser, and pretty-printer. More details and short examples are available at http://johnlato.blogspot.sg/2012/06/language-objc-released.html This package is a fork of language-c, and I am most grateful to the work of Benedikt Huber, Manuel Chakravarty, Duncan Coutts, Bertram Felgenhauer, and all other contributors; they did the bulk of the coding. Bugs and infelicities are mine. The version number is rather high for a beta release as I started from a recent language-c number. The Objective-C extensions are rather less well tested at this time. Feedback and comments are welcome. Cheers, John Lato

2 1

Re: [Haskell] ANNOUNCE: set-monad
by Dan Burton 16 Jun '12

16 Jun '12

Convenience aside, doesn't the functor instance conceptually violate some sort of law? fmap (const 1) someSet The entire shape of the set changes. fmap (g . h) = fmap g . fmap h This law wouldn't hold given the following contrived ord instance data Foo = Foo { a, b :: Int } instance Ord Foo where compare = compare `on` a Given functions h foo = foo { a = 1 } g foo = foo { a = b foo } Does this library address this? If so, how? If not, then you'd best note it in the docs. On Jun 15, 2012 6:42 PM, "George Giorgidze" <giorgidze(a)gmail.com> wrote: I would like to announce the first release of the set-monad library. On Hackage: http://hackage.haskell.org/package/set-monad The set-monad library exports the Set abstract data type and set-manipulating functions. These functions behave exactly as their namesakes from the Data.Set module of the containers library. In addition, the set-monad library extends Data.Set by providing Functor, Applicative, Alternative, Monad, and MonadPlus instances for sets. In other words, you can use the set-monad library as a drop-in replacement for the Data.Set module of the containers library and, in addition, you will also get the aforementioned instances which are not available in the containers package. It is not possible to directly implement instances for the aforementioned standard Haskell type classes for the Set data type from the containers library. This is because the key operations map and union, are constrained with Ord as follows. map :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b union :: (Ord a) => Set a -> Set a -> Set a The set-monad library provides the type class instances by wrapping the constrained Set type into a data type that has unconstrained constructors corresponding to monadic combinators. The data type constructors that represent monadic combinators are evaluated with a constrained run function. This elevates the need to use the constraints in the instance definitions (this is what prevents a direct definition). The wrapping and unwrapping happens internally in the library and does not affect its interface. For details, see the rather compact definitions of the run function and type class instances. The left identity and associativity monad laws play a crucial role in the definition of the run function. The rest of the code should be self explanatory. The technique is not new. This library was inspired by [1]. To my knowledge, the original, systematic presentation of the idea to represent monadic combinators as data is given in [2]. There is also a Haskell library that provides a generic infrastructure for the aforementioned wrapping and unwrapping [3]. The set-monad library is particularly useful for writing set-oriented code using the do and/or monad comprehension notations. For example, the following definitions now type check. s1 :: Set (Int,Int) s1 = do a <- fromList [1 .. 4] b <- fromList [1 .. 4] return (a,b) -- with -XMonadComprehensions s2 :: Set (Int,Int) s2 = [ (a,b) | (a,b) <- s1, even a, even b ] s3 :: Set Int s3 = fmap (+1) (fromList [1 .. 4]) As noted in [1], the implementation technique can be used for monadic libraries and EDSLs with restricted types (compiled EDSLs often restrict the types that they can handle). Haskell's standard monad type class can be used for restricted monad instances. There is no need to resort to GHC extensions that rebind the standard monadic combinators with the library or EDSL specific ones. [1] CSDL Blog: The home of applied functional programming at KU. Monad Reification in Haskell and the Sunroof Javascript compiler. http://www.ittc.ku.edu/csdlblog/?p=88 [2] Chuan-kai Lin. 2006. Programming monads operationally with Unimo. In Proceedings of the eleventh ACM SIGPLAN International Conference on Functional Programming (ICFP '06). ACM. [3] Heinrich Apfelmus. The operational package. http://hackage.haskell.org/package/operational _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell

2 1

FunctionalOWL: FP Usergroup in Germany, area Bielefeld
by raichoo 16 Jun '12

16 Jun '12

Announcing FunctionalOWL in Bielefeld! Next Wednesday will be the first meetup of the FunctionalOWL at Hackerspace Bielefeld. The meetup is aimed at people who are interested in functional programming. FunctionalOWL wants to provide a wide range of interesting topics and opportunities to share and acquire knowledge. Become a part of it. When: Wed 20 June @ 19:00 Where: Sudbrackstraße 42, Bielefeld Followup meetups are planned to happen every 3rd Wednesday at the same location. We have various beamers and whiteboards. Internet and caffeinated lemonade are also available. For more information and contact, check out our website. Feel free to drop a message on our pubML or in our Chatroom. www.hackerspace-bielefeld.de Kind regards, raichoo, Hackerspace Bielefeld

1 0

ANN: GHC-7.4.2-Eden - Parallel Haskell on multicore and cluster systems
by Eden - Functional parallel Programming (Mischa Dieterle) 16 Jun '12

16 Jun '12

We are happy to announce a new release of Eden, a parallel extension of Haskell. The release comprises: * The GHC-7.4.2-Eden compiler: GHC-7.4.2 extended with the Eden parallel runtime system. * The Eden modules: a library defining the Eden language constructs. * The Eden skeleton library: a comprehensive library with common task and data parallel patterns. * The Eden trace viewer EdenTV: an visualisation and analysis tool for eventlogs of parallel program runs. All resources are available via: http://www.mathematik.uni-marburg.de/~eden Eden extends Haskell with a small set of syntactic constructs for explicit process specification and creation. While providing enough control to implement parallel algorithms efficiently, it frees the programmer from the tedious task of managing low-level details by introducing automatic process handling, synchronisation and communication (via head-strict lazy lists). Eden is tailored for distributed systems but works equally well on multicore architectures. Processes work within disjoint address spaces and do not share any data. This simplifies Eden's implementation as there is no need for global garbage collection. A tutorial is available from http://www.mathematik.uni-marburg.de/~eden/paper/edenCEFP.pdf The compiler release includes binary packages for Linux and Windows, and a source distribution, available from http://www.mathematik.uni-marburg.de/~eden/?content=down_eden_7_4&navi=down Other features: - Extensions for GHC's event logging support. - Built-in serialisation of Haskell data structures (orthogonal to evaluation), see "Orthogonal Serialisation for Haskell", available from http://www.diku.dk/hjemmesider/ansatte/berthold/jbpubl.html - Optimised local communication. - Stand-alone version for multicore, using middleware MPI or PVM for clusters. Eden libraries and tools are available separately from hackage: - Eden modules: http://hackage.haskell.org/package/edenmodules (already included in the Eden compiler) - Eden skeleton library: http://hackage.haskell.org/package/edenskel - EdenTV: http://hackage.haskell.org/package/edentv (uses gtk2hs and glade) When built using a standard GHC, the packages will produce a threaded simulation of Eden.

1 0

ANNOUNCE: set-monad
by George Giorgidze 16 Jun '12

16 Jun '12

I would like to announce the first release of the set-monad library. On Hackage: http://hackage.haskell.org/package/set-monad The set-monad library exports the Set abstract data type and set-manipulating functions. These functions behave exactly as their namesakes from the Data.Set module of the containers library. In addition, the set-monad library extends Data.Set by providing Functor, Applicative, Alternative, Monad, and MonadPlus instances for sets. In other words, you can use the set-monad library as a drop-in replacement for the Data.Set module of the containers library and, in addition, you will also get the aforementioned instances which are not available in the containers package. It is not possible to directly implement instances for the aforementioned standard Haskell type classes for the Set data type from the containers library. This is because the key operations map and union, are constrained with Ord as follows. map :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b union :: (Ord a) => Set a -> Set a -> Set a The set-monad library provides the type class instances by wrapping the constrained Set type into a data type that has unconstrained constructors corresponding to monadic combinators. The data type constructors that represent monadic combinators are evaluated with a constrained run function. This elevates the need to use the constraints in the instance definitions (this is what prevents a direct definition). The wrapping and unwrapping happens internally in the library and does not affect its interface. For details, see the rather compact definitions of the run function and type class instances. The left identity and associativity monad laws play a crucial role in the definition of the run function. The rest of the code should be self explanatory. The technique is not new. This library was inspired by [1]. To my knowledge, the original, systematic presentation of the idea to represent monadic combinators as data is given in [2]. There is also a Haskell library that provides a generic infrastructure for the aforementioned wrapping and unwrapping [3]. The set-monad library is particularly useful for writing set-oriented code using the do and/or monad comprehension notations. For example, the following definitions now type check. s1 :: Set (Int,Int) s1 = do a <- fromList [1 .. 4] b <- fromList [1 .. 4] return (a,b) -- with -XMonadComprehensions s2 :: Set (Int,Int) s2 = [ (a,b) | (a,b) <- s1, even a, even b ] s3 :: Set Int s3 = fmap (+1) (fromList [1 .. 4]) As noted in [1], the implementation technique can be used for monadic libraries and EDSLs with restricted types (compiled EDSLs often restrict the types that they can handle). Haskell's standard monad type class can be used for restricted monad instances. There is no need to resort to GHC extensions that rebind the standard monadic combinators with the library or EDSL specific ones. [1] CSDL Blog: The home of applied functional programming at KU. Monad Reification in Haskell and the Sunroof Javascript compiler. http://www.ittc.ku.edu/csdlblog/?p=88 [2] Chuan-kai Lin. 2006. Programming monads operationally with Unimo. In Proceedings of the eleventh ACM SIGPLAN International Conference on Functional Programming (ICFP '06). ACM. [3] Heinrich Apfelmus. The operational package. http://hackage.haskell.org/package/operational

1 0