sts April 2008

sts@lists.urchin.earth.li

3 participants
3 discussions

Final CfP: LOPSTR 2008
by mh＠informatik.uni-kiel.de 18 Apr '08

18 Apr '08

====================================================================== Final CALL FOR PAPERS 18th International Symposium on International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2008 http://www.informatik.uni-kiel.de/~mh/lopstr08/ July 17-18, 2008, Valencia, Spain (co-located with SAS 2008, PPDP 2008, and PLID 2008) ====================================================================== Objectives: The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium, so authors can incorporate this feedback in the published papers. Topics: Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Papers describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: specification synthesis verification transformation analysis optimisation composition security reuse applications and tools component-based software development software architectures agent-based software development program refinement Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). IMPORTANT DATES AND SUBMISSION GUIDELINES: Paper/extended abstract submission: May 7, 2008 Notification (for pre-proceedings): June 8, 2008 Camera-ready (for pre-proceedings): June 29, 2008 Symposium: July 17-18, 2008 Submissions can either be (short) extended abstracts or (full) papers whose length should not exceed 9 and 15 pages (including references), respectively. Submissions must be formatted in the Springer LNCS style (excluding well-marked appendices not intended for publication). Referees are not required to read the appendices, and thus papers should be intelligible without them. Short papers may describe work-in-progress or tool demonstrations. Both accepted short and full papers will appear in the pre-proceedings. The full papers will automatically appear in the formal proceedings that will be published by Springer-Verlag in the LNCS series. In addition, after the symposium, the programme committee will select those short papers to be considered for formal publication. These authors will be invited to revise and extend their submissions in the light of the comments of the reviewers and the feedback solicited at the meeting. Then after another round of reviewing, the revised papers which are accepted will be also published in the formal proceedings. Papers should be submitted either in PDF or PostScript via the web page of LOPSTR 2008. Program Committee: Slim Abdennadher German University Cairo Danny De Schreye K.U.Leuven, Belgium Wlodek Drabent Polish Academy of Sciences, Poland / Linkoeping Univ., Sweden Gopal Gupta University of Texas at Dallas, USA Michael Hanus University of Kiel, Germany (Chair) Patricia Hill University of Leeds, UK Andy King University of Kent, UK Michael Leuschel University of Duesseldorf, Germany Torben Mogensen DIKU, University of Copenhagen, Denmark Mario Ornaghi Universita degli Studi di Milano, Italy Etienne Payet Universite de La Reunion, France Alberto Pettorossi University of Rome Tor Vergata, Italy German Puebla Technical University of Madrid, Spain C.R. Ramakrishnan SUNY at Stony Brook, USA Sabina Rossi Universita Ca' Foscari di Venezia, Italy Chiaki Sakama Wakayama University, Japan Josep Silva Technical University of Valencia, Spain Wim Vanhoof University of Namur, Belgium Eelco Visser Delft University of Technology, The Netherlands ----------------------------------------------------------------------

1 0

Tom version 2.6 is out
by Pierre-Etienne Moreau 14 Apr '08

14 Apr '08

Tom 2.6 announcement -------------------- It is our great privilege and pleasure to announce the availability of Tom version 2.6 . This release continues our work on the integration of pattern matching and rule based programming facilities into Java and C. Tom is a pattern matching compiler developed at INRIA. It is particularly well-suited for programming various transformations on trees/terms and XML based documents. Its design follows our research on the semantics and the efficient compilation of rule based languages. Many applications have been developed in Tom, both in academia and industry. Among them, let us mention: - the Tom compiler itself - languages semantics, interpreters and program transformation tools - a generator of canonical abstract syntax trees (Gom) - a proof assistant for supernatural deduction - a compiler algorithm for anti-pattern matching and disunification Tom is a complex compiler which adds powerful constructs to Java and C: rewrite rules, strategies, non linear syntactic matching, associative matching with neutral element (a.k.a. list-matching), XML based pattern matching, string matching, and equational rewriting. This offers the possibility to analyze and transform any kind of data-structure. Tom can be used for large scale developments and applications. It comes with a detailed documentation, as well as with programming and debugging support. This new release contains many improvements and new features: - new alternative syntax for '%match', based on atomic constraints that can be combined with '&&' and '||' operators. This gives a higher expressiveness and conciseness. - algebraic rules (lhs -> rhs) can now have any conjunction or disjunction of conditions - new syntax for strategies, make the definition of simple rules easier - the double-dispathing mechanism of the strategy library has been replaced by a simpler dispatching approach, making the use of strategies simpler when Gom is not used - Gom's lists now implement the interface Collection. Consequently, Java's classic iteration techniques can be employed. - new tool based on ANTLR 3 for implementing parsers that directly output Gom terms: GomAntlrAdapter. - term-graph rewriting support in Gom - several speed-ups of the compilation process as well as for the generated code. - a lot of new features for the Eclipse plug-in, including the availability of all the functionalities of the Java editor for ".t" files ( a complete list is available on the plug-in page: http://tom.loria.fr/plugin.php ) Tom is available, in open source (GPL/BSD License), from the web page: http://tom.loria.fr/ Best regards, Tom's development team

1 0

Last Call for Papers: SCAM'08 Working Conference on Source Code Analysis and Manipulation
by Jim Cordy 01 Apr '08

01 Apr '08

**************************************************** Deadline for submission: Abstract due: April 21, 2008 Full paper due: April 28, 2008 Notification: June 9, 2008 Camera Ready Due: June 30, 2008 Working Conference: 28th-29th September 2008 **************************************************** Call for Papers and Tool Demo Proposals - SCAM 2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation 28th-29th September 2008, Beijing, China, Co-located with ICSM 2008 http://www2008.ieee-scam.org/ ---------------- Conference aims: ---------------- The aim of this working conference is to bring together researchers and practitioners working on theory, techniques and applications which concern analysis and/or manipulation of the source code of computer systems. While much attention in the wider software engineering community is properly directed towards other aspects of systems development and evolution, such as specification, design and requirements engineering, it is the source code that contains the only precise description of the behaviour of the system. The analysis and manipulation of source code thus remains a pressing concern. --------------------------------- Covered topics and paper formats: --------------------------------- We welcome submission of papers that describe original and significant work in the field of source code analysis and manipulation. Topics of interest include, but are not limited to: * program transformation * abstract interpretation * program slicing * source level software metrics * decompilation * source level testing and verification * source level optimization * program comprehension Submitted papers should not be longer than 10 pages. We also welcome submission of 2 page proposals for tool demonstrations expected to be performed live at the conference. All papers submitted should follow IEEE Computer Society Press Proceedings Author Guidelines. The papers should be submitted electronically via the conference web site. ------------ Proceedings: ------------ All accepted papers will appear in the proceedings which will be published by the IEEE Computer Society Press. Best papers from SCAM 2008 will be considered for revision, extension, and publication in a special issue of The Journal of Information and Software Technology. ---------------- Important Dates: ---------------- Deadline for submission: Abstract due: April 21, 2008 Full paper due: April 28, 2008 Notification: June 9, 2008 Camera Ready Due: June 30, 2008 Working Conference: 28th-29th September 2008 Zheng Li (Publicity Chair)

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

sts April 2008