- Haskell - Haskell.org

ANN: ListLike-3.1.0
by John Lato 22 Mar '11

22 Mar '11

Hello, I am pleased to announce an incremental update to the ListLike package, version 3.1.0. This version adds newtype wrappers for strict and lazy ByteStrings, CharString and CharStringLazy, as well as instances of the form: instance ListLike CharString Char where ... These instances allow access to Data.ByteString.Char8 functions via the ListLike interface. Most importantly, you can now use uu-parsinglib to parse ASCII-based bytestrings via the newtype wrapper, as in: parseByteString bytestring charParser = parse charParser $ createStr (LineColPos 0 0 0) (CS bs) Thanks to S Doaitse Swierstra for making this possible via the excellent uu-parsinglib library. John L.

1 0

The deadlines for paper submission have been extended (TASE 2011)
by Huibiao Zhu 22 Mar '11

22 Mar '11

**************************************************************************** ********* TASE 2011 5th IEEE International Conference on Theoretical Aspects of Software Engineering *** Call For Papers *** August 29-31, 2011 Xi'an, China http://ictt.xidian.edu.cn/TASE2011/ The deadlines for paper submission have been extended. Abstract Submission: 1 April, 2011 (New) Full-paper submission: 8 April, 2011 (New) **************************************************************************** ********* The 5th IEEE International Conference on Theoretical Aspects of Software Engineering (TASE 2011), sponsored by IEEE CS and IFIP, will be held in Xi'an, China in August, 2011. Large scale software systems and the Internet are of growing concern to academia and industry. This poses new challenges to the various aspects of software engineering, for instance, the reliability of software development, web-oriented software architecture and aspect and object-orientation techniques. As a result, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2011 is a forum for researchers from academia, industry and government to present ideas, results, and ongoing research on theoretical advances in software engineering. TASE 2011 is the fifth in a series of conference, sponsored by IEEE CS and IFIP. The first TASE conference was held in Shanghai, China, in June 2007. The second TASE conference was held in Nanjing, China, in June 2008. The third TASE conference was held in Tianjin, China, in June 2009, and the fourth TASE conference was held in Taipei, China, in October 2010. TASE 2011 will be held in Xi'an, China. Xi'an, the eternal city, records the great changes of the Chinese nation just like a living history book. So far, Xian enjoys equal frame with Athens, Cairo, and Rome as one of the four major ancient civilization capitals. It has many places of interest, such as Terra-cotta Warriors and Horses, City Wall, Bell Tower, Big Wild Goose Pagoda and so on. International Horticultural Exposition will be held in Xi'an in 2011. Topics of Interest Authors are invited to submit high quality technical papers describing original and unpublished work in all theoretical aspects of software engineering. Topics of interest include, but are not limited to: * Requirements Engineering * Embedded and Real-Time Systems * Program Analysis * Software Architectures and Design * Component-Based Software Engineeringg * Reverse Engineering and Software Maintenance * Aspect and Object Orientation * Type System and Theory * Dependable Concurrency * Automata and Temporal/Modal Logic * Petri Nets * Domain Theory * Type Theory * Process Algebra and Concurrency * Specification and Verification * Software Testing * Model-Driven Engineering * Software Processes and Workflows * Software Safety, Security and Reliability * Service-Oriented Computing * Semantic Web and Web Services * Program Logics and Calculus * Software Model Checking * Probability and Randomization * Game Theory * Theorem Proving * Static Analysis and Model Checking * Testing, Simulation and other Dynamic Analyses Submission Submission should be done through the TASE 2011 submission page, handled by the EasyChair conference system. The authors are requested to submit the abstract (100-300 words) by 1 April, 2011 (New), and the paper (up to 8 pages) by 8 April, 2011 (New). To do submission, visit EasyChair and register as a new member. A password will be sent by e-mail shortly. Using that password, log-in and proceed to the New Submission page, where the detailed instructions can be found. When submitting the abstract, tick the "Abstract Only" box nearly at the end of the page. After submission, the authors can update abstracts and papers as well as the authors' information using the EasyChair system until the deadline. The proceedings of the conference will be published by the IEEE Computer Society Press. Papers must be written in English and not exceed 8 pages in Two-Column IEEE format. Authors should use the IEEE latex style files for the two-column proceedings format. The style files and instructions for using them is at http://www.ctan.org/tex-archive/macros/latex/contrib/IEEEtran/. (The file bare_conf.tex at http://www.ctan.org/tex-archive/macros/latex/contrib/IEEEtran/ may be used as a template). Submissions not accepted to the proceedings may be considered for poster presentation. Important Dates 1 April, 2011: Title and abstract submission deadline (New) 8 April, 2011: Paper submission deadline (New) 6 May, 2011: Acceptance/rejection notification (New) May 16, 2011: Final version due August 29 - 31, 2011: TASE 2011 Co-Chairs Luke Ong (Oxford University, UK) Zhenhua Duan (Xidian University, China)

