August 2005 - Haskell

ACM SAC 2006 CFP: Software Verification Track
by Lunjin Lu 17 Aug '05

17 Aug '05

------------------------------------------------------------------------ -------- CALL FOR PAPERS Software Verification Track ACM Symposium on Applied Computing April 23-27, 2006, Dijon, France http://www.cs.wmich.edu/~zijiang/sac2006/ ------------------------------------------------------------------------ -------- 1. SAC 2006 For the last twenty years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers, software engineers, and application developers from around the world. SAC 2006 is sponsored by the ACM Special Interest Group on Applied Computing, and is hosted this year by Bourgogne University, Dijon, France. 2. Technical track on software verification In the next decade the software industry will have to face its responsibility imposed by a computer-dependent society. Since software is increasing deployed in safety critical applications, correctness and reliability are becoming issues of utmost importance. Consequently, software verification will be a grand challenge for both academic world and computer industry. The track will focus on theoretical foundations, practical methods as well as case studies for verification of conventional and embedded software. We welcome papers that describe work on combinations of formal verification and program analysis techniques. Tool papers and case studies which report on advances in verifying large software systems are particularly sought. The list of topics includes but not limited to . Tools, and case studies for large scale software verification . Static analysis/Abstract interpretation for verification . Model checking and deductive techniques for software verification . Role of declarative programming languages (such as Prolog) for infinite state software verification. . Proof techniques for verifying specific classes of software . Integration of testing and run-time monitoring with formal techniques . Validation of UML diagrams, and/or�requirement specifications . Software certification and proof carrying code . Integration of formal verification into software development projects 3. Guidelines for paper submission Each paper must not exceed 4,000 words and should not be more than 15 pages long using 11 point font and 1 inch margins on all four sides on letter size paper. Papers that fail to comply with length limitations risk rejection. Each submitted paper will be fully referenced and undergo a blind review process. Author(s)�must not be identified in the submissions, either explicitly or by implication. Before submitting paper,�author(s) should submit a separate cover page that includes title, abstract, list of keywords, and list of authors with full names and postal addresses, telephone numbers, fax numbers, and e-mail addresses. One of the authors must be designated as the primary contact person. Please upload the cover page via http://milo.cs.iupui.edu/sac2006/SubmitAbstract.aspx?TrackID=62. A confirmation email with further instructions on paper submission will be sent to the contact author. Please contact track chairs or Jeff Allen (jallen(a)cs.iupui.edu) for any problems with submission. Authors of accepted papers must submit an editorial revision of their papers that must fit within five two-column pages following the ACM proceedings format (an extra three extra pages may be available at additional cost to the authors). At least one of the authors of an�a ccepted paper must register for the conference and present the paper. Accepted papers will be published in the ACM SAC 2006 proceedings. 4. Important dates . Electronic submission of full papers: September 3, 2005 . Notification of paper acceptance: October 15, 2005 . Camera-ready copy of accepted paper due: November 5, 2005 5. Program Committee . Franjo Ivancic, NEC Labs America, Inc, U.S.A. . Radu Grosu, SUNY-Stony Brook, U.S.A. . Francesco Logozzo, Ecole Polytechnique, France . Lunjin Lu(Co-Chair), Oakland University, U.S.A. . Madhusudan Parthasarathy, UIUC, U.S.A. . Robby, Kansas State University, U.S.A. . Abhik Roychoudhury, National Univ. Singapore . Fausto Spoto, Univ. di Verona, Italy . Frank Stomp, Wayne State University ,U.S.A. . Zijiang Yang(Co-Chair), Western Michigan University, U.S.A. . Tian Zhao, University of Wisconsin-Milwaukee, U.S.A

1 0

ICTCS'05 Call for Participation
by g. michele pinna 17 Aug '05

17 Aug '05

