Ciao-users April 2008

ciao-users@cliplab.org

4 participants
4 discussions

PLID'08 - 2nd Call for Contributions
by Samir Genaim 19 Apr '08

19 Apr '08

********************************************************* * The Fourth International Workshop * * on * * Programming Language Interference and Dependence * * * * co-located with LOPSTR'08, PPDP'08 and SAS'08 * * * * 15 July, 2008, Valencia, Spain * * * * Venue: The Technical University of Valencia * * * * 2nd Call for Contributions * * * * http://www.clip.dia.fi.upm.es/Conferences/PLID08 * * * ********************************************************* Important Dates =============== Expression of interest June 1, 2008 Extended abstract June 15, 2008 Workshop July 15, 2008 Workshop Description ==================== 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, systems specification, model checking, program manipulation, program slicing, reverse engineering, data mining, distributed databases and systems biology. Doing these things requires theories, models and semantics for interference and dependence, as well as 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 and assisting work towards a common goal, providing the appropriate environment for reasoning about the state of the art in interference and dependence. Topics of interest include but are not limited to: * Security against unwanted interference and dependence * Models and theories of program interference * Algorithms for reducing or removing interference or for ameliorating its effects * Theory and foundations of program slicing and related dependence analyses * Resource declassification theories * Semantics of dependence and interference * Analyses based on interference and dependence * Abstract interpretation for dependence and interference * Dependence and interference in specifications * Slicing models and specifications * Interaction between dependence and refinement Keynote Speaker =============== Gilles Barthe, IMDEA-software (Madrid, Spain) Submission ========== The workshop welcomes contributions of on-going work and ideas in the field of dependence and interference. Those who are interested in having a talk at the workshop and/or discussing issues related with these subjects are invited to send your expression of interest to Samir Genaim (samir at clip.dia.fi.upm.es) before June 1st, 2008. There will be no formal publication of papers. A web-page will be organised collecting all the workshop contributions. Submitted extended abstracts should be of at most 10 pages LNCS-style and should be sent before June 15th 2008. Program Committee ================= David Clark Kings College, London, UK Sebastian Danicic University of London, UK Samir Genaim (chair) Technical University of Madrid, Spain Roberto Giacobazzi University of Verona, Italy Daniele Gorla University of Roma, Italy Sebastian Hunt City University, London, UK Herbert Wiklicky Imperial College, London, UK Steve Zdancewic University of Pennsylvania, USA Local organization chair ======================== Christophe Joubert Technical University of Valencia / DSIC ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

Re: unification with occurs check
by ciao＠clip.dia.fi.upm.es 08 Apr '08

08 Apr '08

AFAIK you cannot simply turn on occurs check in standard unifications, but it seems easy to write a simple package to do it by "peeling off" (i.e., normalizing) clauses and using unify_with_occurs_check/2 instead of =/2: ------------------------------------------------------------- :- use_package(use_occurs_check). p(f(a), X, b) :- ... ------------------------------------------------------------- ==> ------------------------------------------------------------- p(A1, X, A3) :- unify_with_occurs_check(A1,f(a)), unify_with_occurs_check(A3,b), ... ------------------------------------------------------------- You may also be able to work out a slightly smarter transformation that preserves indexing. If you do develop such a package please add it to the repository! Cheers --Manuel H -- ----------------------- The Ciao System Development Team -------------------- The CLIP Group | Technical University of Madrid ciao(a)clip.dia.fi.upm.es | University of New Mexico http://www.cliplab.org / http://www.ciaohome.org ----------------------------------------------------------------------------- ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

LPAR 2008 (Qatar) CFP
by geoff＠cs.miami.edu 07 Apr '08

07 Apr '08

