sts

sts@lists.urchin.earth.li

102 discussions

Call for papers: SCAM 2019, the 19th IEEE International Working Conference on Source Code Analysis and Manipulation
by Roy, Banani 02 Jun '19

02 Jun '19

19th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2019) September 30-October 01, 2019 - Cleveland, OH, USA http://www.ieee-scam.org/2019/ *** Call for research papers: http://www.ieee-scam.org/2019/#call ***Call for RENE papers (NEW to SCAM!): http://www.ieee-scam.org/2019/#renecall ***Call for engineering papers: http://www.ieee-scam.org/2019/#engcall *** Important Dates Abstract Deadline: June 13, 2019 Paper Deadline: June 17, 2019 Notification: July 12, 2019 Camera Ready: TBD Conference: Sep 30 and Oct 1, 2019 SCAM 2019 will be held in Cleveland, OH, USA co-located with ICSME 2019. The aim of the International Working Conference on Source Code Analysis & Manipulation (SCAM) 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. *** Keynote Speaker: Oege De Moor, CEO, Semmle Inc (Formerly, Professor of Computer Science, University of Oxford) *** Covered Topics and Paper Formats *** Research Track http://www.ieee-scam.org/2019/#call 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 and refactoring static and dynamic analysis natural language analysis of source code artifacts repository, revision, and change analysis source level metrics decompilation bug location and prediction security vulnerability analysis source-level testing and verification clone detection Saskatoon-Confederation concern, concept, and feature localization and mining program comprehension bad smell detection abstract interpretation program slicing source level optimization energy efficient source code SCAM explicitly solicits results from any theoretical or technological domain that can be applied to these and similar topics. Submitted papers should describe original, unpublished, and significant work and must not have been previously accepted for publication nor be concurrently submitted for review in another journal, book, conference, or workshop. Papers must not exceed 12 pages (the last 2 pages can be used for references only) and must conform to the IEEE proceedings paper format guidelines. Templates in Latex and Word are available on IEEE's website. All submissions must be in English. *** Engineering Track http://www.ieee-scam.org/2019/#engcall This track welcomes six-page papers that report on the design and implementation of tools for source code analysis and manipulation, as well as libraries, infrastructure, and the real world studies enabled by these advances. To be clear, this is not the addition of a new track to SCAM but rather a significant expansion to the scope of the tools track of previous SCAMs. What artefacts qualify as ?engineering track? material? tools: software (or hardware!) programs that facilitate SCAMmy activities. libraries: reusable API-enabled frameworks for the above. infrastructure: while libraries are purely software, infrastructure can include projects that provide/facilitate access to data and analysis. data: reusable datasets for other researchers to replicated and innovate with. real world studies enabled by these advances. Here the focus is on how the {tool,infrastructure, etc} enabled the study, and not so much the study itself. The novelty of the research question is less important than the engineering challenges faced in the study. A successful SCAM engineering track paper should *Fall under the topics mentioned for the SCAM 2019 research track. *Discuss engineering work artefacts that have NOT been published before. However, previous work involving the tool, but for which the tool was not the main contribution, are acceptable. *Motivate the use cases (and hence the existence) of the engineering work. *Relate the engineering project to earlier work, if any. *Describe the experiences gained in developing this contribution. Optionally (and encouraged): *Any empirical results or user feedback is welcome. *Contain the URL of a website where the tool/library/data/etc. can be downloaded, together with example data and clear installation guidelines, preferably but not necessarily open source. *Contain the URL to a video demonstrating the usage of the contribution. Note that the submission length has a limit of six pages, in contrast to the two to four pages of traditional tool demo papers. The expectation is that authors use the space to discuss artefact motivation, design, and use cases in much more detail. For example, a use case would be well illustrated by a demo scenario with screenshots. ****Replication and Negative Results Papers (RENE) http://www.ieee-scam.org/2019/#renecall The 19th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM) will be hosting a Replication and Negative Result (RENE) track for the first time in 2019. This track provides a venue for researchers to submit papers reporting (1) replications of previous empirical studies (including controlled experiments, case studies, and surveys) and (2) important and relevant negative or null results (i.e., results that failed to show an effect, but help to eliminate useless hypotheses, therefore reorienting researchers on more promising research paths) related to source code analysis and manipulation (see list of topics in Technical Research Track). *Replications studies*: The papers in this category must go beyond simply re-implementing an algorithm and/or re-running the artifacts provided by the original paper. Such submissions should apply the approach on at least a partially new data sets (open-source or proprietary). This also means that it is possible to use available infrastructures to conduct measurements and experiments but with different/extended datasets and different conditions, scenarios, etc. Replication studies can either strengthen the results of the original study by increasing external validity with additional data or provide new insights into the variables that may impact the results. A replication paper should clearly report on results that the authors were able to reproduce as well as on the aspects of the work that were irreproducible. *Negative results papers*: In this category we seek papers that report on negative results. We seek negative results for all types of software engineering research related to source code and manipulation (qualitative, quantitative, case study, experiment, etc.). Negative results are important contributions to scientific knowledge because they allow us to prune our hypothesis space. As Walter Tichy writes, "Negative results, if trustworthy, are extremely important for narrowing down the search space. They eliminate useless hypotheses and thus reorient and speed up the search for better approaches." *** Proceedings All accepted papers from both tracks will appear in the proceedings which will be available through the IEEE Digital Library. *** Special Issue A set of the best papers from both tracks of SCAM 2019 will be invited to be considered for revision, extension, and publication in a special issue of Journal of Systems and Software (pending final approval). *** Committees General Chair Chanchal Roy, University of Saskatchewan, Canada Research Track Program Co-Chairs Yoshiki Higo, Osaka University, Japan Alexander Serebrenik, Eindhoven University of Technology, The Netherlands Replication and Negative Results Track Co-Chairs Xin Peng, Fudan University, China Foutse Khomh, École Polytechnique, Canada Engineering Track Program Co-Chairs Nikolaos Tsantalis, Concordia University, Canada Hitesh Sajnani, Microsoft Inc, USA Proceedings Co-Chairs Manar Alalfi, Ryerson University, Canada Kevin Schneider, University of Saskatchewan, Canada Local Chair Paige Rodeghero, Clemson University, USA Finance Chair Dave Binkley, Loyola University, USA Awards Committee Co-Chairs Sibylle Schupp, Hamburg University of Technology, Germany Neil Ernst, University of Victoria, Canada Arpad Beszedes, University of Szeged, Hungary David Shepherd, ABB Corporate Research, USA Publicity Chair Banani Roy, University of Saskatchewan, Canada Social Media Chair Felienne Hermans, Leiden University, The Netherlands Web Chair Masud Rahman, University of Saskatchewan, Canada Banani Roy, PhD Assistant Professor, Department of Computer Science, University of Saskatchewan, Canada Phone: 306-966-2475 Web: http://srlab-new.usask.ca/broy/