***** apologies for multiple copies ***** Ninth Italian Conference on Theoretical Computer Science (ICTCS'05) Certosa di Pontignano (Siena), Italy October 12 - 14, 2005 http://ictcs05.dsmi.unisi.it Call for Participation The Ninth Italian Conference on Theoretical Computer Science will take place at the Certosa di Pontignano (Siena), Italy. There will be three invited speakers: Luca Cardelli (Microsoft Research, Cambridge, United Kingdom) Giuseppe Castagna (LIENS - École Normale Supérieure, Paris, France) Nicola Santoro (School of Computer Science, Carleton University, Ottawa, Canada) Program Committee: Michele Bugliesi (Venezia), Mario Coppo (Torino, Co-Chair), Pierluigi Crescenzi (Firenze), Giulia Galbiati (Pavia) Luisa Gargano (Salerno), Giorgio Ghelli (Pisa), Roberto Grossi (Pisa), Benedetto Intrigila (L'Aquila), Nicola Leone (Cosenza), Elena Lodi (Siena, Co-Chair), Flaminia Luccio (Trieste), Andrea Masini (Verona), Giancarlo Mauri (Milano), Corrado Priami (Trento), Geppino Pucci (Padova), Davide Sangiorgi (Bologna). Preliminary program: Wednesday, October 12: 08,45 - 09,00 Welcome 09,00 - 10,00 L. Cardelli: Biological System as Reactive Systems 10,00 - 11,00 B. DasGupta, S. Ferrarini, U. Gopalakrishnan, N. Paryani: Inapproximability Results for the Lateral Gene Transfer Problem S. Mantaci, A. Restivo, G. Rosone, M. Sciortino: A new combinatorial approach to sequence comparison 11,00 - 11,20 coffee break 11,20 - 13,20 M. Bartoletti, P. Degano, G. L. Ferrari: Checking Risky Events is Enough for Local Policy B. Aziz, D. Gray, G. Hamilton: A Static Analsis of PKI-Based Systems R. Medel, A. Campagnoni, E. Bonelli: A Typed Assembly Language for Non-interference L. Bettini, V. Bono, S. Likavec: Safe Object Composition in the Presence of Subtyping 13,20 - 15,00 Lunch 15,00 - 17,00 L. A. Hemaspaandra, J. Rothe, A. Saxena: Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory J. Fiala, J. Kratochvil: On the computational complexity of the L(2,1)-labeling problem for regular graphs B. Escoffier, J. Monnot, V. T. Paschos: Weighted coloring: further complexity and approximability results V. Raman, S. Saurabh, S. Sikdar: Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems 17,00 - 17,20 coffee break 17,20 - 19,20 S. van Bakel, U. de' Liguoro: Subtyping Object and Recursive Types Logically J. Schwinghammer: A Typed Semantics of Higher Order Store and Subtyping W. Jamroga, J. Dix: Model Checking Strategic Abilities of Agents under Incomplete Information S. Heymans, D. Van Nieuwenborgh, D. Vermeir: Synthesis from Temporal Specifications using Preferred Answer Set Programming 20,00 - Dinner Thursday, October 13: 09,00 - 10,00 N. Santoro: Mobile Agents Computing: Security Issues and Algorithmic Solutions 10,00 - 11,00 T. Kuboyama, K. Shin, T. Miyahara, H. Yasuda: A Theoretical Analysis of Alignment and Edit Problems for Trees L. Anderegg, M. Cieliebak, G. Prencipe: Efficient Algorithms for Detecting Regular Point Configurations 11,00 - 11,20 coffee break 11,20 - 13,20 R. Statman: Two Variables are Not Enough S. van Bakel, S. Lengrand, P. Lescanne: The language X: Circuits, Computations and Classical Logic C. Bertolissi: The Graph Rewriting Calculus: confluence and Expressiveness N. Busi, G. Zavattaro: Reachability Analysis in Boxed Ambients 13,20 - 15,00 Lunch 15,15 - 17,15 G. De Marco, M. Pellegrini, G. Sburlati: Faster Deterministic Wakeup in Multiple Access Channels M-C. Costa, F. Jarray, C. Picoleau: Reconstructing an alternate periodical binary matrix from its orthogonal projections S. Fung, F. Chin, C. K. Poon: Laxity helps in broadcast scheduling Y. Asahiro, E. Miyano, S. Shimoirisa: Pickup and Delivery for Moving Objects on Broken Lines 17,30 - Excursion to Siena 18,00 - 20,00 EATCS Italian Chapter Annual Meeting (at the Dipartimento di Scienze Matematiche e Informatiche "R. Magari" 20,30 - Social dinner Friday, October 14: 09,00 - 10,00 G. Castagna: Semantic Subtyping: challenges, perspectives and open problems 10,00 - 11,00 G. Castagna, D. Colazzo, A. Frish: Error Mining for Regular Expressions Patterns M. Macchetti, M. Caironi, L. Breveglieri, A. Cherubini: A Complete Formulation of Generalized Affine Equivalence 11,00 - 11,30 coffee break 11,30 - 13,00 T. Kopelowitz, E. Porat: Improved Algorithms for Polynomial Time-Decay and Time-Decay with Additive error S. Fenner, Y. Zhan: Quantum Algorithms for a Set of Group Theoretic Problems G. Franco: A polymerase based algorithm for SAT 13,00 - 13,20 End of the Conference 13,20 Lunch Registration Register online until September 10 and receive an early registration discount. The registration form is available at http://ictcs05.dsmi.unisi.it/registration.html Further informations are available at the conference web pages or can be obtained writing to ictcs05(a)unisi.it

