- Haskell - Haskell.org

ANNOUNCE: string-qq-0.0.2
by 唐鳳 30 Jun '11

30 Jun '11

Hi all, I've just released string-qq 0.0.2 to Hackage: http://hackage.haskell.org/package/string-qq The main interface is the "s" quasi-quoter: foo :: IsString a => a foo = [s| This is a multi-line string! |] It allows simple multi-line strings of any IsString type (Text, String, ByteString, etc), with no interpolation at all, except that the leading newline is trimmed and "\r\n" sequences are converted to "\n". It's compatible with both GHC6 and GHC7; for GHC6, write [$s|…|] instead of [s|…|]. Suggestions and feedback are most welcome. :-) Cheers, Audrey

9 12

Haskell Weekly News: Issue 188
by Daniel Santa Cruz 30 Jun '11

30 Jun '11

Welcome to issue 188 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of June 19 to 25, 2011. It was brought up in cafe this week that some would prefer to see full links in the text version of the mailing list as opposed to the shortened links. The reason behind using shortened links is that the newsletter becomes pretty much unreadable with long links in a plain text buffer. In an effort to accommodate both needs, I'm trying a new format for links. One that includes shorter links embedded throughout the newsletter, and the full reference at the bottom of the text. Let me know what you think! If you are reading this on a mobile device, or you would just rather see the HTML version, point your browser to: http://contemplatecode.blogspot.com/2011/06/haskell-weekly-news-issue-188.h… Announcements Alex Mason wrote in to remind us that AusHac2011 (the Australasian Haskell Hackathon) will be held on July 8-10, at UNSW in Sydney. "If you are an Australian haskell hacker, enthusiast, newbie or professional, we would love to see you there." [2] http://goo.gl/d0SXy Florent Becker announced the release of darcs 2.8 beta 1, with many new beta features. Give it a world and let the devs know how things are working! [3] http://goo.gl/rq3DM Quotes of the Week * <[~functor(a)zygohistomorphic-prepromorphism.endofunctor.org] has joined #haskell * kmc: actually, C++'s "typename" keyword is inspired by INTERCAL's "PLEASE" * Toxaris: #haskell delivers a massively multiprogrammer online functional programming (MMOFP) experience * sully: although I'm switching to haskell more and more just on practical grounds * mauke: the greek letter lambda is an imperfect approximation of the symbol \ * Cale: The trouble with sarcasm is that in order for it to really be effective, the listener has to know what the speaker knows. Otherwise, it's indistinguishable from ignorance. Top Reddit Stories * Haskell's evaluation isn't magic. Domain: netsuperbrain.com, Score: 42, Comments: 33 On Reddit: [4] http://goo.gl/jD8jM Original: [5] http://goo.gl/31pyt * Superclass equalities are now supported Domain: hackage.haskell.org, Score: 40, Comments: 16 On Reddit: [6] http://goo.gl/5PuUh Original: [7] http://goo.gl/XhrMR * Free Monads for Less (Part 1 of 3): Codensity Domain: comonad.com, Score: 35, Comments: On Reddit: [8] http://goo.gl/mqkDi Original: [9] http://goo.gl/9eWLr * Renewed LambdaCube 3D engine, Bullet bindings and Stunts example Domain: just-bottom.blogspot.com, Score: 33, Comments: 2 On Reddit: [10] http://goo.gl/UsP59 Original: [11] http://goo.gl/YR3sH * A new design for haskell.org Domain: chrisdone.com, Score: 31, Comments: 47 On Reddit: [12] http://goo.gl/044JZ Original: [13] http://goo.gl/Hvivh * Free Monads for Less (Part 2 of 3): Yoneda Domain: comonad.com, Score: 25, Comments: On Reddit: [14] http://goo.gl/K6fI9 Original: [15] http://goo.gl/bjV5f * Free Monads for Less (Part 3 of 3): Yielding IO Domain: comonad.com, Score: 24, Comments: On Reddit: [16] http://goo.gl/pKXUR Original: [17] http://goo.gl/EDxzo * Snap Framework v0.5.1 released Domain: snapframework.com, Score: 20, Comments: 2 On Reddit: [18] http://goo.gl/sKsqq Original: [19] http://goo.gl/Chk6j * Comparing FRP to RDP (Reactive Demand Programming) Domain: awelonblue.wordpress.com, Score: 19, Comments: 2 On Reddit: [20] http://goo.gl/0wEgx Original: [21] http://goo.gl/B4dYs * Haskell eDSL Tutorial - Shared expenses Domain: lpenz.org, Score: 18, Comments: 11 On Reddit: [22] http://goo.gl/6yf5j Original: [23] http://goo.gl/t14Xs Top StackOverflow Questions * How do you write data structures that are as efficient as possible in GHC? votes: 26, answers: 2 Read on SO: [24] http://goo.gl/cj18P * How does seq force functions? votes: 15, answers: 1 Read on SO: [25] http://goo.gl/f1TX8 * I/O in Haskell is Functional? votes: 14, answers: 5 Read on SO: [26] http://goo.gl/ZT0HQ * Exponentiation in Haskell votes: 12, answers: 4 Read on SO: [27] http://goo.gl/ueo1A * How to compile a resource into a binary in Haskell? votes: 12, answers: 4 Read on SO: [28] http://goo.gl/mxDPV * Haskell Heap Issues with Parameter Passing Style votes: 12, answers: 2 Read on SO: [29] http://goo.gl/b2m10 * Functor is for (a -> b) -> (f a -> f b), what is for (Category c) => c a b -> c (f a) (f b) ? votes: 12, answers: 1 Read on SO: [30] http://goo.gl/Usv7I * Better way to write the following program in Haskell votes: 12, answers: 7 Read on SO: [31] http://goo.gl/Dn7Xj About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz References 1. http://haskell.org 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18670 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/90496 4. http://www.reddit.com/r/haskell/comments/i4k3j/haskells_evaluation_isnt_mag… 5. http://netsuperbrain.com/blog/posts/haskells-evaluation-isnt-magic 6. http://www.reddit.com/r/haskell/comments/i6ftr/superclass_equalities_are_no… 7. http://hackage.haskell.org/trac/ghc/ticket/2715#comment:18 8. http://www.reddit.com/r/haskell/comments/i7sy0/free_monads_for_less_part_1_… 9. http://comonad.com/reader/2011/free-monads-for-less/ 10. http://www.reddit.com/r/haskell/comments/i6qi5/renewed_lambdacube_3d_engine… 11. http://just-bottom.blogspot.com/2011/06/renewed-lambdacube-bullet-bindings-… 12. http://www.reddit.com/r/haskell/comments/i9183/a_new_design_for_haskellorg/ 13. http://chrisdone.com/designs/haskell/ 14. http://www.reddit.com/r/haskell/comments/i7v5r/free_monads_for_less_part_2_… 15. http://comonad.com/reader/2011/free-monads-for-less-2/ 16. http://www.reddit.com/r/haskell/comments/i7vho/free_monads_for_less_part_3_… 17. http://comonad.com/reader/2011/free-monads-for-less-3/ 18. http://www.reddit.com/r/haskell/comments/i3odg/snap_framework_v051_released/ 19. http://snapframework.com/blog/2011/06/19/snap-0.5.1-released 20. http://www.reddit.com/r/haskell/comments/i4i5c/comparing_frp_to_rdp_reactiv… 21. http://awelonblue.wordpress.com/2011/05/21/comparing-frp-to-rdp/ 22. http://www.reddit.com/r/haskell/comments/i8ylw/haskell_edsl_tutorial_shared… 23. http://lpenz.org/articles/hedsl-sharedexpenses 24. http://stackoverflow.com/questions/6432284/how-do-you-write-data-structures… 25. http://stackoverflow.com/questions/6442019/how-does-seq-force-functions 26. http://stackoverflow.com/questions/6399702/i-o-in-haskell-is-functional 27. http://stackoverflow.com/questions/6400568/exponentiation-in-haskell 28. http://stackoverflow.com/questions/6402158/how-to-compile-a-resource-into-a… 29. http://stackoverflow.com/questions/6429085/haskell-heap-issues-with-paramet… 30. http://stackoverflow.com/questions/6445501/functor-is-for-a-b-f-a-f-b-what-… 31. http://stackoverflow.com/questions/6476319/better-way-to-write-the-followin…