1 0

CfP: Workshop on Program Transformation for Programmability in Heterogeneous Architectures (Co-located with CGO16); Deadline Jan 15
by Guillermo Vigueras 02 Feb '16

02 Feb '16

[Apologies if you have gotten multiple copies of this announcement.] ********************************************************************************* PROHA 2016, CALL FOR PAPERS First Workshop on Program Transformation for Programmability in Heterogeneous Architectures http://goo.gl/RzGbzY Barcelona, 12th March 2016, in conjunction with the CGO'16 Conference ********************************************************************************* Important Dates: Paper submission deadline: 15 January 2016 23:59 (UTC) Author notification: 5 February 2016 Final manuscript due: 26 February 2016 Scope: Developing and maintaining high-performance applications and libraries for heterogeneous architectures is a difficult task, usually requiring code transformations performed by an expert. Tools assisting in and, if possible, automating such transformations are of course of great interest. However, such tools require significant knowledge and reasoning capabilities. For example, the former could be a machine-understandable descriptions of what a piece of code is expected to do, while the latter could be a set of transformations and a corresponding logical context in which they are applicable, respectively. Furthermore, strategies to identify the sequence of transformations leading to the best resulting code need to be elaborated. This workshop will focus on techniques and foundations which make it possible to perform source code transformations, which preserve the intended semantics of the original code and improve efficiency, portability or maintainability. The topics of interest for the workshop include, but are not limited to: * Program annotations to capture algorithmic properties and intended code semantics. * Programming paradigms able to express underlying (mathematical) properties of code. * Usage of dynamic and static mechanisms to infer relevant code properties. * Transformations which preserve intended semantics. * Strategies to apply transformations. * Heuristics to guide program transformation and techniques to synthesize / learn these heuristics. * Tools Submission Guidelines: Submissions are to be written in English and not exceed 10 pages, including bibliography. Submissions should be written in ACM double-column format using a 10-point type. Authors should follow the information for formatting ACM SIGPLAN conference papers, which can be found at http://www.sigplan.org/Resources/Author . Authors should submit their papers in pdf format using the EasyChair submission website https://easychair.org/conferences/?conf=proha2016 . Publication: The proceedings will be made publicly available through ArXiV. Workshop Organizers: - Manuel Carro, IMDEA Software Institute and Technical University of Madrid - Colin W. Glass, University of Stuttgart - Jan Kuper, University of Twente - Julio Mariño, Technical University of Madrid - Lutz Schubert, University of Ulm - Guillermo Vigueras, IMDEA Software Institute - Salvador Tamarit, Technical University of Madrid If you have any questions, please contact the program chair at manuel.carro(a)imdea.org -- Dr. Guillermo Vigueras (PhD) Research Associate IMDEA Software Institute Campus Montegancedo s/n 28223 Pozuelo de Alarcon, Madrid SPAIN Tel: +34911012202 (ext. 4165) Fax: +34911011358