1 0

CUFP 2011: call for presentations
by Anil Madhavapeddy 22 Mar '11

22 Mar '11

Commercial Users of Functional Programming Workshop (CUFP) 2011 Call for Presentations Sponsored by SIGPLAN Co-located with ICFP 2011 Tokyo, Japan Sep 22-24 Proposal Submission Deadline: 15 June 2011 Functional programming languages have been a hot topic of academic research for over 35 years, and they have seen an ever larger practical impact in settings ranging from tech startups to financial firms to biomedical research labs. At the same time, a vigorous community of programmers employing functional languages has come into existence. CUFP is designed to serve this community. The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. # Giving a CUFP Talk If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: *Experience reports* are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. *Technical talks* are also 25 minutes long, and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to avsm2(at)cl(dot)cam(dot)ac(dot)uk or yminsky(at)janestreet(dot)com by 15 June 2011 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! # Program Committee * Anil Madhavapeddy (University of Cambridge) * Yaron Minsky (Jane Street) * Jun Furuse (Standard Chartered) * Marius Eriksen (Twitter Inc.) * Michael Williams (Ericsson) * Mike McClurg (Citrix Systems R&D) * R. Kent Dybvig (Indiana University) * Richard Minerich (Bayard Rock) * Sally Browning (Galois) * Shankar Natarajan (SRI Inc.) # Tutorials and BOFs * Michael Sperber (DeinProgramm) * Duncan Coutts (Well Typed Inc.) * Ashish Agarwal (NYU) More information For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org and this call for papers at http://cufp.org/2011-call-presentations Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 15th.

1 0

A opportunity to lern (parsing huge binary file)
by Skeptic . 19 Mar '11

19 Mar '11

Hi, I finally have an opportunity to learn Haskell (I'm a day-to-day Java programmer, but I'm also at ease with Scheme), parsing a huge (i.e. up to 50 go) binary file. The encoding is very stable, but it's not a flat struct array (i.e. it uses flags). Different outputs (i.e. text files) will be needed, some unknown at this time. Sounds to me a perfect "real-world" task to see what Haskell can offer. Any suggestions at how to structure the code or on which packages to look at is welcome. Thanks.

7 6

ANNOUNCE: Sifflet visual programming language, release 1.2.4
by gdweber＠iue.edu 19 Mar '11

19 Mar '11

Sifflet and sifflet-lib 1.2.4 are now available on Hackage. This is a compatibility release for HXT >= 9.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 ---------- March 18, 2011: Vesion 1.2.4 provides compatibility with HXT >= 9.1. February 18, 2011: Version 1.2.3 provides compatibility with GHC 7 (remaining backward-compatible with GHC 6.12.3) and Haskell Platform 2011.2. 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, Associate Professor / /_\// / | | | /\ | | Indiana University East / /_\\/ /__| | |/ \| | http://mypage.iu.edu/~gdweber/ \____/\_____/\___/\__/ Tel. (765) 973-8420; FAX (765) 973-8550

1 0

SLE 2011 - Final Call for Papers
by João Fernandes 18 Mar '11

18 Mar '11