1 0

Haskell Weekly News: August 16, 2005
by John Goerzen 16 Aug '05

16 Aug '05

Haskell Weekly News: August 16, 2005 Greetings, and thanks for reading the third issue of HWN, a weekly newsletter for the Haskell community. Each Tuesday, new editions will be posted (as text) to [1]the Haskell mailing list and (as HTML) to [2]The Haskell Sequence. 1. http://www.haskell.org/mailman/listinfo/haskell 2. http://sequence.complete.org/ New Releases * gtk2hs 0.9.9. Axel Simon [3]announced the latest version of this binding to GTK, primarily containing bugfixes. * h4sh. Donald Bruce Stewart [4]announced the new Haskell for shell scripts package. It exposes the Haskell Data.List library for use in shell scripting. * c2hs 0.14.3. Manuel M. T. Chakravarty [5]released version 0.14.3 of c2hs. Improvements over 0.14.1 include support for cross-compilation, gcc's asm construct, better support for hierarchical module syntax, and new name translation functions. * magic-haskell. John Goerzen [6]announced the availability of magic-haskell, a binding to C's libmagic. With it, you can determine the type of a file by looking at its contents rather than its name. * AVL 2.2. Adrian Hey [7]released AVL 2.2. It introduces new set manipulation functions, a new type of zipper, and optimizations for functions that don't modify a tree. 3. http://article.gmane.org/gmane.comp.lang.haskell.general/11971 4. http://article.gmane.org/gmane.comp.lang.haskell.general/11970 5. http://article.gmane.org/gmane.comp.lang.haskell.glasgow.user/8566 6. http://www.haskell.org/pipermail/haskell/2005-August/016288.html 7. http://article.gmane.org/gmane.comp.lang.haskell.libraries/3631 Discussion HWN format changes this week. Based on reader feedback, the New Releases section has been moved to the top of HWN. Please let me know what you think. Before you ask, the Darcs and Quotes of the Week sections are missing because there was no news for them this week. Static typing. Minh Thu started a [8]discussion about the pros and cons of static typing and side effects. 8. http://thread.gmane.org/gmane.comp.lang.haskell.general/11950 Language version pragmas. Bulat Ziganshin [9]proposed a way to specify what language version and options are used in Haskell sources. 9. http://thread.gmane.org/gmane.comp.lang.haskell.general/11944 About Haskell Weekly News Want to continue reading HWN? Please help us create new editions of this newsletter. Please see the [10]contributing information, or send stories to hwn -at- complete -dot- org. There is also a Darcs repository available. 10. http://sequence.complete.org/hwn-contrib