---------------------------------------------------------------------------- LPAR 2008 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning Doha, Qatar November 22-27, 2008 http://www.qatar.cmu.edu/lpar08/ The series of International Conferences on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is a forum where, year after year, some of the most renowned researchers in the areas of automated reasoning, computational logic, programming languages and their applications come to present cutting-edge results, to discuss advances in these fields, and to exchange ideas in a scientifically emerging part of the world. The 2008 edition will be held in Doha, Qatar, on the premises of the Qatar campus of Carnegie Mellon University. Logic is a fundamental organizing principle in nearly all areas in Computer Science. It runs a multifaceted gamut from the foundational to the applied. At one extreme, it underlies computability and complexity theory and the formal semantics of programming languages. At the other, it drives billions of gates every day in the digital circuits of processors of all kinds. Logic is in itself a powerful programming paradigm but it is also the quintessential specification language for anything ranging from real-time critical systems to networked infrastructures. It is logical techniques that link implementation and specification through formal methods such as automated theorem proving and model checking. Logic is also the stuff of knowledge representation and artificial intelligence. Because of its ubiquity, logic has acquired a central role in Computer Science education. New results in the fields of computational logic and applications are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories and practices. Topics of interest include, but are not limited to: * Automated reasoning * Interactive theorem proving * Implementations of logic * Proof assistants * Program and system verification * Model checking * Rewriting and unification * Logic programming * Constraint programming * Logic and databases * Modal and temporal logics * Proof-carrying code * Translation validation * Logic for the semantic web * Foundations of security * Description logics * Non-monotonic reasoning * Specification using logics * Logic in artificial intelligence * Lambda calculus * Constructive logic and type theory * Computional interpretations of logic * Logical foundations of programming * Logical aspects of concurrency * Logic and computational complexity * Knowledge representation and reasoning * Reasoning about actions * Proof planning * Effectively presented structures * Logic of distributed systems Invited Speakers ---------------- It has been a tradition of LPAR to invite some of the most influential researchers in the focus areas to discuss their work and their vision for their fields. We are honored that the following members of the community have accepted this invitation. * Edmund Clarke, Carnegie Mellon University (USA) Other invited speakers will be announced soon Submission Instructions ----------------------- Submissions must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be submitted in Portable Document Format (PDF); papers submitted in a proprietary word processor format such as Microsoft Word cannot be considered. Submissions can be of two types: * Regular papers are meant to describe solid new research results. They can be up to 15 pages long in LNCS style, including figures, bibliography and appendices. * Short papers are intended to report on interesting work in progress. They can be at most 5 pages long in the LNCS style. Papers can be electronically submitted by visiting http://www.easychair.org/conferences/?conf=3Dlpar2008 . Prospective authors are required to register a title and an abstract a week before the paper submission deadline (see below). As with the previous editions, the accepted regular papers of LPAR'08 will be published in Springer-Verlag's Lecture Notes in Computer Science series. They will be available at the conference. Programme Committe Chairs ------------------------- * Iliano Cervesato (Carnegie Mellon University, Qatar) * Helmut Veith (Technische Universit=E4t Darmstadt, Germany) * Andrei Voronkov (University of Manchester, UK) Participation ------------- Authors of accepted papers are required to ensure that at least one of them will be present at the conference. Papers that do not adhere to this policy will be removed from the proceedings. Important Dates --------------- Abstract submission deadline: 26 May 2008 Paper submission deadline: 06 June 2008 Notification of acceptance: 29 August 2008 Camera-ready papers: 19 September 2008 LPAR'08 Workshops: 22 November 2008 LPAR 2008: 23-27 November 2008 ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

unification with occurs check
by Juan Chanco 07 Apr '08

07 Apr '08

Greetings, I am wondering if it is possible, in the SVN version of Ciao, to enable the occurs check in unification? i know there is the "unify_with_occurs_check" predicate as part of the "iso_misc" module, but i was wondering if there might be a directive or flag that could be set, as well. I'm doing some work with a different unification algorithm (higher order unification) and need to "level the playing field" for some performance tests. thanks, juan chanco ============================================================================== Message: Address: Action: help majordomo(a)clip.dia.fi.upm.es Info. on useful commands subscribe ciao-users-request(a)clip.dia.fi.upm.es Subscribe to this list unsubscribe ciao-users-request(a)clip.dia.fi.upm.es Unsubscribe from this list <whatever> ciao-users(a)clip.dia.fi.upm.es Send message to list ----------------------------------------------------------------------------- Archived messages: http://www.clip.dia.fi.upm.es/Mail/ciao-users/ -----------------------------------------------------------------------------

1 0

2026

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

Ciao-users April 2008