We apologize if you receive multiple copies of this email.=20
See below on how to unsubscribe.=20
.............................................................
Call for Submissions to Workshops
=09
Affiliated with
The 20th International Conference on
Computer Aided Verification
CAV 2008
http://www.princeton.edu/cav2008
.............................................................
Note: Not all workshops have open submissions.
FAC '08: 2nd Workshop on Formal Verification of Analog Circuits
---------------------------------------------------------------
*** Submission deadline: April 1st, 2008 ***
http://www.em.informatik.uni-frankfurt.de/FAC08.html
Organizers: Lars Hedrich and Oded Maler=20
While formal verification has become part of the design process of
digital circuits, its application to analog and mixed-signal design is
still in its infancy. This is mainly due to the fact that the
mathematical models for such circuits are very different from the
discrete, finite-state transition systems that underlie verification of
digital systems. Such models are based on continuous dynamical systems
governed by differential equations and their verification calls for
different techniques, like those developed in the analysis of hybrid
systems. This workshop intends to bring together practitioners in
circuit design and in EDA tools together with researchers in
verification of discrete and hybrid systems in order to understand the
problems faced by designers of analog circuits and to see what support
can be provided by existing and new verification techniques.
AFM08: Automated Formal Methods
-------------------------------
http://fm.csl.sri.com/AFM08/
Organizers: Bruno Dutertre, Sam Owre, John Rushby, N. Shankar, Ashish
Tiwari
AFM functions both as a user's meeting for the SRI tools PVS, SAL, and
Yices, and as a general workshop for those interested in
state-of-the-art automation for formal methods. The workshop will
include short tutorials on effective use of PVS, SAL, and Yices, as well
as contributed papers that report on applications, case studies, and
experiments, as well as fresh ideas for enhancing the scale and range of
automated formal methods.
BPR 2008: 1st International Workshop on Bit-Precise Reasoning
-------------------------------------------------------------
http://www.cs.ubc.ca/~babic/index_bpr.htm
Organizers: Domagoj Babic, Amit Goel
Bit-Precise Reasoning (BPR) is increasingly being used for the analysis
of hardware and software systems. The aim of the workshop is to bring
together researchers working on BPR with users of BPR. Relevant topics
include, but are not limited to: applications of BPR and case studies,
new decision procedures for bit-vector arithmetic, combinations with
other theories, theoretical results, novel implementation techniques, as
well as benchmarks and evaluation methodology.
(EC)^2: Exploiting Concurrency Efficiently and Correctly
--------------------------------------------------------
http://www.cs.utah.edu/ec2/
Rajeev Alur, Ganesh Gopalakrishnan, Vineet Kahlon, Stephen Siegel
(EC)^2 will bring together formal methods researchers with experts in
multicore architectures, programming languages, and concurrency
libraries. The two day-workshop will feature six invited talks and the
opportunity for participants to present position papers on issues such
as transactional memory, programming constructs for concurrency,
formalization of concurrency libraries, verification, and hardware
support for correctness. See the workshop website for submission
instructions and further details.
HAV 2008: Heap Analysis and Verification
----------------------------------------
http://research.microsoft.com/~jjb/HAV2008/index.html
Organizers: Josh Berdine, Mooly Sagiv
The Heap Analysis and Verification (HAV) 2008 workshop aims to bring
together researchers to exchange the latest, and develop new, ideas in
all aspects of formal analysis and verification for heap-manipulating
software.
NSV 2008: First International Workshop on Numerical Abstractions for
Software Verification
------------------------------------------------------------------------
----
http://theory.stanford.edu/~srirams/nsv/index.html
Organizers: Franjo Ivancic, Sriram Sankaranarayanan and Chao Wang
This workshop will focus on various issues related to the handling of
numerical operations in software verification. The workshop brings
together eight invited speakers who will present various techniques for
numerical reasoning in software, and their application to important
software verification problems for embedded systems such as safety,
termination, timing analysis and so on.
SMT 2008: Sixth International Workshop on Satisfiability Modulo Theories
------------------------------------------------------------------------
http://research.microsoft.com/conferences/SMT08/
Organizers: Clark Barrett, Leonardo de Moura
Determining the satisfiability of first-order formulas modulo background
theories, known as the Satisfiability Modulo Theories (SMT) problem, has
proved to be very useful in verification, compiler optimization,
scheduling, and other areas. The aim of the SMT workshop is to bring
together researchers working on SMT and users of SMT techniques.
.....................................................................
We apologize if you receive multiple copies of this email.
If you do not want any further announcements regarding CAV 2008, reply
to this email and put 'UNSUBSCRIBE' in the body or subject of your
reply.
==============================================================================
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/
-----------------------------------------------------------------------------
Hello,
Is there an easy way to convert a list of codes into an arbitrary
term? atom_codes/2 and number_codes/2 both assume that the list of
codes represents a specific type of data. Is there something that
functions more like read_term but over an internal list of codes
rather than an input stream?
In SWI it can be achieved using:
term_codes(Term,Codes) :-
atom_codes(A,Codes),
atom_to_term(A,Term).
I couldn't find anything related in the Ciao Manual and was wondering
how to go about writing:
term_codes(Term,Codes) :-
... ?
Amoss
==============================================================================
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/
-----------------------------------------------------------------------------
2ND CALL FOR PARTICIPATION
6TH INTERNATIONAL SUMMER SCHOOL ON ADVANCED FUNCTIONAL PROGRAMMING 2008=20
(AFP =9208)
RADBOUD UNIVERSITY NIJMEGEN AND UTRECHT UNIVERSITY, THE NETHERLANDS
MAY 19-24, 2008
http://www.st.cs.ru.nl/AFP_TFP_2008/
[ EARLY REGISTRATION OPENS ]
AFP is a series of international summer schools which aims to
bring computer scientists, in particular young researchers and
programmers, up to date with the latest advances in practical
advanced functional programming. Functional programming
emphasizes the evaluation of expressions rather than the
execution of commands. We focus on functional programming
techniques in =93programming in the real world=94 and bridge the
gap between results presented at programming conferences and
material from textbooks on functional programming. In this
school you will receive in depth lectures about advanced
functional programming techniques, taught by experts in the
field. Lectures are accompanied by practical problems to be
solved by the students at the school.
AFP 2008 is hosted by the Radboud University Nijmegen, and
Utrecht University, The Netherlands, and will be held in the
rural setting of Center Parcs =93Het Heijderbos=94, Heijen (in the
vicinity of Nijmegen), The Netherlands.
AFP 2008 is co-located with the 9th Symposium on Trends in
Functional Programming (TFP=9208), which is held after AFP=9208.
PROGRAM INFORMATION
The following speakers will give the lectures (in alphabetic
order):
Umut Acar (Toyota Technological Institute,
University of Chicago, US)
Richard Bird (University of Oxford, UK)
Olivier Danvy (University of Aarhus, DK)
Johan Jeuring (Utrecht University, NL)
Mark Jones (Portland State University, US)
Ulf Norell (Chalmers University, SE)
Simon Peyton Jones (Microsoft Research, UK)
Rinus Plasmeijer (Radboud University Nijmegen, NL)
During the summer school, all participants receive printed
lecture notes. Participants are expected to have a notebook,
in order to be able to participate with the practical problems.
After the summer school, all lecture notes will be revised,
reviewed, and published in the LNCS series of Springer. All
registered participants receive a copy of these lecture notes.
VENUE INFORMATION
AFP (and TFP) is held in The Netherlands, at Center Parcs =93Het
Heijderbos=94 which is a holiday resort in the woodlands near the
city of Nijmegen. We accomodate participants in DeLuxe Cottages,
each of which has three separate bed-rooms, shared bathroom,
toilet, kitchen, and terrace. Cottages will be shared by three
participants. If you wish to reduce costs, you can choose to
share a bedroom. The summer school and symposium will take place
in the business center of the venue. Breakfast, lunch and diner
is included within the limits of the venue. The resort features,
amongst others, a sub-tropical swimming pool (free for
participants), restaurants, shops, water sports lake, midget golf
court, squash court, and outdoor and indoor tennis courts.
Nijmegen is considered to be the oldest city of the Netherlands,
being approximately 2000 years old. Nijmegen is located at the
east border of the Netherlands, near Germany. Nijmegen can be
reached easily from several airports such as Schiphol airport,
Eindhoven airport, and D=FCsseldorf airport, as well as by train
and car. Conveniently close to Center Parcs =93Het Heijderbos=94 you
will find airport Weeze in Germany. The venue Center Parcs =93Het
Heijderbos=94 can be reached from Nijmegen by train to Boxmeer
(25 minutes). From there you will need to order a taxi. The venue
can also be reached by car: parking is free for participants of
AFP and TFP.
SUMMER SCHOOL FEES
AFP 2008 includes accommodation, conference, breakfast =96 lunch =96
diner, speakers, and proceedings costs. The early registration fee
is =80 995; the late registration fee is =80 1095. Please note that if
you require financial support, you can apply for a grant (see
below).
GRANT INFORMATION
We have taken great care to reduce the registration cost as much
as possible. We can grant a subsidy for a limited number of PhD
student participants for whom the costs are still too high. In
order to apply for this subsidy, you need to send (by surface mail
or e-mail) a request for subsidy which contains your personal
information, affiliation, a description of your current status,
project description, a motivation why you should receive the grant,
and a recommendation from your PhD supervisor. This letter should
arrive before april 7 2008 to:
Rinus Plasmeijer
Radboud University Nijmegen
Toernooiveld 1
6525ED Nijmegen
rinus(a)cs.ru.nl
You will receive a notification whether your request has been
granted before april 14 2008.
REGISTRATION INFORMATION
Early registration opens at march 1 2008. Late registration opens
at april 15 2008. Registration closes at may 5 2008. We can not
guarantee accommodation in case you wish to register later than
may 5 2008.
IMPORTANT DATES (ALL 2008)
Early Registration Opens: March 1
Early Registration Deadline: April 14
Late Registration Opens: April 15
Late Registration Deadline: May 5
AFP Summer School: May 19-24
ORGANIZATION
Programme Chair: Rinus Plasmeijer, Pieter Koopman, Radboud
University Nijmegen, NL
Doaitse Swierstra, Utrecht University, NL
Arrangements: Peter Achten, Simone Meeuwsen, Radboud University
Nijmegen, NL
E-mail: afp_tfp_2008(a)cs.ru.nl
==============================================================================
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/
-----------------------------------------------------------------------------
Funding is available for the following five PhD studentships within
the TCS group at the University of Kent. Applicants should contact the
project supervisor directly for further details.
Project Supervisor: Dr Eerke Boiten (E.A.Boiten(a)kent.ac.uk)
Project Title: Reasoning about Scratch Cards
Scratch cards are used widely in lotteries and games, and recently
also in e-voting protocols. However, public confidence in e-voting is
very low. This research project can make a difference by developing
mathematical and logical abstractions of scratch cards that allow
formal reasoning, and consequently watertight proofs of the security of
protocols using them. This would be a great project if you are interested
in practical symbolic reasoning; knowledge of security, cryptography,
formal methods, probability, or logics would be a bonus.
Project Supervisor: Dr Olaf Chitil (O.Chitil(a)kent.ac.uk)
Project Title: Tracing Functional Programs with Hat
Hat (www.haskell.org/hat) is a sophisticated tool for locating faults in
Haskell programs. Hat consists of a trace generation system plus various
tools for viewing a trace. The aim of the research project is to improve
Hat by both extending it and easing its application in practise: (1)
Apply several theoretical results of a recent EPSRC project on tracing
in Hat (e.g. algorithmic debugging with functions as finite maps). (2)
Integrate the trace generator of Hat into the byte code interpreter
of the Glasgow Haskell system (GHC). (3) Enable traced code to call
and be called from unmodified non-tracing code, such that Hat can use
pre-compiled libraries of GHC.
Project Title: The Essence of Transfinite Reductions
Project Supervisor: Dr Stefan Kahrs (S.M.Kahrs(a)kent.ac.uk)
Infinitary Rewriting is an area of Term Rewriting in which research has
studied infinitary terms and infinitary reductions. While the notion of
infinitary terms is fairly settled, the existing notions of infinitary
reduction leave a lot to be desired - the definitions are suspiciously
complicated, the established results less than impressive. Thus, there
appears to be a lot of room for improvement. There are different angles
that are worth exploring. Firstly, there are several alternative ways
to define transfinite reductions. Secondly, one would hope that some of
these alternative ways lead to good properties of transfinite reduction.
Thirdly, it is not even a priori clear what would constitute such a
good property.
Project Title: Finding Security Bugs in x86 code
Project Supervisor: Dr Andy King (A.M.King(a)kent.ac.uk)
The project will investigate how security vulnerabilities can be
automatically located in x86 code. Rather than trap a fault when it occurs
as the program is running, the project will devise compile-time techniques
for locating faults before the program is executed. The project will
apply techniques from compiling, constraint solving and semantics,
though the applicant need not have expertise in all these fields.
Project Title: Refactoring Proofs
Project Supervisor: Prof Simon Thompson (S.J.Thompson(a)kent.ac.uk)
Refactoring allows the programmer to modify the design or structure of
a program without changing its behaviour. Recent work in the Functional
Programming group at Kent has developed refactoring systems for Haskell 98
(HaRe) and Erlang (Wrangler). Programming and proof have much in common,
and indeed under the "propositions as types" analogy, they are different
views of the same objects. The aim of this project is to explore how
refactoring can be incorporated into proof development systems, and will
combine theoretical work, implementation and usability analysis to ensure
that the results will be of value to users of proof assistants. The aim
of this project is to investigate refactoring for proofs.
==============================================================================
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/
-----------------------------------------------------------------------------
=================== [Apologies for multiple postings] ===================
SCC 2008
First International Conference on Symbolic Computation and Cryptography
http://www.cc4cm.org/scc2008
Beijing, China, April 28-30, 2008
SECOND CALL FOR PAPERS
************ Extended submission deadline: February 24, 2008 ************
SCC 2008 is the first of a new series of conferences where research and
development in symbolic computation and cryptography may be presented and
discussed. It is organized in response to the growing interest in applying
and developing methods, techniques, and software tools of symbolic computation
for cryptography. The use of lattice reduction algorithms in cryptology and
the application of Groebner bases in the context of algebraic attacks are
typical examples of explored applications.
SCC 2008 aims at providing an interactive forum for interested researchers
to exchange ideas and views, to present research results and progress, and
to learn and discuss recent developments and emerging problems on
- the design, modeling, and analysis of cryptographic systems and protocols
for which symbolic computation may be used or needed, and
- the design, implementation, and analysis of algorithms and software tools
of symbolic computation that may have potential applications in cryptography.
TOPICS
Specific topics for SCC 2008 include, but are not limited to:
- Multivariate cryptography, braid group cryptography, noncommutative
cryptography, and quantum cryptography
- Code-based, factorization-based, and lattice-based cryptography
- Algebraic attacks for block ciphers, stream ciphers, and hash functions
- Design and analysis of algebraic, elliptic, and embedded cryptographic
systems and protocols
- Groebner basis techniques in cryptology, algebraic number theory, and
coding theory
- Triangular sets and new techniques for solving algebraic systems over
finite fields
- Algorithms and software for symbolic computation in cryptography
INVITED SPEAKERS
Bruno Buchberger (Johannes Kepler Universitaet Linz, Austria)
Adi Shamir (Weizmann Institute of Science, Israel)
Xiaoyun Wang (Tsinghua University and Shandong University, China)
SUBMISSION
Potential participants of SCC 2008 are invited to submit extended
abstracts of 3-5 pages or full papers describing their work to be
presented at the conference. The submitted extended abstracts and
full papers will be reviewed by members of the program committee (PC)
for soundness and relevance to the conference. Submission of original
research papers is encouraged, while published material and work in
progress will also be considered for presentation at the conference.
Extended abstracts and full papers should be prepared using LaTeX with
the style file available on the SCC 2008 webpage and according to the
instructions given therein. Submissions must be done electronically
via EasyChair at http://www.easychair.org/conferences/?conf=scc2008 or
sent in PDF or PS format as e-mail attachments to scc2008 @ cc4cm.org.
Accepted extended abstracts and full papers will be printed in the
proceedings of SCC 2008 for distribution at the conference.
PUBLICATION
Authors of the extended abstracts and full papers accepted for
presentation at the conference will be invited to submit their full
and/or revised papers for publication in special issues of
Mathematics in Computer Science (MCS - http://www.cc4cm.org/mcs) by
Birkhauser/Springer after the meeting. The submitted papers will be
formally reviewed by PC members and external referees according to
the standard refereeing procedure of MCS.
IMPORTANT DATES
Extended deadline for extended abstract submission:
February 24, 2008
Notification of acceptance or rejection: March 16, 2008
Conference taking place: April 28-30, 2008
Deadline for full paper submission: June 30, 2008
GENERAL CHAIR
Zhiming Zheng (China)
PROGRAM COMMITTEE
Anne Canteaut (France) Jintai Ding (USA)
Jean-Charles Faugere, Co-chair (France) Joachim von zur Gathen (Germany)
Pierrick Gaudry (France) Jaime Gutierrez (Spain)
Hoon Hong (USA) Antoine Joux (France)
Martin Kreuzer (Germany) Dongdai Lin (China)
Zhuojun Liu (China) Alexander May (Germany)
Ludovic Perret (France) Igor Shparlinski (Australia)
Damien Stehle (France) Rainer Steinwandt (USA)
Boaz Tsaban (Israel) Dongming Wang, Co-chair
(China/France)
LOCAL ARRANGEMENTS
Shangzhi Li, Chair (China) Jinxi Ma (China) Chenqi Mou (China)
=========================================================================
==============================================================================
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/
-----------------------------------------------------------------------------
CALL FOR PARTICIPATION
AITA08
Architectures for Intelligent Theory-Based Agents
March 26-28 2008,
Stanford University, California, USA.
We invite you to attend AITA08, the International Symposium on
Architectures for Intelligent Theory-Based Agents, to be held as part of
the AAAI Spring Symposium Series, March 26-28 2008, at Stanford University,
California, USA.
The focus of this symposium is the definition of architectures for
intelligent theory-based agents. These architectures typically comprise
languages, knowledge representation methodologies, reasoning algorithms,
and control loops.
The motivation of the symposium is the consideration that a number of
reasonably rigorous architectures have been designed, but not implemented,
that allow one to prove important properties about the agents and their
behavior, while other reasonably rigorous architectures have been
implemented without attendant proofs about their agents.
Unfortunately, there has not yet been much interaction among the groups
working on these two classes of architectures. The lack of communication
contributes to slowing the development of an otherwise interesting and
potentially very important area.
We intend to provide a forum to bring together researchers from these two
groups, promote interaction, and stimulate the investigation of the
relationships among the different approaches.
Key topics covered during the symposium are descriptions of specific
architectures, comparisons of architectures, surveys of the
state-of-the-art. The discussion will include overviews of languages,
knowledge representation methodologies, reasoning algorithms, and control
loops used in the architectures considered.
Further Information
The 2008 AAAI Spring Symposium Series will be held Wednesday - Friday,
March 26-28 at Stanford University. Registration and hotel information, as
well as an online registration form, are available at:
http://www.aaai.org/Symposia/Spring/sss08.php
Important dates:
* February 11, 2008: Sheraton Hotel reservation cut-off date
* February 26, 2008: Deadline for scholarship applications
* February 28, 2008: Notification of scholarship awards
* February 29, 2008: Final (open) registration deadline
* March 26-28, 2008: Symposium
Financial Aid
A limited number of scholarships is available for students attending the
symposium. Interested students can apply by sending a one-page description
of their research interests and a recommendation letter from their advisor
to Marcello Balduccini at aita08.aaai(a)gmail.com.
Organizing Committee
Marcello Balduccini, Texas Tech University/Kodak Research Labs; Chitta
Baral, Arizona State University; Thomas Eiter, Vienna University of
Technology; Alfredo Gabaldon, National ICT Australia; Stuart C. Shapiro,
University at Buffalo; Francesca Toni, Imperial College London.
Accepted Papers
The list of accepted papers is available at:
http://krlab.cs.ttu.edu/~marcy/aita08/accepted.htm
For More Information
For up-to-date information about the symposium please visit:
http://krlab.cs.ttu.edu/~marcy/aita08
==============================================================================
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/
-----------------------------------------------------------------------------
................................................................
ACM PPDP 2008 - Call For Papers
10th ACM-SIGPLAN* International Symposium on
Principles and Practice of Declarative Programming
Valencia, Spain, July 15-17, 2008
http://www.clip.dia.fi.upm.es/Conferences/PPDP08
................................................................
IMPORTANT DATES
Submission: April 10, 2008
Notification: May 15, 2008
Conference: July 15-17, 2008
SCOPE: PPDP 2008 is a forum for researchers and practitioners in
the declarative programming communities. It solicits papers on all
aspects of logic, constraint and functional programming, as well
as on related paradigms such as visual programming, executable
specification languages, database languages, AI and knowledge
representation languages for the "semantic web".
MAIN TOPICS: Logic, Constraint, and Functional Programming;
Database, AI and Knowledge Representation Languages; Visual
Programming; Executable Specification for Languages; Applications
of Declarative Programming; Methodologies for Program Design and
Development; Declarative Aspects of Object-Oriented Programming;
Concurrent Extensions to Declarative Languages; Declarative Mobile
Computing; Paradigm Integration; Proof Theoretic and Semantic
Foundations; Type and Module Systems; Program Analysis and
Verification; Program Transformation; Abstract Machines and
Compilation; Programming Environments.
PROCEEDINGS: The proceedings will be published by ACM Press*
RELATED EVENTS: PPDP 2008 will be co-located with the 15th
International Static Analysis Symposium (SAS 2008) and the 18th
International Symposium on Logic-Based Program Synthesis and
Transformation (LOPSTR 2008).
SYMPOSIUM CHAIR: Elvira Albert, Complutense University of Madrid
PROGRAM CHAIR: Sergio Antoy, Portland State University
PROGRAM COMMITTEE:
Elvira Albert Complutense University of Madrid, Spain
Sergio Antoy Portland State University, USA
Maribel Fernandez King's College, UK
Maurizio Gabbrielli University of Bologna, Italy
Joxan Jaffar National University, Singapore
Claude Kirchner INRIA Bordeaux, France
Herbert Kuchen University of Muenster, Germany
Kostis Sagonas Uppsala University, Sweden
Carsten Schurmann IT University of Copenhagen, Denmark
Peter Sestoft IT University of Copenhagen, Denmark
*ACM-SIGPLAN approval is pending
==============================================================================
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/
-----------------------------------------------------------------------------
................................................................
ACM PPDP 2008 - Call For Papers
10th ACM-SIGPLAN* International Symposium on
Principles and Practice of Declarative Programming
Valencia, Spain, July 15-17, 2008
http://www.clip.dia.fi.upm.es/Conferences/PPDP08
................................................................
IMPORTANT DATES
Submission: April 10, 2008
Notification: May 15, 2008
Conference: July 15-17, 2008
SCOPE: PPDP 2008 is a forum for researchers and practitioners in the
declarative programming communities. It solicits papers on all aspects
of logic, constraint and functional programming, as well as on related
paradigms such as visual programming, executable specification
languages, database languages, AI and knowledge representation
languages for the "semantic web".
MAIN TOPICS: Logic, Constraint, and Functional Programming; Database,
AI and Knowledge Representation Languages; Visual Programming;
Executable Specification for Languages; Applications of Declarative
Programming; Methodologies for Program Design and Development;
Declarative Aspects of Object-Oriented Programming; Concurrent
Extensions to Declarative Languages; Declarative Mobile Computing;
Paradigm Integration; Proof Theoretic and Semantic Foundations; Type
and Module Systems; Program Analysis and Verification; Program
Transformation; Abstract Machines and Compilation; Programming
Environments.
PROCEEDINGS: The proceedings will be published by ACM Press*
RELATED EVENTS: PPDP 2008 will be co-located with the 15th
International Static Analysis Symposium (SAS 2008) and the 18th
International Symposium on Logic-Based Program Synthesis and
Transformation (LOPSTR 2008).
SYMPOSIUM CHAIR: Elvira Albert, Complutense University of Madrid
PROGRAM CHAIR: Sergio Antoy, Portland State University
PROGRAM COMMITTEE:
Elvira Albert Complutense University of Madrid, Spain
Sergio Antoy Portland State University, USA
Maribel Fernandez King's College, UK
Maurizio Gabbrielli University of Bologna, Italy
Joxan Jaffar National University, Singapore
Claude Kirchner INRIA Bordeaux, France
Herbert Kuchen University of Muenster, Germany
Kostis Sagonas Uppsala University, Sweden
Carsten Schurmann IT University of Copenhagen, Denmark
Peter Sestoft IT University of Copenhagen, Denmark
*ACM-SIGPLAN approval is pending
==============================================================================
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/
-----------------------------------------------------------------------------
- Call for Papers -
Fifth Workshop on
MODEL CHECKING and ARTIFICIAL INTELLIGENCE (MoChArt-2008)
At ECAI-2008 - Patras, Greece, July 2008
http://www.csc.liv.ac.uk/~mjw/mochart/
INTRODUCTION
Model checking is the process of determining whether or not a formula
of some logic is satisfied by a model for the logic. For many logics
of interest -- particularly temporal and modal logics -- model
checking procedures can be efficiently automated. This has led to
widespread interest in the use of model checking as a technique for
verifying properties of systems, and the development of a number of
widely used model checking tools (e.g., Carnegie-Mellon's SMV,
Cadence-SMV, and AT&T's SPIN).
The success of model checking in the computer aided verification
community has led to a growth of interest in the use of model checking
in AI. The MOCHART workshop brings together both researchers in AI
with an interest in model checking, and researchers in model checking
who are interested in AI techniques.
Previous editions of the workshop were held in Riva del Garda, Italy
in 2006 (as satellite workshops of ECAI), San Francisco in 2005 (as
satellite workshop of Concur), Acapulco in 2003 (as satellite workshop
of IJCAI03), and Lyon in 2002 (as satellite workshop of ECAI02). We
are exploring the possibility of publishing a formal proceedings after
the event with Springer-Verlag.
TOPICS OF INTEREST
Topics of interest include (but are not limited to):
- Application of model checking techniques to AI problems.
- planning as model checking
- model checking for multi-agent systems
- diagnosis and model checking
- model checking versus theorem proving
- Model Checking and AI logics.
- model checking for combined modal/temporal logics
- model checking for logics of common sense reasoning
- Relations between different techniques used in the two fields for
similar purposes (e.g., reducing state explosion).
- New model checking techniques specifically for AI problems.
- Exploitation of AI techniques in model checking.
- AI approaches to the state explosion problem
- heuristics for model checking
- AI approaches to automatic abstraction
- Software tools for model checking in AI.
- languages and software platforms for AI model checking
- model checking symbolic reasoning systems & languages
- Model checking for verification of AI systems.
- automated verification of AI systems
- case studies & experience with model checking in AI
Preliminary papers and papers on applications are strongly encouraged.
IMPORTANT DATES
Deadline for submissions: April 10th, 2008
Notification: May 10th, 2008
Workshop: July 21st-22nd, 2008
SUBMISSION PROCEDURES
Submissions must be formatted according to Springer-Verlag's "Lecture
Notes in Computer Science" styles, and must be no more than 15 pages
in length. Papers must be submitted through the EasyChair web-based
conference management system: follow the link from the workshop web
page. All papers will be peer reviewed, and evaluated on the basis of
relevance, technical quality, significance, evaluation, and
presentation.
PARTICIPATION
The workshop forms part of the ECAI-2008 workshop programme, and as
such delegates must register for the ECAI conference. For full
information about ECAI-2008, including travel & accomodation, see:
ORGANISING COMMITTEE
* Doron Peled
Department of Computer Science
Bar-Ilan University
Ramat Gan, 52900 Israel
mailto:doron.peled(a)gmail.com
* Michael Wooldridge
Department of Computer Science
University of Liverpool
Liverpool L69 7ZF, United Kingdom
mailto:mjw(a)liv.ac.uk
PROGRAM COMMITTEE
* Rajeev Alur (USA)
* Massimo Benerecetti (Italy)
* Rafael Bordini (UK)
* Kousha Etessami (UK)
* Michael Fisher (UK)
* Gerard Holzmann (USA)
* Hadas Kress-Gazit (USA)
* Orna Kupferman (Israel)
* Alessio Lomuscio (UK)
* Ron van de Meyden (Australia)
* Peter Niebert (France)
* Charles Pecheur (USA)
* Wojciech Penczek (Poland)
* Franco Raimondi (UK)
* Mark Ryan (UK)
* Farn Wang (China)
==============================================================================
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/
-----------------------------------------------------------------------------
----------------------------------------------------------------------
Research Grant
To pursue PhD studies in the
CLIP group (http://clip.dia.fi.upm.es)
Technical University of Madrid (Spain)
in the context of the S-Cube EU Network of Excellence
----------------------------------------------------------------------
The CLIP group at the Technical University of Madrid (UPM) invites
applications for a fully-funded 4-year PhD scholarship for qualified
graduate students.
Candidates should have graduated (with a Bachelor level or equivalent)
in Computer Science, Computer Engineering, or related fields prior to
the start of their research work at UPM. Candidates close to
fulfilling this requirement can also apply, and every case will be
considered separately. Please include as much relevant information as
possible.
The PhD work will focus on the research areas of the Clip group and
the EU-funded S-Cube network, and will be directed by Manuel Carro and
Manuel Hermenegildo. The general research objective of "S-Cube:
Software and Services Systems Network" is to advance in the
consolidation of a unified framework for Software and Services by
studying how to reliably integrate the different requirements for a
service-based application (SBA), including establishing ground work to
define how tools to ensure SBAs can be implemented. Among other
topics, this includes ensuring quality of service, and performing
validation and verification of SBA or parts thereof --tasks in which
UPM is directly involved.
This is also an outstanding opportunity to get involved in tasks which
require international collaboration, as the 15 S-Cube partners come
from 11 different countries. Besides purely research issues, a
significant part of S-Cube deals with integrating existing European
research in the field by, e.g., organizing workshops, striving to
establish a researcher exchange network, and others. The CLIP group
itself has currently around 20 full-time members from 6 different
countries. The working language of the group (and of the project) is
English, and good to excellent command of English is expected from
applicants.
Experience in / knowledge of (or, at least, interest in) the following
topics, despite not being mandatory, increases the chances of success:
* Software verification.
* Software validation.
* (Constraint) Logic Programming.
* Technology for and deployment of Web Services.
* Quality of service in software services.
* Service-oriented architectures.
Applications and information:
-----------------------------
The project starts on March 1, 2008, and will initially run for four
years. The grant will be given in the form of a full-time contract
which includes academic fees, medical care, and a tax-free monthly
payment which can range from 1,100 to 1,600 euros, depending on
experience. Applicants will be ranked according to their value and
only those in the shortlist will be contacted to ask for more details
or to have a personal interview.
The deadline for applications is February 15th, 2008. Applications
received after this deadline may be considered if the scholarships
have not been filled at reception time. Applications and inquiries
should be sent to scube-phd-grants[_a(a)t_]clip.dia.fi.upm.es (replace
[_a(a)t_] by the appropriate sign) and include a curriculum vitae (very
preferably in PDF), a listing of grades from previous studies, a brief
description of research interests in relation to those of the CLIP
group and S-Cube, and, if at all possible, letters of recommendation
from faculty or management that the student has worked with
previously.
More information on the research group and the S-Cube project can be
found at http://www.cliplab.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/
-----------------------------------------------------------------------------