============================================================ FINAL CALL FOR PAPERS SLE 2011 4th International Conference on Software Language Engineering Braga, Portugal, 3-6 July 2011 http://planet-sl.org/sle2011/ Co-located with the 4th Summer School on Generative and Transformational Techniques in Software Engineering (GTTSE 2011) ============================================================= IMPORTANT DATES * 2011: Paper submission: April 08 (midnight Apia Samoa time) Author notification: May 13 Paper submission for online proceedings: June 17 Conference: July 03-06 Camera-ready copy submission for post-proceedings: August 29 --------------------------------------------------------- Software language engineering is devoted to topics related to artificial languages in software engineering. The foremost mission of the International Conference on Software Language Engineering (SLE) is to encourage and organize communication between communities that traditionally have looked at soft- ware languages from different, more specialized, and yet complementary perspectives. Thus, technologies, methods, experiments and case studies from modelware, grammarware, and ontologyware serving the objectives of software languages are of particular relevance to SLE. We invite high-quality submissions to all conference tracks. Submissions must be PDF files following the Springer LNCS style and will be managed using the EasyChair submission system. Please check the conference web site for further information. SLE 2011 will include a Doctoral Symposium that will provide a supportive yet questioning setting in which PhD students can present their work, including goals, methods, and preliminary results. The Symposium aims to provide students with useful guidance and feedback on various aspects of their research from established researchers and the other student attendees. Please forward this call to anyone who might be interested. http://planet-sl.org/sle2011/ --------------------------------------------------------- INVITED SPEAKERS SLE 2011 is proud to announce the following invited speakers. Krzysztof Czarnecki is associate professor at the University of Waterloo and industrial research chair at Bank of Nova Scotia / NSERC. Before coming to Waterloo, he spent eight years at DaimlerChrysler Research working on the practical applications of generative programming. His current work focuses on realizing the synergies between generative and model-driven software development. Paul Klint is head of the software engineering department at Centrum Wiskunde en Informatica in Amsterdam, full professor in Computer Science at the University of Amsterdam and theme leader of Software Analysis and Transformation at CWI. His research interests include generic language technology, domain-specific languages, software renovation, and technology transfer. --------------------------------------------------------- PAPER SUBMISSION Submitted papers must be original work and must not be previously published in, currently submitted to, or currently in consideration for any journal, book, conference, or workshop. Each submitted paper will be reviewed closely by at least three members of the program committee. Accepted papers will be distributed at the conference via the online proceedings as well as published in the post-proceedings, which will appear in the Springer Lecture Notes in Computer Science (LNCS) series. Authors will have the opportunity to revise their accepted paper(s) for the pre- and post- proceedings. For an accepted paper to appear in the proceedings, at least one author must attend the event and present the work. --------------------------------------------------------- RESEARCH PAPERS Research papers should report a substantial research contribution to SLE and/or a successful application of SLE techniques. We solicit high-quality contributions in the area of SLE ranging from theoretical and conceptual contributions to tools, techniques, and frameworks that support the aforementioned lifecycle activities. We list examples of tools, techniques, applications, and problems of interest to clarify the types of contributes that we seek: * Formalisms used in designing and specifying languages and tools that analyze such language descriptions * Language implementation techniques * Program and model transformation tools * Composition, integration, and mapping tools for managing different aspects of software languages or different manifestations of a given language * Transformations and transformation languages between languages and models * Language evolution * Approaches to elicitation, specification, or verification of requirements for software languages * Language development frameworks, methodologies, techniques, best practices, and tools for the broader language lifecycle covering phases such as analysis, testing , and documentation. * Design challenges in SLE * Applications of languages including innovative domain-specific languages or "little" languages The preceding list is neither exclusive nor exhaustive. Visit the conference web site for more information about the scope and topics of interest of SLE, or contact the program co-chairs with questions. Page limit: 20 --------------------------------------------------------- SHORT PAPERS Short papers may describe interesting or thought-provoking concepts that are not yet fully developed or evaluated, make an initial contribution to challenging research issues in SLE, or discuss and analyze controversial issues in the field. Page limit: 10 --------------------------------------------------------- TOOL DEMONSTRATION PAPERS Because of SLE's ample interest in tools, we seek papers that present software tools related to the field of SLE. These papers will accompany a tool demonstration to be given at the conference. The selection criteria include the originality of the tool, its innovative aspects, the relevance of the tool to SLE, and the maturity of the tool. Submissions may also include an appendix (that will not be published) containing additional screen-shots and discussion of the proposed demonstration. Page limit: 10 --------------------------------------------------------- MINI-TUTORIAL PAPERS SLE is composed of various research areas, such as grammarware, modelware, language schemas, and semantic technologies. The cross product of attendees at SLE creates a situation where the contribution from one session may be difficult to understand by those not initiated to the area. To help unite the various communities of SLE 2011, we solicit mini-tutorials that provide discussion points for mapping common ideas between related and complementary research topics of SLE. A mini-tutorial submission should be between 15 and 20 pages. --------------------------------------------------------- DOCTORAL SYMPOSIUM The Doctoral Symposium provides a forum for both early and late-stage PhD students to present their research and get detailed feedback and advice from researchers both in and out of their particular research area. Submissions are invited from PhD students working on any topic that falls within the SLE conference remit. Submissions consist of two parts, a research abstract and a letter of recommendation from the student's supervisor. See the upcoming Doctoral Symposium call for submissions for full details. Participants will also be invited to present a poster on their research as part of the conference poster session. ------------------------------------------------------------ GENERAL CHAIR João Saraiva Universidade do Minho, Portugal jas(a)di.uminho.pt PROGRAM CO-CHAIRS Uwe Aßmann Dresden University of Technology, Germany uwe.assmann(a)tu-dresden.de Anthony Sloane Macquarie University, Australia anthony.sloane(a)mq.edu.au DOCTORAL SYMPOSIUM CHAIRS Perdita Stevens University of Edinburgh, UK perdita.stevens(a)ed.ac.uk Eric Van Wyk University of Minnesota, USA evw(a)cs.umn.edu PROGRAM COMITTEE Adrian Johnstone, University of London, UK Aldo Gangemi, Semantic Technology Laboratory, Italy Alexander Serebrenik, Eindhoven University of Technology, Netherlands Ana Moreira, FCT/UNL, Portugal Anthony Cleve, University of Namur, Belgium Anya Helene Bagge, University of Bergen, Norway Bernhard Rumpe, Aachen University, Germany Bijan Parsia, University of Manchester, UK Brian Malloy, Clemson University, USA Bruno Oliveira, Seoul National University, Korea Chiara Ghidini, FBK-irst, Italy Daniel Oberle, SAP Research, Germany Eelco Visser, Delft University of Technology, Netherlands Eric Van Wyk, University of Minnesota, USA Fernando Pereira, Federal University of Minas Gerais, Brasil Fernando Silva Parreiras, University of Koblenz-Landau, Germany Friedrich Steimann, University of Hannover, Germany Görel Hedin, Lund University, USA Ivan Kurtev, University of Twente, Netherlands James Power, National University of Ireland, Ireland Jean-Marie Favre, OneTree Technologies, France Jeff Gray, University of Alabama, USA Jeff Z. Pan, University of Aberdeen, UK João Paulo Fernandes, Univ. of Minho& Univ. of Porto, Portugal John Boyland, University of Wisconsin-Milwaukee, USA John Grundy, Swinburne University of Technology, Australia Jordi Cabot, École des Mines de Nantes, France Jurgen Vinju, CWI, Netherlands Laurence Tratt, Middlesex University, UK Marjan Mernik, University of Maribor, Slovenia Mark van den Brand, Eindhoven University of Technology, Netherlands Michael Collard, University of Akron, USA Nicholas Kraft, University of Alabama, USA Paul Klint, CWI, Netherlands Paulo Borba, Federal University of Pernambuco, Brazil Peter Haase, University of Karlsruhe, Germany Peter Mosses, Swansea University, UK Ralf Möller, Hamburg University of Technology, Germany Silvana Castano, University of Milan, Italy Steffen Zschaler, Lancaster University, UK York Sure, University of Koblenz-Landau, Germany Zhenjiang Hu, National Institute of Informatics, Japan ORGANIZATION COMMITTEE José Creissac Campos (Finance Chair) Universidade do Minho, Portugal João Paulo Fernandes (Web and Publicity co-Chair) Universidade do Porto& Universidade do Minho, Portugal Jurgen Vinju (Workshop Selection Chair) CWI, The Netherlands Vadim Zaytsev (Publicity co-Chair) CWI, The Netherlands

