[TYPES/announce] Book Announcement: "Computability In Context"

[S Barry Cooper]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Book Announcement:

__
COMPUTABILITY IN CONTEXT: Computation and Logic in the Real World
(ed. S Barry Cooper and  Andrea Sorbi)

World Scientific, Feb. 2011
http://www.worldscibooks.com/mathematics/p577.html

Computability has played a crucial role in mathematics and computer
science, leading to the discovery, understanding and classification of
decidable/undecidable problems, paving the way for the modern computer
era, and affecting deeply our view of the world. Recent new paradigms of
computation, based on biological and physical models, address in a
radically new way questions of efficiency and challenge assumptions about
the so-called Turing barrier.

This volume, arising from the conference "Computability in Europe 2007:
Computation and Logic in the Real World", addresses various aspects of the
ways computability and theoretical computer science enable scientists and
philosophers to deal with mathematical and real-world issues, covering
problems related to logic, mathematics, physical processes, real
computation and learning theory. At the same time it will focus on
different ways in which computability emerges from the real world, and how
this affects our way of thinking about everyday computational issues.

Contents:

* Computation, Information, and the Arrow of Time (P Adriaans & P van Emde
Boas)
* The Isomorphism Conjecture for NP (M Agrawal)
* The Ershov Hierarchy (M M Arslanov)
* Complexity and Approximation in Reoptimization (G Ausiello et al.)
* Definability in the Real Universe (S B Cooper)
* HF-Computability (Y L Ershov et al.)
* The Mathematics of Computing Between Logic and Physics (G Longo & T
Paul)
* Liquid State Machines: Motivation, Theory, and Applications (W Maass)
* Experiments on an Internal Approach to Typed Algorithms in Analysis (D
Normann)
* Recursive Functions: An Archeological Look (P Odifreddi)
* Reverse Mathematics and Well-Ordering Principles (M Rathjen & A
Weiermann)
* Discrete Transfinite Computation Models (P D Welch)

ISBN:   978-1-84816-245-7, 1-84816-245-6
__

[TYPES/announce] 2nd Call for Papers: WWV 2011

[Francesco Tiezzi]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

[Apologies for multiple copies]


Second Call for Papers  