1 0

Open Call for a Springer LNCS Volume on Resource Analysis
by Ricardo Peña 28 Jun '11

28 Jun '11

*************************************************************************** * * OPEN CALL FOR A SPRINGER LNCS VOLUME ON RESOURCE ANALYSIS * * To be evaluated in conjunction with the selected papers of the 2nd International * Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) * May 19th 2011, Madrid, SPAIN * http://dalila.sip.ucm.es/fopara11/ * *************************************************************************** Resource analysis is a live research area where people from several research communities converge. The snd Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) covering many of these aspects was held in Madrid on May 2011. See http://dalila.sip.ucm.es/fopara11/ for looking at the program and at the rest of details of this workshop. We want to open the call for selected papers of FOPARA 2011 and invite other researchers in the area to submit papers. The results must be unpublished and not submitted for publication elsewhere. We will publish a volume of the Springer series Lecture Notes in Computer science containing both kinds of selected papers. The Program Committee of the open call will be that of FOPARA 2011. Topics ------ The following list of topics is non-exhaustive: * resource static analysis for embedded or/and critical systems * logical and machine-independent characterisations of complexity classes * logics closely related to complexity classes * type systems for controlling/inferring/checking complexity * semantic methods to analyse resources, including quasi- and sup-interpretations, * practical applications of resource analysis. Submissions ----------- All contributions must be written in English, conform to the Springer LNCS series format and not exceed 16 pages. The submission page is http://www.easychair.org/conferences/?conf=fopara2011 and it can also be accessed through the official FOPARA 2011 website. It will remain open from now to September 5th. Important dates --------------- Submission deadline: September 5th, 2011 Notification to authors: October 24th, 2011 LNCS camera ready deadline: November 18th Expected volume publication: January 2012 Program Committee ----------------- . Puri Arenas (Complutense University of Madrid, ES) . David Aspinall (University of Edinburgh, UK) . David Cachera (IRISA/École normale supérieure de Cachan, FR) . Marko van Eekelen (Radboud University Nijmegen and Open University, NL) . Kevin Hammond (University of St. Andrews, UK) . Martin Hofmann (LMU, Munich, DE) . Tamás Kozsik (Eötvös Loránd University of Budapest, HU) . Hans-Wolfgang Loidl (Heriot-Watt, Edinburgh, UK) . Jean-Yves Marion (Loria, Nancy, FR) . Simone Martini (University of Bologna, IT) . Ricardo Pe~na (PC Chair) (Complutense University of Madrid, ES) . Simona Ronchi della Rocca (University of Turin, IT) . Olha Shkaravska (Radboud University, NL)