1 0

ANN: magic-haskell
by John Goerzen 16 Aug '05

16 Aug '05

Hello, I have packaged up a Haskell binding to libmagic, a library that guesses the type of a file by looking at its contents instead of its name. This is a working full binding. darcs get --partial http://darcs.complete.org/magic-haskell Proper tarballs and unit tests will be following shortly. -- John

1 0

LECTURERSHIP IN COMPUTER SCIENCE, UNIVERSITY OF DURHAM
by Susan Bates 16 Aug '05

16 Aug '05

The Department of Computer Science at the University of Durham is advertising for a Lectureship available from 1 October 2005 or as soon as possible thereafter to candidates with a high research portfolio or demonstrable potential of such. Candidates should have research interests related to those of the Department. Appointment will be made on the Lecturer A or Lecturer B scale depending on individuals' qualifications and current level of experience. Closing date: 21 September 2005 Vacancy Reference Number: 0956 Further details of the post and an application form are available on the University's website (https://jobs.ac.uk) or telephone 0191 334 6499; fax 0191 334 6495 -- Susan Bates Secretary Department of Computer Science University of Durham Science Laboratories South Road Durham DH1 3LE Tel: 0191 334 1757 Fax: 0191 334 1701 E-mail: susan.bates(a)durham.ac.uk -- Susan Bates Secretary Department of Computer Science University of Durham Science Laboratories South Road Durham DH1 3LE Tel: 0191 334 1757 Fax: 0191 334 1701 E-mail: susan.bates(a)durham.ac.uk

1 0

Gtk2Hs 0.9.9 released
by Axel Simon 15 Aug '05

15 Aug '05

Dear all, A new release for Gtk2Hs, namely version 0.9.9 is now available. This is a bug-fix release which is meant to fix various issues in the 0.9.8 release. The tarball is available from at Sourceforge. The md5 checksum is 3276545190248d40c683cd42f51a1b6e. Changes since 0.9.8: * many documentation fixes * documentation builds with the new haddock 0.7 * fixed an intolerant parser in c2hs, the C header-file scanner * fixed segfaults when disconnecting signal handlers * fixed segfaults in signals that pass TextIters * add Pixmap from Gdk (not gtk_pixmap which is deprecated) * added ChildAttributes to all containers * minor fixes to our Makefile Please report any problems with this release to our emailing list, gtk2hs-users(a)lists.sourceforge.net . Axel (on behalf of the Gtk2Hs team).

1 0

post-doc job in functional programming
by Colin Runciman 13 Aug '05

13 Aug '05

Research Associate Position Available -- Post-Doc, Functional Programming (Second Posting -- application deadline 31 August) Applications are invited for a fixed-term research position at the Department of Computer Science, University of York, UK. This position is for a post-doctoral researcher to investigate the use of functional programming systems in grid computing. Specifically, the post is available in connection with a recently awarded EPSRC grant: "A Lazy Polytypic Grid: Generic Data Visualization Methods That Adapt to Resources Available". The project is a collaboration between the University of Leeds (grant holder: David Duke) and the University of York (grant holder: Colin Runciman). A post-doctoral researcher is being appointed at each site. The researcher at Leeds is expected to specialise in data visualisation and the researcher at York in functional programming systems, but the intention is that work will be genuinely collaborative. Both departments are active centres of research; for further information about them see http://www.cs.york.ac.uk/ and http://www.comp.leeds.ac.uk/. The essential qualifications for the post are these: * a PhD in functional programming systems or equivalent research experience; * well-developed skills in both the implementation and application of functional languages; * an aptitude for working collaboratively in a small team with researchers from different domains of expertise; * strong communication skills for written and oral presentation of ideas and results within and beyond the team. Other desirable qualifications include: * fluency in the Haskell programming language; * knowledge of data visualisation methods; * experience with grid computing. Starting salary will be up to 27,116 pounds per annum and the position is available for up to 3 years. For details of how to apply please email jobs(a)york.ac.uk quoting reference number CR05305 or see http://www.york.ac.uk/admin/persnl/jobs/. The closing date is 31 August 2005. For informal enquiries, or more details of the technical aims of the project, you are welcome to contact me directly: e-mail Colin.Runciman at cs.york.ac.uk or telephone +44 1904 432740. Please note, however, that I am due to be away for the last 10 days of August.

1 0

CFP WRLA06
by WRLA Acct (Denker) 13 Aug '05

13 Aug '05

+ + + + + WRLA'06 + + + + + CALL FOR PAPERS + + + + + WRLA'06 + + + + + +----------------------------------------------------------+ | | | 6th International Workshop on | | Rewriting Logic and its Applications | | | | W R L A 2006 | | | | Vienna, Austria, April 1-2, 2006 | | | | http://www-formal.stanford.edu/clt/WRLA06/ | +----------------------------------------------------------+ The workshop will be held in conjunction with ETAPS 2006 9th European Joint Conferences on Theory and Practice of Software March 26 - April 2, 2006 http://www.complang.tuwien.ac.at/etaps06/ IMPORTANT DATES November 21, 2005 Deadline for submissions January 16, 2006 Notification of acceptance February 16, 2006 Final version in electronic form April 1-2, 2006 Workshop in Vienna AIMS AND SCOPE Rewriting logic (RL) is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication and interaction. It can be used for specifying a wide range of systems and languages in various application fields. It also has good properties as a metalogical framework for representing logics. In recent years, several languages based on RL (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the workshop is to bring together researchers with a common interest in RL and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. The topics of the workshop comprise, but are not limited to, * foundations and models of RL; * languages based on RL, including implementation issues; * RL as a logical framework; * RL as a semantic framework, including applications of RL to - object-oriented systems, - concurrent and/or parallel systems, - interactive, distributed, open ended and mobile systems, - specification of languages and systems; * formalisms related to RL, including - real-time and probabilistic extensions of RL, - tile logic, - rewriting approaches to behavioral specifications; * verification techniques for RL specifications, including - equational and coherence methods, and - verification of properties expressed in first-order, higher-order, modal and temporal logics; * comparisons of RL with existing formalisms having analogous aims; * application of RL to specification and analysis of - distributed systems, - physical systems. PAST EVENTS Previous WRLA workshops have been organized in - Asilomar, California, September 3-6, 1996 - Pont-a-Mousson, France, September 1-4, 1998 - Kanazawa, Japan, September 18-20, 2000 - Pisa, Italy, September 19-21, 2002 - Barcelona, Spain, March 27-28, 2004 The proceedings of the WRLA workshops have been published as volumes 4, 15, 36, 71, and 117 in the Elsevier ENTCS series, available at http://www.sciencedirect.com/science/journal/15710661 Selected papers from WRLA'96 have been published in a special issue of Theoretical Computer Science, Volume 285(2), 2002, and selected papers from WRLA 2004 will appear in a special issue of Higher-Order and Symbolic Computation. LOCATION WRLA 2006 will be held in Vienna, Austria in March 25-26, 2006. It is a satellite workshop of ETAPS 2006, the European Joint Conferences on Theory and Practice of Software. For venue, registration and suggested accommodation see the ETAPS 2006 web page http://www.complang.tuwien.ac.at/etaps06 SUBMISSIONS Submissions will be evaluated by the Program Committee for inclusion in the proceedings, which will be available at the time of the workshop and are expected to be published in the Elsevier ENTCS series. Papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere. Papers (of at most 15 pages, at least 10 point font) should be submitted electronically, preferably as PDF files, to the workshop email address wrla06(a)csl.sri.com providing also a text-only abstract, and detailed contact information of the corresponding author. The final program of the workshop will also include system demonstrations and invited presentations to be determined. Based on the quality and interest of the accepted papers, the program committee will consider the possibility of preparing a special issue of a scientific journal in the field. ORGANIZING COMMITTEE Carolyn Talcott and Grit Denker SRI International Menlo Park, CA 94025 PROGRAM COMMITTEE Roberto Bruni Universita` di Pisa Manuel Clavel Universidad Complutense de Madrid Grit Denker SRI International, Menlo Park (co-Chair) Francisco Duran Universidad de Malaga Steven Eker SRI International, Menlo Park Kokichi Futatsugi JAIST, Nomi Claude Kirchner INRIA & LORIA, Nancy Salvador Lucas Universidad Politecnica de Valencia Narciso Marti-Oliet Universidad Complutense de Madrid Jose Meseguer University of Illinois at Urbana-Champaign Ugo Montanari Universita` di Pisa Pierre-Etienne Moreau INRIA & LORIA, Nancy Peter Olveczky University of Oslo Grigore Rosu University of Illinois at Urbana-Champaign Mark-Oliver Stehr University of Illinois at Urbana-Champaign Carolyn Talcott SRI International, Menlo Park (Chair) Martin Wirsing Ludwig-Maximillian University, Munich CONTACT INFORMATION For more information, please contact the organizers wrla06(a)csl.sri.com or visit the workshop web page http://www-formal.stanford.edu/WRLA06/ + + + + + WRLA'06 + + + + + CALL FOR PAPERS + + + + + WRLA'06 + + + + +

1 0

RE: [Haskell] concurrency analysis
by Simon Peyton-Jones 12 Aug '05

12 Aug '05

I don’t know of any. Quite a bit has been done for the single threaded case, trying to identify cases where thunk updates can be omitted (e.g. http://research.microsoft.com/%7Esimonpj/Papers/usage-types/usage.htm) For the parallel case you may be interested in our Haskell workshop paper (on my home page). Simon | -----Original Message----- | From: haskell-bounces(a)haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of John Meacham | Sent: 12 August 2005 04:05 | To: haskell(a)haskell.org | Subject: [Haskell] concurrency analysis | | I was curious if there has been any research on "concurrency analysis" | which would determine which thunks might be accessed concurrently by | different threads. I imagine that the vast majority are only accessed in | a single threaded manner so can use a more efficient representation when | doing SMP parallelism with haskell. It seems that some sort of abstract | interpretation could provide a conservative answer to this similar to | the way update analysis is done. | John | | | -- | John Meacham - ⑆repetae.net⑆john⑈ | _______________________________________________ | Haskell mailing list | Haskell(a)haskell.org | http://www.haskell.org/mailman/listinfo/haskell

1 0

FP in the (German) CS curriculum
by Johannes Waldmann 12 Aug '05

12 Aug '05

Hello. My institution is currently revising the curriculum for Bachelors and Masters in Computer Science. One point of interest is the role of programming, and especially that of the functional paradigm. I'd like to compare our plans to other existing curricula. The main critique raised implicitely or explicitely by some of my colleagues here is nicely summarized in http://www.galois.com/cufp/ : "industry folks complain that there aren't enough FP folks being produced by schools, and educators complain that students don't see any point in studying FP if there are no jobs to be had." So if you are teaching (or studying) at a German Fachhochschule (technical university, sort of), I'd like to know your opinion (and your institution's opinion). (Please reply to me, not to this list. Is there a better place for this discussion?) Vielen Dank (thanks)! -- -- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 -- ---- http://www.imn.htwk-leipzig.de/~waldmann/ -------

2 1