WWV 2011  
Automated Specification and Verification of Web Systems  
7th International Workshop 
(as part of DisCoTec'11)  

http://rap.dsi.unifi.it/wwv2011/ 

June 9, 2011 - Reykjavik, Iceland 




IMPORTANT DATES

Abstract Submission March 28, 2011
Full Paper Submission   April 4, 2011
Acceptance Notification May 3, 2011
Camera Ready (pre-proceedings)  May 30, 2011
WorkshopJune 9, 2011
Camera Ready (post-proceedings) July 4, 2011



SCOPE

The Workshop on Automated Specification and Verification of Web Systems (WWV) 
is a yearly workshop that aims at providing an interdisciplinary forum to 
facilitate the cross-fertilization and the advancement of hybrid methods that 
exploit concepts and tools drawn from Rule-based programming, Software 
engineering, Formal methods and Web-oriented research.

Nowadays, many companies and institutions have diverted their Web sites into 
interactive, completely-automated, Web-based applications for, e.g., 
e-business, e-learning, e-government and e-health. The increased complexity and 
the explosive growth of Web systems has made their design and implementation a 
challenging task. Systematic, formal approaches to their specification and 
verification can permit to address the problems of this specific domain by 
means of automated and effective techniques and tools.

Topics of either theoretical or applied interest include, but are not limited 
to:
- Rule-based approaches to Web system analysis, certification, specification, 
verification, and optimization.
- Languages and models for programming and designing Web systems.
- Formal methods for describing and reasoning about Web systems.
- Model-checking, synthesis and debugging of Web systems.
- Analysis and verification of linked data.
- Abstract interpretation and program transformation applied to the semantic 
Web.
- Intelligent tutoring and advisory systems for Web specifications authoring.
- Middleware and frameworks for composition and orchestration of Web services.
- Web quality and Web metrics.
- Web usability and accessibility.
- Testing and evaluation of Web systems and applications.



INVITED SPEAKER

Elie Najm   Telecom ParisTech, France



SUBMISSION 

Submitted papers should present original unpublished work and cannot be under 
review for publication elsewhere. Each paper will undergo a thorough evaluation 
by at least three reviewers, chosen by the Program Committee. 
Contributions should be in PDF format and prepared in LaTeX using the 
EPTCS-style format (http://style.eptcs.org/) and should not exceed 15 pages 
(typeset 11 points).

Submissions are handled using the EasyChair online system and can be uploaded 
using the following link:
https://www.easychair.org/conferences/?conf=wwv2011

Submission is a firm commitment that at least one of the authors will attend 
the conference, if the paper is accepted.



PUBLICATION 

Accepted papers will be included in the pre-proceedings, which will be made 
available in electronic form through the WWV web site. 
After the workshop, authors of accepted papers will be asked to prepare, by 
incorporating insights gathered during the event, a final version of their 
paper to be published in the post-proceedings.

Workshop post-proceedings will be published as a volume of the EPTCS 
(Electronic Proceedings in Theoretical Computer Science, http://eptcs.org/) 
series.

An open call for a special high-quality journal issue on the topic of the WWV 
workshop is envisaged.



WORKSHOP CO-CHAIRS

Laura KovacsVienna University of Technology, Austria
Rosario PuglieseUniversity of Florence, Italy
Francesco TiezziUniversity of Florence, Italy



PROGRAM COMMITTEE

Maria Alpuente  Technical University of Valencia, Spain
Demis BallisUniversity of Udine, Italy
Santiago EscobarTechnical University of Valencia, Spain
Jean-Marie Jacquet  University of Namur, Belgium
Laura KovacsVienna University of Technology, Austria
Temur KutsiaJohannes Kepler University Linz, Austria
Tiziana MargariaUniv. Potsdam, Germany
Manuel Mazzara  University of Newcastle, United Kingdom
Catherine Meadows   NRL, United States
Yasuhiko Minamide   University of Tsukuba, Japan
Rosario PuglieseUniversity of Florence, Italy
I.V. Ramakrishnan   SUNY Stony Brook, United States
Maurice ter Beek 

[TYPES/announce] Last CfP: WRS 2011 - 10th International Workshop on Reduction Strategies in Rewriting and Programming

[Santiago Escobar]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

   Last Call for Papers

 WRS 2011
  10th International Workshop on 
Reduction Strategies in Rewriting and Programming 
  http://www.dsic.upv.es/workshops/wrs2011
   29 May 2011, Novi Sad, Serbia

  An RDP 2011 workshop 
Federated Conference on Rewriting, Deduction, and Programming


This workshop promotes research and collaboration in the area of 
reduction strategies. It encourages the presentation of new 
directions, developments, and results as well as surveys and 
tutorials on existing knowledge in this area. Reduction strategies 
define which (sub)expression(s) should be selected for evaluation 
and which rule(s) should be applied. These choices affect fundamental 
properties of computations such as laziness, strictness, completeness, 
and efficiency, to name a few. For this reason programming languages 
such as Elan, Maude, OBJ, Stratego, and TOM allow the explicit 
definition of the evaluation strategy, whereas languages such as 
Clean, Curry, and Haskell allow its modification. In addition to 
strategies in rewriting and programming, WRS also covers the use of 
strategies and tactics in other areas such as theorem and termination 
proving. 

Previous editions of the workshop were held in Utrecht (2001), 
Copenhagen (2002), Valencia (2003), Aachen (2004), Nara (2005), 
Seattle (2006), Paris (2007), Hagenberg (2008), Brasilia (2009), 
and Edinburgh (2010); the last one as a joint workshop with the 
STRATEGIES workshop. Further information can be found at the 
permanent site for WRS .

WRS 2011 is planned to be co-located with RTA 2011 (22nd International 
Conference on Rewriting Techniques and Applications), as a satellite 
event of RDP, the Federated Conference on Rewriting, Deduction, and 
Programming. WRS 2011 will be held at Novi Sad, Serbia on 29 May 2011.

Submissions and Publication: Before the workshop, authors are 
invited to submit an extended abstract (max. 5 pages) to be 
formatted in the EasyChair class style through the EasyChair submission site. 
Accepted abstracts will be presented at the workshop and included in the 
preliminary proceedings, available at the workshop. After the workshop, 
authors will be invited to submit a full paper of their presentation 
(typically a 15-pages paper), which will be refereed and considered 
for publication in an electronic journal, such as Electronic Proceedings 
in Theoretical Computer Science. 

Beyond original ideas and recent results not published nor submitted 
elsewhere, we also invite authors to submit a 5-pages abstract 
describing relevant work that has been or will be published elsewhere, 
or work in progress. These submissions will be only considered for 
presentation at the workshop and inclusion in the preliminary 
proceedings but not in the final proceedings.

We envisage publication of a special issue of a journal dedicated to WRS
after the event.

Important Dates:
# Submission: 20 March 2011
# Notification: 4 April 2011
# Preliminary proceedings version due: 15 April 2011
# Workshop: 29 May 2011
# Submission for final proceedings: 12 September 2011
# Notification: 7 November 2011
# Final version: 21 November 2011

Programme Committee:
# Dan Dougherty, Worcester Polytechnic Institute, USA
# Santiago Escobar, Universidad Politecnica de Valencia, Spain (chair)
# Maribel Fernandez, King's College London, UK
# Juergen Giesl, RWTH Aachen, Germany
# Bernhard Gramlich, Technische Universit Wien, Austria
# Helene Kirchner, Centre de Recherche INRIA Bordeaux, France
# Francisco Javier Lopez Fraguas, Universidad Complutense de Madrid, Spain
# Salvador Lucas, Universidad Politecnica de Valencia, Spain
# Aart Middeldorp, University of Innsbruck, Austria
# Jaco van de Pol, University of Twente, The Netherlands
# Masahiko Sakai, Nagoya University, Japan
# Manfred Schmidt-Schauss, Johann Wolfgang Goethe-Universitat, Germany 

For more information, please contact
Santiago Escobar
Universidad Politecnica de Valencia, Spain
Email: sesco...@dsic.upv.es

[TYPES/announce] Lecturer position in Paris 13

[Michele . Pagani]

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

==
University Lecturer position in LIPN
  (University Paris 13)
==

A lecturer position is open within the Laboratory LIPN located at
University Paris 13 (http://www-lipn.univ-paris13.fr).

___
__ Important dates ___

- deadline for application:  25 march 2011 (16h00 Paris Time)
- starting date: 1 september 2011

__
___ Application procedure 

The applicant must have obtained a Ph.D. degree and be "qualified"
(see  
http://www.enseignementsup-recherche.gouv.fr/cid22657/maitres-de-conferences.html

for additional information).

The candidate should apply online on the website

https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/candidats.html

Furthermore, he or she should send his/her full application to the
University Paris 13, this including a resume, a research project and
referee letters.  Additional information is provided at the following
address (see MCF 9004):

http://www-lipn.univ-paris13.fr/~fouquere/Postes/index2011.html

___
_ Profile of the position 

The teaching profile is "Systèmes et réseaux", the selected candidate
will teach in French at the IUT of Villetaneuse
(http://www.iutv.univ-paris13.fr/iutv/index.php).

The research profile is "linear logic, proof nets and programming".
We seek candidates with a solid mathematical background and expertise
in one or several of the following areas of theoretical computer
science:
- linear logic, light linear logics;
- proof nets, geometry of interaction;
- lambda-calculus and their algebraic, probabilistic and
non-deterministic extensions;
- denonational semantics, games semantics, ludics;
- functional programming.
Expertise in other areas involving logic and theoretical computer
science are also welcome.

The selected candidate will work within the team LCR (Logic,
Computation, Reasoning) of LIPN (http://www-lipn.univ-paris13.fr/LCR).

The interested candidates may contact us by email at
c...@lipn.univ-paris13.fr



This message was sent using IMP, the Internet Messaging Program.

[TYPES/announce] Privacy, Security, Trust (PST 2011) - 2nd Call for Papers (Deadline: March 20)

[Serguei A. Mokhov on behalf of PST-11]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

[ Apologies if you receive multiple copies of this announcement. Please
  pass it on to your colleagues and students who might be interested in
  contributing. ]

Ninth Annual Conference on Privacy, Security and Trust
--

July 19-21, 2011
Montreal, Quebec, Canada
http://www.unb.ca/pstnet/pst2011

Call for Papers
---

The PST2011 International Conference on Privacy, Security and Trust (PST)
is being held in Montreal, Quebec, Canada, July 19-21, 2011. PST2011 is
the ninth such annual conference focusing on PST technologies. PST2011
provides a forum for researchers world-wide to unveil their latest work in
privacy, security and trust and to show how this research can be used to
enable innovation.

EasyChair submission link of PST 2011:

  http://www.easychair.org/conferences/?conf=pst2011.

IMPORTANT DATES:


Submission Deadline:March 20, 2011
Notification of Acceptance: May 9, 2011
Final Manuscript Due:   May 22, 2011

PST2011 will include an Innovation Day featuring workshops and tutorials
followed by two days of high-quality research papers whose topics include,
but are NOT limited to, the following:

  * Privacy Preserving / Enhancing Technologies
  * Trust Technologies, Technologies for Building Trust in e-Business Strategy
  * Critical Infrastructure Protection
  * Observations of PST in Practice, Society, Policy and Legislation
  * Network and Wireless Security
  * Digital Rights Management
  * Operating Systems Security
  * Identity and Trust management
  * Intrusion Detection Technologies
  * PST and Cloud Computing
  * Secure Software Development and Architecture
  * Human Computer Interaction and PST
  * PST Challenges in e-Services, e.g. e-Health, e-Government, e-Commerce
  * Implications of, and Technologies for, Lawful Surveillance
  * Network Enabled Operations
  * Biometrics, National ID Cards, Identity Theft
  * Digital forensics
  * PST and Web Services / SOA
  * Information Filtering, Data Mining & Knowledge from Data
  * Privacy, Traceability, and Anonymity
  * National Security and Public Safety
  * Trust and Reputation in Self-Organizing Environments
  * Security Metrics
  * Anonymity and Privacy vs. Accountability
  * Recommendation, Reputation and Delivery Technologies
  * Access Control and Capability Delegation
  * Continuous Authentication
  * Representations and Formalizations of Trust in Electronic and
Physical Social Systems

High-quality papers in all PST related areas that, at the time of
submission, are not under review and have not already been published or
accepted for publications elsewhere are solicited. Accepted papers will
either be accepted as regular papers up to 8 pages and with oral
presentations, or short papers of up to 2 pages with poster presentations.
Up to 2 additional pages will be allowed in each category with over-length
charges. The standard IEEE two-column conference format should be used for
all submissions. A copy of the IEEE Manuscript Templates for Microsoft
Word or LaTeX and additional information about paper submission and
conference topics and events can be found at the conference web site. All
accepted papers will be published in the conference proceedings and by
IEEE and will be accessible via IEEE Xplore Digital Library. Best Paper
and Best Student Paper awards will be presented. Some travel grants to
students who are presenting their work in the conference will also be made
available.

Organizing Committee


Honorary Conference Chair:
  Andrew Vallerand, Director S&T Public Security, National Defense, Canada

General Co-Chairs:
  Mourad Debbabi, Concordia University, Canada
  Amr M. Youssef, Concordia University, Canada

Program Co-Chairs:
  Frederic Cuppens (Privacy), ENST-Bretagne, France
  Natalia Stakhanova (Security), University of South Alabama, USA
  Jianying Zhou (Trust), Institute for Infocomm Research, Singapore

Workshop & Tutorial Chair:
  Ali Miri, Ryerson University, Canada

Poster Session Chair:
  Franois Cosquer, Alcatel Lucent, France

Publication & Publicity Chair:
  Indrajit Ray, Colorado State University, USA
  Carlisle Adams, University of Ottawa, Canada

PST Steering Committee Chair:
  Ali Ghorbani, University of New Brunswick, Canada

Conference Manager:
  Greg Sprague, National Research Council, Canada

Local Arrangements:
  Benjamin Fung, Concordia University, Canada

Webmaster:
  Ilia Goldfarb, National Research Council, Canada

Finance and Registration:
  Linda Vienneau, National Research Council, Canada


Privacy Theme
-

Privacy concerns the operational policies, procedures and regulations
implemented within an information system to control for the unauthorized
use of, access to, or release of personal information held in any format.
Topics of interest in this theme include (but are no

[TYPES/announce] Announcing Summer Formal 2011: Summer School on Formal Techniques

[Natarajan Shankar]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


Summer Formal 2011: First Summer School on Formal Techniques

May 23-27, 2011

Menlo College, Atherton, California USA

http://fm.csl.sri.com/SSFT11

Formal verification techniques such as model checking, satisfiability,
and static analysis have matured rapidly in recent years.  These
techniques are widely applicable in computing as well as in engineering,
biology, and mathematics.  This school will focus on the principles and
practice of formal verification, with a strong emphasis on the hands-on
use of verification technology.  It primarily targets graduate students
who are interested in using or developing verification technology in
their own research.

We have NSF support for the travel and food/accommodation for students from
US universities, but welcome applications from graduate students at non-US
universities as well.

The lecturers at the school include

* Leonardo de Moura (Microsoft) and Bruno Dutertre (SRI International):
  Satisfiability Modulo Theories
* Jason Baumgartner (IBM):
  Hardware Verification: Model Checking and Equivalence Checking
* David Monniaux (VERIMAG):
  Static Analysis
* Ken McMillan (Microsoft):
  Abstraction, Interpolation, and Composition
* Neha Rungta and Peter Mehlitz (NASA Ames):
  Software Verification with Java PathFinder
* Natarajan Shankar (SRI):
  Interactive Theorem Proving

More information on the school can be found at http://fm.csl.sri.com/SSFT11.
Students are invited to apply for admission to the school by visiting this
web site.  We especially welcome applications from women and
under-represented minorities.  Applications must be received by Mar 31, 2011.


Tom Ball, Lenore Zuck, and Natarajan Shankar
Summer Formal Steering Committee