August 2005 - Haskell

reading call graphs
by Scherrer, Chad 24 Aug '05

24 Aug '05

When I compile with ghc -prof -auto-all, I end up with a .prof file that starts out like this: individual inherited COST CENTRE MODULE no. entries %time %alloc %time %alloc MAIN MAIN 1 0 0.0 0.0 100.0 100.0 main Main 228 92329 0.2 0.9 99.8 99.8 step Main 259 679 38.4 26.6 56.6 39.2 I'm trying to understand the "entries" column. I thought this was the number of times a given function is called. But "main" is nonrecursive, and only calls "step" (also nonrecursive) once. Where are the 92329 and 679 coming from? Am I mistakenly calling the functions more than I think I am? Thanks, Chad

3 2

Re: [Haskell] Random matrices
by Udo Stenzel 23 Aug '05

23 Aug '05

Scherrer, Chad wrote: > I keep getting stack overflows, so I think my code must be too lazy somewhere > (that's what that means, right?) Most often, yes. Afaict, the best way to spot these leaks is to simulate lazy evaluation in your head. After fumbling with ghc's heap profiling facilities and getting nothing usable out of it, I don't see a better way anyway. In the case of your code, to get at the result, most elements of the matrix don't need to be known. They are not evaluated when building the matrix! Due to the implicit state they depend on each other, however. So only when you demand part of the result, is any intermediate state evaluated at all. The most elegant way to cure your problem would be a strict state monad. Unfortunately, there is no such thing (apart from Control.Monad.ST, which is quite a bit different), you'd have to implement it yourself, which makes this a silly suggestion. Also, I'm afraid, a StdGen cannot be forced easily; it seems to contain some lazyness in its bowels. I had no luck when I tried this route. Something else is possible, though. Forcing the random numbers in turn forces the state. So demand for the arrays must be propagated into demand for their elements. randomArray is the right spot to do this. Simplifying your randomArray a bit, we now use a strict variant of sequence, and everything works (though it is still dog slow in GHCi). > randomArray n x = liftM (listArray (1,n)) . sequence' . replicate n > > sequence' [] = return [] > sequence' (mx:mxs) = do x <- mx > xs <- sequence' mxs > x `seq` return (x:xs) [...] > tester n = fst $ runState vals $ mkStdGen 1 > where vals = sequence' . repeat $ randomMatrix n n tester has the same problem, though diminished by a factor of 100. Putting a strict sequence here helps again, cutting back on heap usage. The optimized binary now runs in under 2MiB of memory. Interestingly, using an unboxed array has almost the same effect. This failed, because Matrix couldn't use an unboxed array as well. Udo. -- "You see, wire telegraph is a kind of a very, very long cat. You pull his tail in New York and his head is meowing in Los Angeles. Do you understand this? And radio operates exactly the same way: you send signals here, they receive them there. The only difference is that there is no cat." -- Albert Einstein, when asked to describe radio

1 0

FMCO 2005: Call for Tutorial Papers
by M.M. Bonsangue 23 Aug '05

23 Aug '05

Apologies if you receive multiple copies of this message! =============================================================================== CALL FOR TUTORIAL PAPERS 4th International Symposium on 1 - 4 November 2005 Formal Methods for Objects and Components CWI, Amsterdam (FMCO 2005) The Netherlands http://fmco.liacs.nl/fmco05.html The FMCO symposium is an annual international event on the application and development of formal methods in software engineering, with a special focus on component-based and object-oriented software systems. We invite submissions of tutorial papers on topics that fit under that rubric. Suggested, but not exclusive, topics of interest for submissions include: models and logics for object-oriented and component-based systems; formal aspects of analysis of large systems; prediction, analysis and monitoring of extra-functional system properties; applications of modal logics, temporal logics, and model checking for the specification and verification of object-oriented languages; type systems and type theory for objects and components; probabilistic systems, process calculi, and semantics of object and component oriented languages; reasoning about security, trustworthiness and dependability of component-based systems. Important Dates --------------- Authors are invited to submit a title and a short abstract of one or two pages providing a tutorial perspective on research results or experiences related to the topics above. Accepted abstracts will be presented at the symposium and an extended tutorial paper of about 20 pages in LNCS style will be refereed and eventually published together with the contributions of the keynote speakers after the symposium, in a proceeding of Lecture Notes in Computer Science by Springer-Verlag. Selected papers will be published in revised and extended version in the Elsevier journal Theoretical Computer Science. Title and short abstract due: 5 Sep 2005 Tutorial paper due: 28 Feb 2006 Author notification: 1 Oct 2005 Author notification: 15 Apr 2006 Symposium: 1-4 Nov 2005 Camera-ready paper due: 15 May 2006 The short abstracts must be in English and provide sufficient details to allow the organizing committee and the advisory board to assess the merits of the related tutorial papers. One author of each accepted abstract will be expected to present the tutorial at the symposium. The tutorial papers must be unpublished and not submitted for publication, but may contain previously published material. Short abstracts and tutorial papers must be submitted electronically to F.S. de Boer (frb(a)cwi.nl) or M.M. Bonsangue (marcello(a)liacs.nl) Format ------ The symposium is a four days event organised to provide an atmosphere that fosters collaborative work, discussions and interactions. Lectures are given by the keynote speakers listed below and by authors of accepted abstract. Keynote speakers and advisory board ----------------------------------- Michael Barnett (Microsoft, USA) Luis Caires (New University of Lisbon, PT) Patrick Cousot (ENS, FR) Dennis Dams (Bell Labs, USA) Wan Fokkink (Free University, NL) Orna Grumberg (Technion, ISR) Joost-Pieter Katoen (RWTH Aachen, DE) Kung-Kiu Lau (University of Manchester, UK) Peter O' Hearn (Queen Mary University of London, UK) Arnd Poetzsch-Heffter (University of Kaiserslautern, DE) John Reynolds (Carnegie Mellon University, USA) Davide Sangiorgi (University of Bologna, IT) Organizing committee -------------------- F.S. de Boer (CWI and LIACS-Leiden University) M.M. Bonsangue (LIACS-Leiden University) S. Graf (Verimag) W.-P. de Roever (Christian-Albrechts University of Kiel) Sponsorship ----------- The symposium is sponsored by NWO, KNAW, CWI, and LIACS. ================================================================================ For more information about the symposium see the FMCO site above or consult either F.S. de Boer (frb(a)cwi.nl) or M.M. Bonsangue (marcello(a)liacs.nl)

1 0

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

23 Aug '05

Haskell Weekly News: August 23, 2005 Greetings, and thanks for reading the fourth 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 * ghc-src 0.2.0. Lemmih [3]announced ghc-src. ghc-src is a Haskell parser with full support for every GHC extension. It is based on the GHC source and is meant as a replacement for haskell-src-exts, though it could of course have other ueses. ghc-src is available via a Darcs [4]repository. * Cairo binding. Not a formal release, but [5]great progress is being made on the binding to the [6]Cairo vector graphics toolkit, including some working code. 3. http://article.gmane.org/gmane.comp.lang.haskell.general/11987 4. http://scannedinavian.org/~lemmih/ghc-src/ 5. http://haskell.org/gtk2hs/archives/category/cairo/ 6. http://www.cairographics.org/introduction Discussion Category theory monads. Cale Gibbard began a [7]discussion comparing the monads from category theory with the implementation of monads in Haskell. Michael Vanier [8]suggested some of Phil Wadler's [9]papers on monads. Michael went on to say that Haskell monads are very similar to those from category theory. 7. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8044 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8046 9. http://homepages.inf.ed.ac.uk/wadler/topics/monads.html More on FFI and callbacks. The [10]thread on FFI and callbacks was revived this week. Among other things, Duncan Coutts [11]noted that there is no easy way to do a really correct binding to wxWidgets from Haskell when Haskell programs are multithreaded, due to limitations in Haskell's threading model. 10. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/7862 11. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8065 Oracle on Haskell. Brian Strand [12]asked about using Oracle on Haskell, and more generally, about the suitability of Haskell for database programming. Alistair Bayley [13]mentioned that [14]takusen has Oracle support. John Goerzen [15]suggested using HSQL's ODBC support, with unixODBC on *nix platforms. He went on to say that HSQL has been used in production environments. Krasimir Angelov, author of HSQL, [16]added that he's been wanting to add Oracle support to HSQL for awhile. Finally, Brian Strand later [17]followed up and said that takusen has been working well for him so far. 12. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8032 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8033 14. http://cvs.sf.net/viewcvs.py/haskell-libs/libs/takusen/ 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8041 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8042 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8047 Pros and cons of static typing. Keean Schupke [18]revived an [19]earlier discussion about the pros and cons of static typing and side effects. 18. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8020 19. http://thread.gmane.org/gmane.comp.lang.haskell.general/11950 Static typing and interactivity. On a similar note, Ketil Malde [20]wrote about not being able to load modules with type errors into ghci. Bernard Pope [21]suggested the type debugger in [22]Chameleon. 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/8037 21. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8045 22. http://www.comp.nus.edu.sg/~sulzmann/chameleon/ Argument ordering. A [23]thread about the order of arguments to functions entertained many different viewpoints this week. Too many to really summarize here. 23. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3622 Decoupling and encapsulation. Terrence Brannon [24]wrote about decoupling program elements from presentation, as in HTML generators. He included a link to his document describing architectural flaws in Perl's HTML::Mason. 24. http://sequence.complete.org/node/88 Future of The Monad.Reader. Shae Erisson wrote on #haskell today that he is looking for someone to either take over, or help with, editing [25]The Monad.Reader, Haskell's monthly online magazine. Anyone that would like to help should contact him. 25. http://www.haskell.org/hawiki/TheMonadReader How is HWN material found? I've received some questions this week about how I find material for HWN. The most obvious way is if someone sends it to me; see the link at the bottom of each HWN for contribution information. Other than that, I read the main Haskell mailing lists, the Haskell Sequence, and IRC looking for things to write about. I prefer to have stories linked in at least one of these places before covering them in HWN, since it gives readers a convenient place to follow discussion. Haskell Toolchain Cabal design. Frederik Eaton started another [26]discussion about Cabal, this time focusing on run time vs. configure time issues, the usage of custom package.conf files, and multiple cabal files in one package. Isaac Jones [27]commented on most of those items. Duncan Coutts [28]suggested the ability to register a package "in place". 26. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3625 27. http://article.gmane.org/gmane.comp.lang.haskell.libraries/3629 28. http://article.gmane.org/gmane.comp.lang.haskell.libraries/3632 Darcs Corner Colordiff. Dmitriy Morozov [29]asked about using colordiff with darcs. Timo Savola [30]suggested a shell function to accomplish this. 29. http://thread.gmane.org/gmane.comp.version-control.darcs.user/8065 30. http://article.gmane.org/gmane.comp.version-control.darcs.user/8066 Linus and git. Juliusz Chroboczek [31]posted a link to a discussion about Git, and mentioned that it looks like they're re-inventing some Darcs features. 31. http://thread.gmane.org/gmane.comp.version-control.darcs.user/8081 Success with trac. Pedro Melo [32]posted about his success using trac (a SourceForge-like system) with Darcs. 32. http://thread.gmane.org/gmane.comp.version-control.darcs.user/8073 Quotes of the Week Seen on #haskell today... <tuomov> define drug <Itkovian> anything that gets you addicted to <Itkovian> potentially <Itkovian> and that messes with yr senses <Lemmih> Haskell? About Haskell Weekly News Want to continue reading HWN? Please help us create new editions of this newsletter. Please see the [33]contributing information, or send stories to hwn -at- complete -dot- org. There is also a Darcs repository available. 33. http://sequence.complete.org/hwn-contrib

1 0

FroCoS'05: Call for Participation (Early Reg. Deadline: Sept. 1, 2005)
by Bernhard Gramlich 23 Aug '05

23 Aug '05

[Apologies for multiple copies] ---------------------------------------------------------------------------- FroCoS 2005: CALL FOR PARTICIPATION *** EARLY REGISTRATION DEADLINE: September 1, 2005 *** ---------------------------------------------------------------------------- 5th International Workshop on Frontiers of Combining Systems (FroCoS 2005) Vienna, Austria, September 19-21, 2005 http://www.logic.at/frocos05/ ---------------------------------------------------------------------------- IMPORTANT DATES * Deadline for early registration: September 1, 2005 * Deadline for non-cash payments: September 11, 2005 * FroCoS 2005: September 19-21, 2005 BACKGROUND AND SCOPE In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, and automated reasoning, there is an obvious need for using specialized formalisms and inference mechanisms for special tasks. In order to be usable in practice, these specialized systems must be combined with each other, and they must be integrated into general purpose systems. The development of general techniques and methods for the combination and integration of special formally defined systems, as well as for the analysis and modularization of complex systems has been initiated in many areas. The International Workshop on Frontiers of Combining Systems (FroCoS) traditionally focuses on this type of research questions and activities and aims at promoting progress in the field. The previous FroCoS workshops were held in Munich (1996), Amsterdam (1998), Nancy (2000) and Santa Margherita Ligure (2002). In 2004, FroCoS joined IJCAR 2004, the 2nd International Joint Conference on Automated Reasoning. Like its predecessors, FroCoS 2005 offers a common forum for research activities in the general area of combination, modularization and integration of systems (with emphasis on logic-based ones), and of their practical use. Typical topics of interest to FroCoS include combination of logics; combination of decision procedures, of satisfiability procedures, and of constraint solving techniques; combinations and modularity in term rewriting; integration of equational and other theories into deductive systems; combination of deduction systems and computer algebra; integration of data structures into CLP formalisms and deduction processes; model/problem analysis and decomposition; hybrid methods for deduction, resolution and constraint propagation; hybrid systems in computational linguistics, knowledge representation, natural language semantics, and human computer interaction; logical modelling of multi-agent systems; logical aspects of combining and modularizing programs and specifications. PROGRAM AND PROCEEDINGS FroCoS 2005 will feature the following 4 invited talks. * Sociable Interfaces by Luca de Alfaro (Univ. of California, Santa Cruz) * A Comprehensive Framework for Combined Decision Procedures by Silvio Ghilardi (Univ. of Milano) * Matching Classifications via a Bidirectional Integration of SAT and Linguistic Resources by Fausto Giunchiglia (Univ. of Trento & ITC-IRST) * Hybrid CSP Solving by Eric Monfroy (Univ. of Nantes & UTFSM/Chile) Moreover the program includes 1 tutorial and 14 regular contributed talks coveringg a broad range of topics. The scientific part is complemented by an interesting social program. For details as well as further comprehensive information about the event please consult the website. The proceedings of FroCoS 2005 are published as a volume of LNAI (Springer) and will be available at the conference. PROGRAM COMMITTEE * Alessandro Armando (U Genova) * Franz Baader (TU Dresden) * Clark W. Barrett (NYU New York) * Frederic Benhamou (LINA, U Nantes) * Michel Bidoit (LSV, CNRS & ENS Cachan) * Jacques Calmet (U Karlsruhe) * Juergen Giesl (RWTH Aachen) * Bernhard Gramlich (chair) (TU Wien) * Deepak Kapur (UNM Albuquerque) * Maarten Marx (U Amsterdam) * Joachim Niehren (INRIA Futurs, U Lille) * Christophe Ringeissen (LORIA-INRIA Nancy) * Manfred Schmidt-Schauss (U Frankfurt) * Cesare Tinelli (U Iowa) * Ashish Tiwari (SRI Menlo Park) * Frank Wolter (U Liverpool) FURTHER INFORMATION FroCoS 2005 website: http://www.logic.at/frocos05/ ----------------------------------------------------------------------------

1 0

FSEN05 Call for Participation
by fsen05＠ipm.ir 22 Aug '05

22 Aug '05

Our apologies if you have received multiple copies. ------------------------------------------------------------------------- FSEN05 Call for Participation IPM International Workshop on Foundations of Software Engineering (FSEN 2005) 1-3 October 2005, Tehran, Iran. http://cs.ipm.ac.ir/FSEN05 In Cooperation with ACM/SigSoft (FSEN05 is different from the ACM Symposium on Foundations of Software Engineering) Registration deadline: August 26, 2005 (in the case a visa application by IPM is required) September 15, 2005 (in other cases) (For more information check the workshop homepage.) FSEN 2005 is an international workshop organized by the Institute for Studies in Theoretical Physics and Mathematics (IPM) in Iran (http://www.ipm.ac.ir) Accepted papers are available at workshop homepage. Keynote Speakers ---------------- Gul Agha - University of Illinois at Urbana - Champaign, USA Joost Kok - Leiden University, Netherlands Carolyn Talcott - SRI International, USA Tutorials: ---------------- "Connector Circuits for Coordinated Component Composition" Farhad Arbab CWI, Amsterdam and Leiden University, Netherlands "Algebra and Coalgebra of Streams, Automata and Circuits" Jan Rutten CWI and VUA, Amsterdam, Netherlands "A Calculus for Component-Oriented Programming" Marcello Bonsangue CWI, Amsterdam and Leiden University, Netherlands Workshop goals ---------------- The aim of the workshop is to bring together researchers and practitioners working on different aspects of formal methods in software engineering. The specific goal is to facilitate transfer of experience, adaptation of methods, and where possible, collaboration between different groups. The topics may cover any aspect in formal methods, especially those related to advancing the application of formal methods in software industry and promoting their integration with practical engineering techniques. Topics of interest ------------------ The topics of this workshop include, but are not restricted to, the following: * Models of programs and systems * Software specification, validation and verification * Software architectures and their description languages * Object and multi-agent systems * Coordination and feature interaction * Integration of formal and informal methods * Integration of different formal methods * Component-based development * Service-oriented development * Model checking and theorem proving * Software and hardware verification * CASE tools and tool integration * Application to industrial cases Workshop Chair -------------- Ali Movaghar Sharif University of Technology, Iran IPM, Iran PC Chairs --------- Farhad Arbab CWI, Netherlands Leiden University, Netherlands University of Waterloo, Canada Marjan Sirjani Tehran University, Iran IPM, Iran Local Organization Chair ------------------------ Marjan Sirjani Tehran University, Iran IPM, Iran Program committee ----------------- * Farhad Arbab - CWI, Netherlands; Leiden University, Netherlands; University of Waterloo, Canada * Mohammad Ardeshir - Sharif University of Technology, Iran * Christel Baier - University of Bonn, Germany * Frank de Boer - CWI, Netherlands; Leiden University, Netherlands * Marcello Bonsangue - Leiden University, Netherlands * Franck van Breugel - York University, Canada * James C. Browne - University of Texas at Austin, USA * Michael Butler - University of Southampton, UK * Marsha Chechik - University of Toronto, Canada * Dennis Dams - Bell Labs, USA * Nancy Day - University of Waterloo, Canada * Maurizio Gabbrielli - University of Bologna, Italy * Yuri Gurevich - Microsoft Research, USA * Joost Kok - Leiden University, Netherlands * Marta Kwiatkawska, University of Birmingham, UK * Mohammad Reza Meybodi - AmirKabir University of Technology, Iran * Seyyed Hassan Mirian - Sharif University of Technology, Iran * Ugo Montanari - University of Pisa, Italy * Ali Movaghar - Sharif University of Technology, Iran; IPM, Iran * Andrea Omicini - University of Bologna, Italy * George Papadopoulos - University of Cyprus, Cyprus * Willem-Paul de Roever - University of Kiel, Germany * Jan Rutten - CWI, Netherlands; Vrije University Amsterdam, Netherlands * Sandeep Shukla- Virginia Tech, USA * Marjan Sirjani - Tehran University, Iran; IPM, Iran * Alan Wassyng - McMaster University, Canada

1 0

PHI ¿ Python Haskell Interface
by Gottfried F. Zojer 21 Aug '05

21 Aug '05

Hello, Is anybody aware about the development status of PHI Python Haskell Interface Any time when I want to access I get a timeout http://page-208.caltech.edu/phi/ Any feedback welcomed Rgds Gottfried

3 2

Random matrices
by Scherrer, Chad 21 Aug '05

21 Aug '05

I'm doing some statistical calculations, and I decided to try this out in Haskell to see how it goes. I'm really enjoying using the language, so I hope I can straighten this out so I can keep using it at work. I keep getting stack overflows, so I think my code must be too lazy somewhere (that's what that means, right?) Here is my code to build random vectors and matrices. ------------------------------------------------------------------------ -------- type Vector = UArray Int Float type Matrix = DiffArray Int Vector -- Generate a random number from the unit interval randomEntry :: State StdGen Float randomEntry = do g <- get (x, g') <- return $ randomR (0,1) g put g' return x -- Build an array of n random things randomArray :: (IArray arr a) => Int -> State StdGen a -> State StdGen (arr Int a) randomArray n x = mapState arr . sequence $ replicate n x where arr (a,s) = (array (1,n) $ zip [1..n] a, s) -- A random vector is an array of random entries randomVector :: Int -> State StdGen Vector randomVector n = randomArray n randomEntry -- a random matrix is an array of random vectors. randomMatrix :: Int -> Int -> State StdGen Matrix randomMatrix i j = randomArray i $ randomVector j ------------------------------------------------------------------------ -------- I decided to write a tester function to see whether building the random matrices is the root of my problem. tester :: Int -> [Matrix] tester n = fst $ runState vals $ mkStdGen 1 where vals = sequence . repeat $ randomMatrix n n Then if I do main = print $ ((tester 10)!!10000)!5 with ghc -O, I get a stack overflow. So all main is trying to do is build an infinite list of 10x10 random matrices, extract the 10000th one, and then look at row 5. Stack overflows like this have given me trouble before. I thought using unboxed arrays might help, since they're forced to be strict, but I haven't had any luck with them. Are there any general guidelines I'm overlooking? I think Haskell can be very useful in my work, but I have to get beyond this hurdle. I just figured out the State monad yesterday, so maybe I'm not using it as it's intended? I dunno. Thanks, Chad Scherrer

2 2

PLID 2005 call for participation
by David Clark 19 Aug '05

19 Aug '05

CALL FOR PARTICIPATION Second International Workshop on Programming Interference and Dependence (PLID) Affiliated with SAS and LOPSTR September 6 2005 Imperial College London UK http://www.dcs.kcl.ac.uk/events/PLID05 INVITED TALK Mobile Computing, Types and Security. Nobuko Yoshida (UK) VENUE PLID 2005 is co-located with SAS'05 and LOPSTR'05 at Imperial College, London, UK REGISTRATION At the SAS conference web site: http://www.doc.ic.ac.uk/~sas2005/registration.html SHORT TALKS Participants are offered the opportunity to present one or more five minute talks on current research ideas. PROGRAM the program of talks can be found at http://www.dcs.kcl.ac.uk/events/PLID05/program.html WORKSHOP THEME Interference and dependence are closely related concepts, the first being the observable phenomenon connected to the second. Interference essentially means that behaviour of some parts of a dynamic system may influence the behaviour of other parts of the system. Dependence specifies the relation between the semantics of sub-components of a dynamic system. Discovering, measuring and controlling interference is essential in many aspects of modern computer science, in particular in security, program analysis and verification, debugging, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and recently in systems biology, where the problem of controlling interference between pathways in complex molecular networks is recognized as a major challenge. Refining dependence analysis is the main task to achieve this goal. This requires new theories, models and semantics for interference and dependence, algorithms and tools for analysis and reasoning about interference and dependence. The aim of this workshop is to gather together the community of people that study dependence and interference from the different points of view in order to generate new possible research directions. PLID is devoted to bridging all these communities towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. -- _______________________________________________________ David Clark, room 2F, Department of Computer Science, King's College London, The Strand, London, WC2R 2LS, UK. ph: +44 20 7848 2472

1 0

PEPM 2006: Call for Papers -- ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation
by John Hatcliff 19 Aug '05

19 Aug '05

C A L L F O R P A P E R S === P E P M 2006 === ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation (Affiliated with POPL 2006) http://www.cis.ksu.edu/santos/pepm06 January 9-10, 2006 Charleston, South Carolina The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, supporting theory, tools, and applications of the analysis and manipulation of programs. The 2006 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation. This year, a concerted effort will be made to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM will be broadened to cover manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'06 include, but are not limited to: * Program and model manipulation techniques such as transformations driven by rules, patterns, or analyses, partial evaluation, specialization, slicing, symbolic execution, refactoring, aspect weaving, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as abstract interpretation, static analysis, binding-time analysis, dynamic analysis, constraint solving, and type systems. * Analysis and transformation for programs/models with advanced features such as objects, generics, ownership types, aspects, reflection, XML type systems, component frameworks, and middleware. * Techniques that treat programs/models as data objects including meta-programming, generative programming, model-driven program generation and transformation. * Application of the above techniques including experimental studies, engineering needed for scalability, and benchmarking in a wide variety of domains including source code manipulation, domain-specific language implementations, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications. We especially encourage papers that break new ground including descriptions of how program/model manipulation tools can be integrated into realistic software development processes, descriptions of robust tools capable of effectively handling realistic applications, and new areas of application such as rapidly evolving systems, distributed and web-based programming including middleware manipulation, model-driven development, and on-the-fly program adaptation driven by run-time or statistical analysis. Submission Categories, Guidelines, and Proceedings: Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style, and authors will be expected to present a live demonstration of the described tool at the workshop. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM'06 Web-site. Papers should be submitted electronically via the workshop web site. We plan to publish the workshop proceedings in ACM SIGPLAN Notices (with full papers appearing in the ACM Digital Library) and selected papers will be invited for a journal special issue dedicated to PEPM'06. Important Dates: Submission........: October 7, 2005 Apia, 11:59pm, Samoan time (firm deadline, no extensions) Notification......: November 18, 2005 Camera-Ready Paper: December 16, 2005. Workshop co-Chairs: John Hatcliff, Kansas State University, USA (hatcliff(a)cis.ksu.edu) Frank Tip, IBM T.J. Watson Research Center, USA (ftip(a)us.ibm.com) PEPM 2006 Program Committee: Krzysztof Czarnecki University of Waterloo Gary Daugherty Rockwell Collins Advanced Technology Center Tom Dean Queen's University Mangala Gowri Nanda IBM India John Hatcliff (co-chair) Kansas State University Nevin Heintze Agere Systems Jaakko Järvi Texas A & M University Jens Krinke University of Hagen Shriram Krishnamurthi Brown University Julia Lawall University of Copenhagen (DIKU) Oege de Moor Oxford University Germán Puebla Technical University of Madrid Peter Sestoft Royal Veterinary and Agricultural University (Denmark) Gregor Snelting University of Passau Frank Tip (co-chair) IBM T.J. Watson Research Center Eelco Visser Universiteit Utrecht -- ---------------------------------------------------------------------------- John Hatcliff Phone: 785-532-6350 Professor Fax..: 785-532-7353 Department of Computing and Information Sciences Email: hatcliff(a)cis.ksu.edu 234 Nichols Hall WWW..: http://www.cis.ksu.edu/~hatcliff Kansas State University Manhattan, KS 66506 ----------------------------------------------------------------------------

1 0