1 0

CFP PEPM12: Workshop on Partial Evaluation and Program Manipulation
by oleg＠okmij.org 28 Jun '11

28 Jun '11

ACM SIGPLAN 2012 Workshop on Partial Evaluation and Program Manipulation January 23-24, 2012. Philadelphia, Pennsylvania, USA (co-located with POPL'12) Call For Papers http://www.program-transformation.org/PEPM12 The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the broad area of principled program transformation, which spans from refactoring, partial evaluation, supercompilation, fusion and other metaprogramming to model-driven development, program analyses including termination, inductive programming, program generation and applications of machine learning and probabilistic search. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. Each technique or tool of program manipulation should have a clear, although perhaps informal, statement of desired properties, along with an argument how these properties could be achieved. Topics of interest for PEPM'12 include, but are not limited to: - Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. - Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. - Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. - Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Selected papers may later on be invited for a journal special issue dedicated to PEPM'12. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. Submission Categories and Guidelines Authors are strongly encouraged to consult the advice for authoring research papers and tool papers before submitting. The PC Chairs welcome any inquiries about the authoring advice. Regular research papers must not exceed 10 pages in ACM Proceedings style. Short papers are up to 4 pages in ACM Proceedings style. Authors of tool demonstration proposals are expected to present a live demonstration of the described tool at the workshop (tool papers should include an additional appendix of up to 6 extra pages giving the outline, screenshots, examples, etc. to indicate the content of the proposed live demo at the workshop). Important Dates - Paper submission: Mon, October 10, 2011, 23:59, GMT - Author notification: Tue, November 8, 2011 - Workshop: Mon-Tue, January 23-24, 2012 Invited Speakers TBD Program Chairs - Oleg Kiselyov (Monterey, CA, USA) - Simon Thompson (University of Kent, UK) Program Committee Members - Emilie Balland (INRIA, France) - Ewen Denney (NASA Ames Research Center, USA) - Martin Erwig (Oregon State University, USA) - Sebastian Fischer (National Institute of Informatics, Japan) - Lidia Fuentes (Universidad de Malaga, Spain) - John Gallagher (Roskilde University, Denmark and IMDEA Software, Spain) - Dave Herman (Mozilla Labs) - Stefan Holdermans (Vector Fabrics, the Netherlands) - Christian Kaestner (University of Marburg, Germany) - Emanuel Kitzelmann (International Computer Science Institute, USA) - Andrei Klimov (Keldysh Institute of Applied Mathematics, Russian Academy of Sciences) - Shin-Cheng Mu (Academia Sinica, Taiwan) - Alberto Pardo (Universidad de la Repu'blica, Uruguay) - Kostis Sagonas (Uppsala University, Sweden and National Technical University of Athens, Greece) - Anthony M. Sloane (Macquarie University, Australia) - Armando Solar-Lezama (MIT, USA) - Aaron Stump (The University of Iowa, USA) - Kohei Suenaga (University of Kyoto, Japan) - Eric Van Wyk (University of Minnesota, USA) - Kwangkeun Yi (Seoul National University, Korea)