1 3

Call for Papers: Kiel Declarative Programming Days 2013
by mh＠informatik.uni-kiel.de 27 Jun '13

27 Jun '13

====================================================================== CALL FOR PAPERS Kiel Declarative Programming Days 2013 September 11-13, 2013 http://www-ps.informatik.uni-kiel.de/kdpd2013/ The Kiel Declarative Programming Days 2013 unifies the following events: * 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013, http://www.dcc.fc.up.pt/INAP-2013/) * 22nd International Workshop on Functional and (Constraint) Logic Programming (WFLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/) * 27th Workshop on Logic Programming (WLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/) All events will be jointly organized and have the same dates: Submission of papers: July 7, 2013 Notification of acceptance: July 28, 2013 Camera-ready papers: August 18, 2013 Please look into the web sites of the individual events for details about paper submissions. ======================================================================

1 0

Call for Papers: WFLP/WLP 2013
by mh＠informatik.uni-kiel.de 25 Mar '13

25 Mar '13

====================================================================== CALL FOR PAPERS WFLP 2013 22nd International Workshop on Functional and (Constraint) Logic Programming 27th Workshop on Logic Programming part of the Kiel Declarative Programming Days 2013 September 11-13, 2013, Kiel, Germany http://www-ps.informatik.uni-kiel.de/wflp2013/ ====================================================================== GENERAL WFLP 2013 is the combination of two workshops of a successful series of annual workshops on declarative programming. The international workshops on functional and logic programming aim at bringing together researchers interested in functional programming, logic programming, as well as their integration. The workshops on (constraint) logic programming serve as the scientific forum of the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence, and operations research. In this year both workshops will be jointly organized and co-located with the 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013) under the umbrella of the Kiel Declarative Programming Days in order to promote the cross-fertilizing exchange of ideas and experiences among researchers and students from the different communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. The technical program of the workshop will include invited talks, presentations of refereed papers and demo presentations. ---------------------------------------------------------------------- TOPICS The topics of interest include (but are not limited to): * Functional programming * Logic programming * Constraint programming * Deductive databases, data mining * Extensions of declarative languages, objects * Multi-paradigm declarative programming * Foundations, semantics, nonmonotonic reasoning, dynamics * Parallelism, concurrency * Program analysis, abstract interpretation * Program transformation, partial evaluation, meta-programming * Specification, verification, declarative debugging * Knowledge representation, machine learning * Interaction of declarative programming with other formalisms (e.g., agents, XML, Java) * Implementation of declarative languages * Advanced programming environments and tools * Software technique for declarative programming * Applications The primary focus is on new and original research results but submissions describing innovative products, prototypes under development, application systems, or interesting experiments (e.g., benchmarks) are also encouraged. ---------------------------------------------------------------------- IMPORTANT DATES Submission of papers: June 16, 2013 Notification of acceptance: July 18, 2013 Camera-ready papers: August 18, 2013 Workshop: September 11-13, 2013 ---------------------------------------------------------------------- SUBMISSION GUIDELINES 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). Papers can be submitted as technical papers or system descriptions. Technical papers should consist of up to 15 pages, system descriptions should be no longer than 6 pages. Formatting should follow the LNCS guidelines. The details about the procedure to submit papers electronically are described on the conference website. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. ---------------------------------------------------------------------- BEST NEWCOMER AWARD An award will be given to the best paper exclusively written by one or several young researchers who have not yet obtained their PhD degrees. Papers written in this category should be clearly marked as a "Student paper" in the submission. ---------------------------------------------------------------------- PROCEEDINGS All accepted papers will be published as a technical report. As for previous events, it is planned to publish selected papers as post-conference proceedings in the Springer LNCS series. Previous proceedings appeared as Springer LNCS volumes 6816 (WFLP 2011), 6559 (WFLP 2010), 5979 (WFLP 2009), 5437 (WLP 2007), and 3392 (WLP 2004). ---------------------------------------------------------------------- PROGRAM COMMITTEE Elvira Albert Universidad Complutense de Madrid, Spain Sergio Antoy Portland State University, USA Francois Bry University of Munich, Germany Juergen Dix University of Clausthal, Germany Rachid Echahed CNRS, University of Grenoble, France Moreno Falaschi Universita di Siena, Italy Sebastian Fischer Kiel, Germany Thom Fruehwirth University of Ulm, Germany Michael Hanus University of Kiel, Germany (Chair) Oleg Kiselyov Monterey (CA), USA Herbert Kuchen University of Muenster, Germany Francisco J. Lopez Fraguas Universidad Complutense de Madrid, Spain Torsten Schaub University of Potsdam, Germany Peter Schneider-Kamp University of Southern Denmark, Denmark Dietmar Seipel University of Wuerzburg, Germany Hans Tompits Vienna University of Technology, Austria German Vidal Universidad Politecnica de Valencia, Spain Janis Voigtlaender University of Bonn, Germany ---------------------------------------------------------------------- CONTACT Michael Hanus University of Kiel, Germany Email: mh(a)informatik.uni-kiel.de ----------------------------------------------------------------------