1 0

PhD position in Communicating Transactions at Trinity College Dublin
by Edsko de Vries 18 Mar '11

18 Mar '11

Language Support for Communicating Transactions A three year PhD position, to start in September 2011, is now available at Trinity College Dublin, Ireland, associated with the project "Language Support for Communicating Transactions" funded by the Microsoft Research PhD Scholarship scheme. Three years fees will be paid at the EU rate and there will be a stipend at the standard HEA rate. The position is based in the Department of Computer Science at Trinity College, co-supervised by Matthew Hennessy at Trinity and Andrew Gordon and Nick Benton at Microsoft Research, Cambridge England. The goal of the project is to develop abstract models and programming support for "communicating transactions" a novel language construct obtained by dropping the standard isolation requirement from traditional transactions. As a result independent transactions can interfere, or communicate, with each other, which leads to complex interdependences in the event of failure. The goal of the project is to construct abstract models for their behaviour and to develop efficient programming language support for these models. Specifically the project will extend concurrent Haskell with a construct for communicating transactions, study the formal semantics of the extended language, investigate efficient implementation strategies, and develop useful programming idioms and verification techniques. Candidates are expected to have a first-class degree in Computer Science. The project will involve language implementation, the elaboration of formal semantics, and the development of verification techniques. Consequently the successful candidate will have a broad range of skills. These should include language implementation skills, a good knowledge of formal techniques for the specification of language semantics; experience with logic based verification techniques is also desirable. Informal preliminary enquiries may be made to Matthew Hennessy at Trinity College.