1 0

ANNOUNCE: release v0.2 of RandProc library
by David Banas 27 Jun '11

27 Jun '11

v0.2 of the `RandProc` library has been released to HackageDB. http://hackage.haskell.org/package/randproc Changes in this release: * Improved several severe performance bottlenecks. (The `goodDie` space can now actually be checked, without exhausting memory/time.) * Cleaned up the code, as per `hlint` suggestions.

1 0

~ type operator
by Guy 24 Jun '11

24 Jun '11

What does the ~ type operator mean? I've sometimes seen types such as (a ~ b) in error messages, but can't understand what GHC is trying to tell me. Thanks for any enlightenment!

2 1

Haskell Weekly News: Issue 187
by Daniel Santa Cruz 23 Jun '11

23 Jun '11

Welcome to issue 187 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of June 12 to 18, 2011. Announcements Ian Lynagh announced a new patchlevel release of GHC (7.0.4). "This release contains a handful of bugfixes relative to 7.0.3, so we recommend upgrading." http://goo.gl/hOvdA Nicolas Wu released the third instance fo Haskell Parallel Digest. Many thanks to Nick and Eric for putting this together. http://goo.gl/s5muy Jeroen Janssen invited us to the 8th Ghent Functional Programming Group Meeting, to be held on Thursday, the 30th of June, in the Technicum building of Ghent University. http://goo.gl/G081Q Quotes of the Week * monochrom: if I were dying to learn covariance, I would not be looking for entertainment, like, I'm dying, I only have 5 minutes to learn covariance, thank you very much * hpc: the categorical dual of a hippomorphism should be a giraffomorphism * ksf: but, as, maybe indeed or not apparently, english, in, or especially in, punctuation matters is an utter mess. * 00:56:03 <benmachine> @faq can haskell tell if I am lagging [...] 00:57:18 <lambdabot> The answer is: Yes! Haskell can do that. Top Reddit Stories * Haskell: the Craft of Functional Programming, 3rd edition is out! Domain: haskellcraft.com, Score: 44, Comments: 10 On Reddit: http://goo.gl/6ZInj Original: http://goo.gl/t0GAX * GHC 7.0.4 is out Domain: haskell.org, Score: 42, Comments: 2 On Reddit: http://goo.gl/oxSJH Original: http://goo.gl/EzWUP * SafeHaskell pushed into GHC Domain: haskell.org, Score: 39, Comments: 5 On Reddit: http://goo.gl/sOrjr Original: http://goo.gl/2Rw56 * Minimum footprint for a GHC program: or, think about your TSOs Domain: stackoverflow.com, Score: 23, Comments: 0 On Reddit: http://goo.gl/eIF0o Original: http://goo.gl/dRgLG * Pieces of Yesod: Inverting a Haskell Function Domain: chplib.wordpress.com, Score: 21, Comments: 8 On Reddit: http://goo.gl/NFJNH Original: http://goo.gl/x2cz2 * The 2011 ICFP contest is starting in just 6 hours! Domain: icfpcontest.org, Score: 20, Comments: 15 On Reddit: http://goo.gl/BS7XI Original: http://goo.gl/oqj0Y * A pattern for avoiding allocation : Inside T5 Domain: blog.ezyang.com, Score: 19, Comments: 12 On Reddit: http://goo.gl/thuRP Original: http://goo.gl/IZCIh * Package of the Day: an improved runghc for fast repeated runs Domain: hackage.haskell.org, Score: 16, Comments: 9 On Reddit: http://goo.gl/k6mQK Original: http://goo.gl/a0DAC * The Supero Supercompiler Domain: community.haskell.org, Score: 16, Comments: 2 On Reddit: http://goo.gl/vBeFO Original: http://goo.gl/3QsmC * Galois Video: Building an Open-Source Autonomous Quad-Copter Domain: corp.galois.com, Score: 15, Comments: 3 On Reddit: http://goo.gl/HZghO Original: http://goo.gl/6AcMw Top StackOverflow Questions * Why does performGC fail to release all memory? votes: 17, answers: 2 Read on SO: http://goo.gl/dRgLG * OSX, ghci, dylib, what is the correct way? votes: 17, answers: 1 Read on SO: http://goo.gl/0s9Tu * Why does Haskell's `head` crash on an empty list (or why *doesn't* it return an empty list)? (Language philosophy) votes: 15, answers: 6 Read on SO: http://goo.gl/tghQR * Towards understanding CodeGen* in the Haskell LLVM bindings votes: 13, answers: 1 Read on SO: http://goo.gl/LPZ2F * What happens to you if you break the monad laws? votes: 13, answers: 3 Read on SO: http://goo.gl/Trvny * Is anyone using delimited continuations to do web development in Haskell? votes: 12, answers: 3 Read on SO: http://goo.gl/hGjuB * The concept of Bottom in Haskell votes: 12, answers: 1 Read on SO: http://goo.gl/9b1ZJ About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz

1 0

ANNOUNCE: Release of 'randproc' package v0.1
by David Banas 23 Jun '11

23 Jun '11

Announcing the release of v0.1 of 'randproc', a library for working with random processes. http://www.haskell.org/haskellwiki/Random_Processes

1 0

ANNOUNCE: hspec-0.4.3 (color output and alternate mondaic api)
by Trystan Spangler 22 Jun '11

22 Jun '11

hspec version 0.4.3, Behavior Driven Development for Haskell, is now available! Improvements include red/yellow/green color output and writing output as the tests are running. Also, you can import Test.Hspec.Monadic rather than Test.Hspec if you want to use a WriterMonad based api. http://hackage.haskell.org/package/hspec https://github.com/trystan/hspec As always, any advice, comments, or questions are welcome, Trystan Spangler For those who would like to see an example, using the new alternate monadic api, running this program: > import Test.Hspec.Monadic > import Test.Hspec.HUnit > import Test.Hspec.QuickCheck (property) > import Test.HUnit (assertBool, assertEqual) > > main = hspec specs > > specs = describe "hspec 0.4.3" $ do > it "still allows a Bool expression to act as an example" > (replicate 5 1 == [1,1,1,1,1]) > > it "still allows HUnit assertions to act as examples" > (assertBool "lame example" True) > > it "still allows QuickCheck properties to act as examples" > (property $ \ i -> (i::Int) == i + 1 - 1) > > it "still shows a list of failed examples" > (undefined :: Bool) -- expected to fail > > it "still collects better data from failed HUnit examples" > (assertEqual "this should fail" 1 2) -- expected to fail > > it "still collects better data from failed QuickCheck examples" > (property $ \ i -> (i::Int) * 2 - 2 /= i) -- expected to fail > > it "now allows a monadic api" > (pending "I'm still not sure how to test this but this example is good evidence....") > > it "now outputs in color when writing to stdout" > (pending "I'm still not sure how to test this but trust me it works....") should send this to stdout in glorious red, yellow, and green: hspec 0.4.3 - still allows a Bool expression to act as an example - still allows HUnit assertions to act as examples - still allows QuickCheck properties to act as examples x still shows a list of failed examples FAILED [1] x still collects better data from failed HUnit examples FAILED [2] x still collects better data from failed QuickCheck examples FAILED [3] - now allows a monadic api # I'm still not sure how to test this but this example is good evidence.... - now outputs in color when writing to stdout # I'm still not sure how to test this but trust me it works.... 1) hspec 0.4.3 still shows a list of failed examples FAILED Prelude.undefined 2) hspec 0.4.3 still collects better data from failed HUnit examples FAILED this should fail expected: 1 but got: 2 3) hspec 0.4.3 still collects better data from failed QuickCheck examples FAILED *** Failed! Falsifiable (after 6 tests): 2 Finished in 0.0520 seconds 8 examples, 3 failures

1 2

VSTTE 2012 : Second Call for Papers
by Gudmund Grov 22 Jun '11

22 Jun '11

VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter Müller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Supérieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Université Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter Müller, ETH Zurich Tobias Nipkow, Technische Universität München Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Université Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0