1 0

Inivitation to HASE 2012
by Sanjukta Bhowmick 04 Oct '12

04 Oct '12

Dear Colleague, The 14th IEEE International Symposium on High Assurance Systems Engineering (HASE 2012), will be held at Omaha NE. October 25-27. HASE 2012 is a forum on tools and techniques used to design and construct systems that, in addition to meeting their functional objectives, are safe, secure, and reliable. This years' keynote speakers include Kerry Kelly from the United States Strategic Command, Brad Masterson from First Data and Jeff Young from Union Pacific. We invite you to join us for an exciting conference on security and high assurance systems. Details of the conference program as well as information about registration and accommodation are available at http://hase2012.ist.unomaha.edu/. Sincerely, HASE 2012 Organizing Committee.

1 0

Call for Papers for HASE 2012
by Sanjukta Bhowmick 06 Jun '12

06 Jun '12

(We apologize if you have received multiple copies of this CFP) Dear Colleague We would like to invite you to submit papers to The 14th IEEE International Symposium on High Assurance Systems Engineering (HASE 2012), to be held at Omaha NE. October 25-27. HASE 2012 is a forum on tools and techniques used to design and construct systems that, in addition to meeting their functional objectives, are safe, secure, and reliable. Topics of interest include but are not limited to: SCADA systems and other critical infrastructures, cyber-physical systems, cloud computing, distributed systems, web services, embedded systems, emergent behavior, fault tolerance, simulation, monitoring, model-driven engineering, synthesis, formal methods, domain-specific languages, evolution and change, verification and validation, software analysis and visualization, tools, transformation-based development, security , as well as case studies and experiments. The following types of submissions are solicited: Research Papers HASE 2012 is soliciting original, unpublished research papers. The length is limited to eight pages, in IEEE style. More information can be found on the HASE 2012 website: http://hase2012.ist.unomaha.edu/ Fast Abstracts A fast abstract is a lightly reviewed, two-page technical article that requires a short talk at HASE. The goal of a fast abstract is to promote current work, research, practices, opinions, experiences, and issues related to any facet of high assurance systems. A fast abstract is early communication of technical work and does not require the completed results expected of a conference or journal publication. The length is limited to two pages, in IEEE style. Panel Proposals Proposals for panels are being solicited. Panels should focus on new challenges and emerging technologies related to high assurance systems, to stimulate a lively and thought provoking discussion. Controversial issues that encompass multiple viewpoints are desirable. The goal is to engage the audience with a lively debate that furthers their understanding of the topic. Panel proposals of at most two pages should be submitted by email, to rgandhi(a)unomaha.edu<mailto:rgandhi@unomaha.edu>, and should include the panel title and scope, and the organizers' contact information. The paper submission website is available at http://www.easychair.org/conferences/?conf=hase2012 Important Dates/Deadlines July 22, 2012 Paper Submission August 31, 2012 Paper Notification September 9, 2012 Camera-ready submission September 16, 2012 Preliminary Conference Program Sincerely, HASE 2012 Organizing Committee. Program Committee for HASE 2012 Ahamed Iqbal Marquette University, USA Babiceanu Radu University of Arkansas at Little Rock, USA Bastani Farrokh University of Texas at Dallas, USA Bharadwaj Ramesh Naval Research Laboratory, USA Bondavalli Andrea University of Florence, Italy Chunming Hu Beihang University Cukic Bojan West Virginia University, USA Dampier David Mississippi State University, USA Dimitrios Serpanos University of Patras Fu Jicheng University of Central Oklahoma, USA Gandhi Robin University of Nebraska at Omaha, USA Garg Vijay University of Texas at Austin, USA Ghafoor Arif Purdue University, USA Helene Waeselynck LAAS-CNRS Hong Zhu Oxford Brookes University Hurson Ali Missouri University of Science and Technology, USA I-Ling Yen University of Texas at Dallas Iyer Ravi University of Illinois, USA Kanoun Karama LAAS-CNRS, France Jianjun Zhao Shanghai Jiao Tong University Jie Xu University of Leeds Katerina Goseva West Virginia University Kenji Taguchi National Institute of Advanced Industrial Science and Technology (AIST), Japan Kenji Yoshigoe University of Arkansas at Little Rock Khan Farrukh Texas Southern University Liu Frank Missouri University of Science and Technology, USA Lu Jian Nanjing University, China Lu Xiaodong Tokyo Institute of Technology, Japan Lyu Michael Chinese University of Hong Kong McMillin Bruce Missouri University of Science and Technology, USA Mohammad Zulkernine Queen's University Neeraj Suri TU Darmstadt Pattabiraman Karthik University of British Columbia, Canada Paul Raymond Department of Defense Punnekkat Sasikumar Mälardalen University, Sweden Roach Steve University of Texas at El Paso, USA Rotella Pete Cisco Systems, USA Saglietti Francesca Universität Erlangen-Nürnberg, Germany Schoitsch Erwin Austrian Institute of Technology Sedigh Sahra Missouri University of Science and Technology, USA Seliya Naeem University of Michigan - Dearborn, USA Umit Topaloglu University of Arkansas for Medical Science Victor Winter University of Nebraska at Omaha, USA