1 0

CFP: SOS 2011
by Keiko Nakata 18 Mar '11

18 Mar '11

[Please consider submitting your papers to SOS 2011. --- Keiko] ********************************************************** SOS `11 - Structural Operational Semantics 2011 An Affiliated Workshop of CONCUR 2011 September 5, 2011, Aachen, Germany http://sos2011.ecs.soton.ac.uk/ ********************************************************** CALL FOR PAPERS ********************************************************** Submission of abstract: Friday 27th May 2011 Submission: Friday 3rd June 2011 ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - category theoretic approaches - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome - semantics for domain-specific languages and model-based engineering. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair (http://www.easychair.org/conferences/?conf=sos2011) by Wednesday, 3rd June 2011. Papers should take the form of a pdf file in EPTCS format (http://www.eptcs.org/) whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speaker --------------- Wan Fokkink (Vrije Universiteit Amsterdam, NL, joint with EXPRESS `11) Program Committee ----------------- Luca Aceto (Reykjavik, IS) Simon Bliudze (CEA LIST, FR) Filippo Bonchi (ENS Lyon & CNRS, FR) Fabio Gadducci (Pisa, IT) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL) Keiko Nakata (Talinn, EE) Michel Reniers (Eindhoven, NL, co-chair) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Daniele Varacca (Paris 7, FR) Important Dates --------------- Submission of abstract: Friday 27 May 2011 Submission: Friday 3 June 2011 Notification: Friday 1 July 2011 Final version: Friday 15 July 2011 Workshop: Monday 5 September 2011

1 0

CFP: SOS 2011
by Keiko Nakata 18 Mar '11

18 Mar '11

