sts November 2005

sts@lists.urchin.earth.li

4 participants
3 discussions

PEPM 2006: Call for Papers -- ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation
by John Hatcliff 28 Oct '06

28 Oct '06

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 ----------------------------------------------------------------------------

2 1

Mature Program Transformation Systems
by Karl Trygve Kalleberg 13 Dec '05

13 Dec '05

Hi gang, I am looking for opinions on which program transformation systems may be considered somewhat mature. Note that my definition of "mature" is rather loose in this context. I consider a system to be mature if a proficient developer (late undergrad, early grad student with a background in the field) can get up and running and start doing interesting work with it within a day (or tops two). Also, I am not dictating which particular tasks the system must be able to perform. As long as the system can be used for constructing programs which can perform one or several tasks which reasonably fall under "program transformation" [1], I'm interested in knowing about it. Working my way though the list on program-transformation.org, and checking references (publications, manuals, available downloads) for the systems, seems to suggest that "reasonably mature" systems might include ASF+SDF, DMS, Elegant, FermaT, Stratego/XT and TXL, but I'm sure there are more. Pointers and opinions are welcome, both on and off list. -- Karl T [1] It is beyond the scope of this e-mail to provide a crisp, clear-cut definition of the term program transformation. I have left out "pure" compiler construction kits and "pure" editors from my list of stable systems, and do not want to consider those, even though this decision is may appear rather arbitrary.

5 4

CfP LDTA 2006
by Eric Van Wyk 11 Nov '05

11 Nov '05

Call for Papers for Sixth Workshop on Language Descriptions, Tools and Applications LDTA 2006 A satellite event of ETAPS 2006 in Cooperation with ACM SIGPLAN Saturday, April 1, 2006 in Vienna, Austria http://ldta06.cs.umn.edu Scope: ------ The aim of this one-day workshop is to bring together researchers from academia and industry interested in the field of formal language definitions and language technologies, with a special emphasis on tools developed for or with these language definitions. This active area of research involves the following basic technologies: - Program analysis, transformation, and generation - Formal analysis of language properties - Automatic generation of language processing tools For example, language definitions can be augmented in a manner so that not only compilers or interpreters can be automatically generated but also other tools such as syntax-directed editors, debuggers, partial evaluators, test generators, documentation generators, etc. Although various specification formalisms like attribute grammars, action semantics, operational semantics, and algebraic approaches have been developed, they are not widely exploited in current practice. It is the aim of the LDTA workshops to bridge this gap between theory and practice. Among others, the following application domains can benefit from advanced language technologies: - Software component models and modeling languages - Re-engineering and re-factoring - Aspect-oriented programming - Domain-specific languages - XML processing - Visualization and graph transformation - Programming environments such as Eclipse, .net, Rotor, SUN Java, etc. The workshop welcomes contributions on all aspects of formal language definitions, with special emphasis on applications and tools developed for or with these language definitions. Invited Speaker: ---------------- The invited speaker for LDTA 2006 is Jean Bezivin, Universite de Nantes. Important Dates: ---------------- - Submission deadline: December 1, 2005. - Notification: January 16, 2006 - Final version due: February 15, 2006 - Workshop: April 1, 2006 Submission Procedure and Publication: ------------------------------------- Submission will be open from autumn 2005. Two classes of papers are solicited: full-length research papers and short tool-demo papers. Tool-demo papers should contain a brief description of the tool and include a section that clearly explains what will be demonstrated. Full-length papers should be at most 15 pages in length and tool-demo papers should be at most 4 pages in length. Both classes of papers should be submitted electronically as PostScript or PDF files to both of the program committee chairs, John Tang Boyland at Boyland(a)cs.uwm.edu and Tony Sloane at asloane(a)ics.mq.edu.au. The message should also contain a text-only abstract and contact author information. Additional submission details, along with LaTeX style files, are available on the LDTA 2006 web page: \texttt{ldta06.cs.umn.edu}. The final versions of accepted papers will be published in Electronic Notes in Theoretical Computer Science (ENTCS), Elsevier Science, and will be made available during the workshop. The authors of the best full-length papers will be invited to write a journal version of their paper which will be separately reviewed and, assuming acceptance, be published in journal form. As in past years, this will be done in a a special issue devoted to LDTA 2006 of the journal Science of Computer Programming (Elsevier Science). Program Committee: ------------------ - Uwe Assmann, Dresden Technical University, Germany - John Tang Boyland, University of Wisconsin-Milwaukee, USA (co-chair), Boylan(a)cs.uwm.edu - Jim Cordy, Queen's University, Canada - Jan Heering, Centrum voor Wiskunde en Informatica (CWI), The Netherlands - Nigel Horspool, University of Victoria, Canada - Johan Jeuring, Utrecht University, The Netherlands - Adrian Johnstone, Royal Holloway, University of London, UK - Steven Klusener, Vrije Universiteit, The Netherlands - David Lacey, University of Warwick, United Kingdom - Brian Malloy, Clemson University, USA - Paul Roe, Queensland University of Technology, Australia - Michael Schwartzbach, BRICS, University of Aarhus, Denmark - Tony Sloane, Macquarie University, Australia (co-chair), asloane(a)ics.mq.edu.au - Yannis Smaragdakis, Georgia Institute of Technology, USA - David Watt, University of Glasgow, Scotland - David Wile, Teknowledge Corp, USA Organizing Committee: --------------------- - Eric Van Wyk, University of Minnesota, Minneapolis, USA, evw(a)cs.umn.edu - Joost Visser, University of Minho, Braga, Portugal, Joost.Visser(a)di.uminho.pt

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

sts November 2005