1 0

[AD2012]: submission due date January/04/2012
by Jean Utke 15 Dec '11

15 Dec '11

***************************************************** AD2012 - Submissions Due on January/04/2012 ***************************************************** To accommodate multiple requests for extension we postponed the submission due date for AD2012 to January/04/2012. The 6th International Conference on Automatic Differentiation AD2012 will take place July 23-27, 2012 in Fort Collins, CO (USA). AD2012 is sponsored by SIAM. It represents a follow up on the previous conferences held in Breckenridge (USA), Santa Fe (USA), Nice (France), Chicago (USA); the last international conference in the series was held in Bonn (Germany) in 2008. Conference topics include: * algorithmic foundations of automatic differentiation (AD) * applications in science, engineering, and finance; especially ODE, DAE, inverse problems, and optimization * AD and numerical paradigms * higher-order derivatives * combinatorial problems in AD * AD tool design and implementation * exploitation of parallelism Contributed papers (limit 10 pages) must be submitted by January 4, 2012. Proceedings of all accepted papers will be published in the Springer LNCSE series. Invited presentations have been confirmed by: * Lorenz Biegler, Carnegie Mellon University, Pittsburgh PA, USA * Luca Capriotti, Credit Suisse, New York NY, USA * Don Estep, Colorado State University, Fort Collins CO, USA * Mary Hall, University of Utah, Salt Lake City UT, USA * Barbara Kaltenbacher, University of Graz, Austria * Markus Pueschel, ETH Zurich, Switzerland * Siegfried Rump, Hamburg University of Technology, Germany * Bert Speelpenning, MathPartners, Seattle, USA Details regarding the paper submission and further information about the conference are available at http://www.autodiff.org/ad12/ On behalf of the organizers, J. Utke