[Please consider submitting your papers to SOS 2011. --- Keiko] ********************************************************** SOS `11 - Structural Operational Semantics 2011 An Affiliated Workshop of CONCUR 2011 September 5, 2011, Aachen, Germany http://sos2011.ecs.soton.ac.uk/ ********************************************************** CALL FOR PAPERS ********************************************************** Submission of abstract: Friday 27th May 2011 Submission: Friday 3rd June 2011 ********************************************************** Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. It is also a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Moreover, it has found application in emerging areas of computing such as probabilistic systems and systems biology. Structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the series of SOS workshops is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Specific topics of interest include (but are not limited to): - programming languages, process algebras and higher-order formalisms - foundations of SOS - category theoretic approaches - conservative extensions and translations of SOS specifications - congruence results and their meta-theory - modal logics, program logics and SOS - ordered, modular, and other variants of SOS - SOS of probabilistic, timed, stochastic and hybrid systems - SOS and rewriting systems, reactive systems and other forms of operational specification - comparisons between denotational, axiomatic and structural operational semantics - software tools that automate, or are based on, SOS. Reports on applications of SOS to other fields, including: - modelling and analysis of biological systems, - security of computer systems, - programming, modelling and analysis of embedded systems, - specification of middle-ware and coordination languages, - programming language semantics and implementation, - static analysis, - software and hardware verification, are also most welcome - semantics for domain-specific languages and model-based engineering. Paper submission ---------------- We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors should submit a paper via Easychair (http://www.easychair.org/conferences/?conf=sos2011) by Wednesday, 3rd June 2011. Papers should take the form of a pdf file in EPTCS format (http://www.eptcs.org/) whose length should not exceed 15 pages (not including an optional "Appendix for referees" containing proofs that will not be included in the final paper). We will also consider 5-page papers describing tools to be demonstrated at the workshop. Proceedings ----------- Preliminary proceedings will be available at the meeting. The final proceedings of the workshop will appear as a volume in the EPTCS series. If the quality and quantity of the submissions warrant it, the co-chairs plan to arrange a special issue of an archival journal devoted to full versions of selected papers from the workshop. Invited speaker --------------- Wan Fokkink (Vrije Universiteit Amsterdam, NL, joint with EXPRESS `11) Program Committee ----------------- Luca Aceto (Reykjavik, IS) Simon Bliudze (CEA LIST, FR) Filippo Bonchi (ENS Lyon & CNRS, FR) Fabio Gadducci (Pisa, IT) Matthew Hennessy (Dublin, IE) Bartek Klin (Warsaw, PL) Keiko Nakata (Talinn, EE) Michel Reniers (Eindhoven, NL, co-chair) Pawel Sobocinski (Southampton, UK, co-chair) Sam Staton (Cambridge, UK) Daniele Varacca (Paris 7, FR) Important Dates --------------- Submission of abstract: Friday 27 May 2011 Submission: Friday 3 June 2011 Notification: Friday 1 July 2011 Final version: Friday 15 July 2011 Workshop: Monday 5 September 2011

1 0

Summer School in Software Engineering and Verification 2011 - Call For Participation
by Andrei Sabelfeld 17 Mar '11

17 Mar '11

Call for participation Summer School in Software Engineering and Verification will take place outside of Moscow, Russia, on July 17–27, 2011. The school is co-sponsored by Microsoft Research and is organized in cooperation with the Higher School of Economics (HSE) in Moscow. Courses The school will consist of a number of courses from international leaders in their field, including: * Tony Hoare, Microsoft Research, UK foundations of program verification * Andrei Voronkov, University of Manchester, UK automation of proof and disproof * Patrice Godefroid, Microsoft Research, US software model checking and automatic test case generation * Yannis Smaragdakis, University of Massachusetts, Amherst, US static analysis and bug detection * Stephan Tobies, Microsoft, Germany verification of concurrent C programs and operating systems * Natasha Sharygina, University of Lugano, Switzerland model checking * Ben Livshits, Microsoft Research, US program analysis and its applications School Goals The aim of the school is to attract promising graduate students and young scientists, and to encourage and prepare them for research in software engineering, verification, and program analysis. The students will be exposed to a combination of classical results as well as leading-edge research. To encourage research participation, the students will be required to complete a project as part of the school. We also want to provide a stimulating environment for students to meet and establish ties with each other, local faculty members and industry researchers, as well as school lecturers, who are among the top scientists in their area. Primary participants We are primarily targeting students from Russia as well as countries in Scandinavia and Eastern Europe. For more information about the school and to register for the school, please consult: http://research.microsoft.com/en-us/um/redmond/events/sssev2011/ We strongly encourage people interested in participating to register as soon as possible.

1 0