1 0

2nd CFP: 6th International Conference on Automatic Differentiation - AD2012
by Jean Utke 20 Oct '11

20 Oct '11

***************************************************** AD2012 - Second Call for Papers ***************************************************** The 6th International Conference on Automatic Differentiation AD2012 will take place July 23-27, 2012 in Fort Collins, CO (USA). AD2012 is sponsored by SIAM. It represents a follow up on the previous conferences held in Breckenridge (USA), Santa Fe (USA), Nice (France), Chicago (USA); the last international conference in the series was held in Bonn (Germany) in 2008. Conference topics include: * algorithmic foundations of automatic differentiation (AD) * applications in science, engineering, and finance; especially ODE, DAE, inverse problems, and optimization * AD and numerical paradigms * higher-order derivatives * combinatorial problems in AD * AD tool design and implementation * exploitation of parallelism Contributed papers (limit 10 pages) must be submitted by December 21, 2011. Proceedings of all accepted papers will be published in the Springer LNCSE series. Invited presentations have been confirmed by: * Lorenz Biegler, Carnegie Mellon University, Pittsburgh PA, USA * Luca Capriotti, Credit Suisse, New York NY, USA * Don Estep, Colorado State University, Fort Collins CO, USA * Mary Hall, University of Utah, Salt Lake City UT, USA * Barbara Kaltenbacher, University of Graz, Austria * Markus Pueschel, ETH Zurich, Switzerland * Siegfried Rump, Hamburg University of Technology, Germany * Bert Speelpenning, MathPartners, Seattle, USA Details regarding the paper submission and further information about the conference are available at http://www.autodiff.org/ad12/ On behalf of the organizers, J. Utke -- Jean Utke Argonne National Lab. / MCS (240-1156) 9700 S Cass Ave., Argonne, IL, 60439, USA phone +1 630 252 4552 / mobile +1 630 363 5753

2 1

CFP: 6th International Conference on Automatic Differentiation - AD2012
by Jean Utke 20 Jun '11

20 Jun '11

***************************************************** AD2012 - First Call for Papers ***************************************************** The 6th International Conference on Automatic Differentiation AD2012 will take place July 23-27, 2012 in Fort Collins, CO (USA). AD2012 is sponsored by SIAM. It represents a follow up on the previous conferences held in Breckenridge (USA), Santa Fe (USA), Nice (France), Chicago (USA); the last international conference in the series was held in Bonn (Germany) in 2008. Conference topics include: * algorithmic foundations of automatic differentiation (AD) * applications in science, engineering, and finance; especially ODE, DAE, inverse problems, and optimization * AD and numerical paradigms * higher-order derivatives * combinatorial problems in AD * AD tool design and implementation * exploitation of parallelism Contributed papers (limit 10 pages) must be submitted by December 21, 2011. Proceedings of all accepted papers will be published in the Springer LNCSE series. Invited presentations have been confirmed by: * Lorenz Biegler, Carnegie Mellon University, Pittsburgh PA, USA * Luca Capriotti, Credit Suisse, New York NY, USA * Don Estep, Colorado State University, Fort Collins CO, USA * Mary Hall, University of Utah, Salt Lake City UT, USA * Barbara Kaltenbacher, University of Graz, Austria * Markus Pueschel, ETH Zurich, Switzerland * Siegfried Rump, Hamburg University of Technology, Germany * Bert Speelpenning, MathPartners, Seattle, USA Details regarding the paper submission and further information about the conference are available at http://www.autodiff.org/ad12/ On behalf of the organizers, J. Utke -- Jean Utke Argonne National Lab. / MCS (240-1156) 9700 S Cass Ave., Argonne, IL, 60439, USA phone +1 630 252 4552 / mobile +1 630 363 5753

1 0

Call for Participation: PPDP 2011
by mh＠informatik.uni-kiel.de 23 May '11

23 May '11

====================================================================== CALL FOR PARTICIPATION PPDP 2011 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www-ps.informatik.uni-kiel.de/ppdp11/ July 20-22, 2011, Odense, Denmark In cooperation with ACM SIGPLAN Co-located with LOPSTR 2011, WFLP 2011, and AAIP 2011 ====================================================================== ONLINE REGISTRATION IS OPEN, EARLY REGISTRATION DEADLINE: May 30, 2011 PPDP 2011 aims to provide a forum that brings together researchers from the declarative programming communities, including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for example, in the semantic web. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, including mechanisms for mobility, modularity, concurrency, object-orientation, security, and static analysis. SYMPOSIUM PROGRAM (preliminary): Wednesday, July 20, 2011: 9:00 - 10:00: PPDP/LOPSTR Invited Talk * Fritz Henglein. <TBA> Coffee break 10:30 - 11:30: PPDP/LOPSTR Invited Talk * Vitaly Lagoon. The Challenges of Constraint-Based Test Generation Coffee break 11:30 - 12:30: Session 1: Verification and Specification * Felix Schernhammer and Jose Meseguer. Incremental Checking of Well-Founded Recursive Specifications Modulo Axioms * Kazuhiro Inaba, Soichiro Hidaka, Zhenjiang Hu, Hiroyuki Kato and Keisuke Nakano. Graph-Transformation Verification using Monadic Second-Order Logic Lunch and Excursion Thursday, July 21, 2011: 9:00 - 10:00: Session 2: Declarative Languages * Robert Giegerich, Stefan Janssen and Georg Sauthoff. Bellman's GAP - A Declarative Language for Dynamic Programming * Rafael Del Vado Vírseda and Fernando Pérez Morente. A Modular Semantics for Higher-Order Declarative Programming with Constraints Coffee break 10:30 - 12:30: Session 3: Analysis * Jan Christiansen and Daniel Seidel. Minimally Strict Polymorphic Functions * Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, Jose Meseguer, Paliath Narendran and Ralf Sasse. Protocol Analysis in Maude-NPA Using Unification Modulo Homomorphic Encryption * Tony Bourdier and Horatiu Cirstea. Symbolic analysis of network security policies using rewrite systems * Dario Colazzo and Carlo Sartiani. Precision and Complexity of XQuery Type Inference Lunch break 14:00 - 15:00: Session 4: Concurrency * David Sabel and Manfred Schmidt-Schauss. A Contextual Semantics for Concurrent Haskell with Futures * Jasmin Christian Blanchette, Tjark Weber, Mark Batty, Scott Owens, Susmit Sarkar. Nitpicking C++ Concurrency Coffee break 15:30 - 16:30: Session 5: Logic Programming and Constraints * Vivek Nigam, Limin Jia, Boon Thau Loo and Andre Scedrov. Maintaining Distributed Logic Programs Incrementally * Rémy Haemmerlé, Pedro Lòopez-Garcìa and Manuel V. Hermenegildo. CLP Projection for Constraint Handling Rules Friday, July 22, 2011: 9:00 - 10:00: PPDP Invited Talk * Andrey Rybalchenko. Towards Automatic Synthesis of Software Verification Tools Coffee break 10:30 - 12:30: Session 6: Types and Lambda Calculus * Malgorzata Biernacka, Dariusz Biernacki and Serguei Lenglet. Typing Control Operators in the CPS Hierarchy * Bernardo Toninho, Luis Caires and Frank Pfenning. Dependent Session Types via Intuitionistic Linear Type Theory * Sandra Alves, Maribel Fernandez, Mário Florido and Ian Mackie. Recursion in a linear typed lambda-calculus * Nicolas Guenot. Nested Proof Search as Reduction in the lambda-calculus Lunch break and Closing ----------------------------------------------------------------------

1 0

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

sts