[TYPES/announce] BCTCS 2011: 2nd Call for Participation

[Achim Jung]

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


[ Only a few days left to register ]

===

27th British Colloquium for Theoretical Computer Science (BCTCS)


 18th to 21st April 2011
 University of Birmingham
 http://events.cs.bham.ac.uk/BCTCS2011



SCOPE

The purpose of the BCTCS is to provide a forum in which researchers in
theoretical computer science can meet, present research findings, and
discuss developments in the field. It also aims to provide an
environment in which PhD students can gain experience in presenting
their work, and benefit from contact with established researchers. The
conference will consist of invited keynote presentations by
distinguished researchers and a number of contributed talks.


LOCATION AND SCHEDULE

BCTCS 2011 will be held at the University of Birmingham, a short train ride 
away from the central "New Street Station" which has direct connections from 
much of the UK.
Accommodation will be provided by the Etap Hotel in the city centre with easy 
access to eateries and other amenities.


The event will start on Monday afternoon and will end with a lunch on
Thursday (the day before Good Friday).


INVITED SPEAKERS

BCTCS 2011 will include invited lectures by the following
distinguished speakers:

* David S. Johnson (AT&T Labs)
* Cliff Jones (Newcastle)
* Prakash Panangaden (McGill)
* Peter Selinger (Dalhousie)
* Nigel Smart (Bristol)
* Carsten Witt (Technical University of Denmark)


CONTRIBUTED TALKS

Participants at the colloquium are encouraged to present a contributed
talk. If you wish to present a contributed talk, please give the title
when you register for the Colloquium. You will be asked to provide an
abstract, using a provided LaTeX template, at a later stage.
The abstracts of accepted contributed talks will be published in the
Bulletin of the European Association for Theoretical Computer Science.


REGISTRATION

The registration fee is GBP 290, which includes accommodation (nights of the 
18th, 19th, and 20th) and one evening meal. Registration is via the Colloquium 
website.


Registration closes on 4 APRIL 2011.

ORGANISATION AND FURTHER INFORMATION

The conference is being organised by Achim Jung, Paul Levy, and Sarah Collins 
of the School of Computer Science, University of Birmingham.


More information about the meeting including updates are available
from the conference webpages at: http://events.cs.bham.ac.uk/BCTCS2011

Queries can be sent to: bctcs2...@cs.bham.ac.uk.

We hope to see you there!

[TYPES/announce] SecCo 2011: First Call for Papers

[Jun PANG]

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

+-+
! !
! SecCo 2011  !
!  Aachen, Germany!
! Monday, September 5th, 2011 !
!   http://www.lix.polytechnique.fr/~kostas/SecCo2011/!
! !
!   Affiliated with CONCUR 2011   !
! !
+-+

IMPORTANT DATES
===
Papers due: June 3rd, 2011
Notification: July 8th, 2011
Final paper due: July 22nd, 2011
Workshop: September 5th, 2011

BACKGROUND, AIM AND SCOPE
=
Emerging trends in concurrency theory require the definition of models and
languages adequate for the design and management of new classes of applications,
mainly to program either WANs (like Internet) or smaller networks of mobile and
portable devices (which support applications based on a dynamically
reconfigurable communication structure). Due to the openness of these systems,
new critical aspects come into play, such as the need to deal with malicious
components or with a hostile environment. Current research on network security
issues (e.g. secrecy, authentication, etc.) usually focuses on opening
cryptographic point-to-point tunnels. Therefore, the proposed solutions in this
area are not always exploitable to support the end-to-end secure interaction
between entities whose availability or location is not known beforehand.

The aim of the workshop is to cover the gap between the security and the
concurrency communities. More precisely, the workshop promotes the exchange of
ideas, trying to focus on common interests and stimulating discussions on
central research questions. In particular, we look for papers dealing with
security issues -- such as authentication, integrity, privacy, confidentiality,
access control, denial of service, service availability, safety aspects, fault
tolerance, trust, language-based security, probabilistic and information
theoretic models -- in emerging fields like web services, mobile ad-hoc
networks, agent-based infrastructures, peer-to-peer systems, context-aware
computing, global/ubiquitous/pervasive computing.

SecCo 2011 follows the success of SecCo'03 (affiliated to ICALP'03), SecCo'04
(affiliated to CONCUR'04), SecCo'05 (affiliated to CONCUR'05), SecCo'07
(affiliated to CONCUR'07), SecCo'08 (affiliated to CONCUR'08), SecCo'09
(affiliated to CONCUR'09) and SecCo'10 (affiliated to CONCUR'10).


SUBMISSION
==
The workshop proceedings will be published in the new EPTCS series (Electronic
Proceedings in Theoretical Computer Science, see
http://www.cse.unsw.edu.au/~rvg/EPTCS/ and
http://www.informatik.uni-trier.de/~ley/db/series/eptcs/index.html
for the list of all published EPTCS volumes);
we thus encourage submissions already in that format (A4 size).

Submissions may be of two kinds:

- Normal submissions, included in the EPTCS proceedings.

- Presentation-only submissions. These could overlap with submissions
  to other conferences or journals, and will not be included in the
  proceedings. These provide an opportunity to present innovative ideas
  and get feedback from a technically competent audience.

The page limit is 18 pages including the bibliography but excluding
well-marked appendices. The page limit is the same for both kinds of
submissions, please indicate clearly whether you intend you paper to
be included in the proceedings or not.

Papers must be submitted electronically at the following URL:
http://www.easychair.org/conferences/?conf=secco11

A special issue of Journal of Computer Security (JCS) has been
arranged in collaboration with TOSCA (ARSPA-WITS) 2011. Selected
papers from both workshops will be invited for submission, and will be
peer-reviewed according to the standard policy of JCS.


PROGRAM COMMITTEE
=
 * Miguel E. Andres (Ecole Polytechnique, France)
 * Kostas Chatzikokolakis (Ecole Polytechnique, France; co-chair)
 * Stephanie Delaune (ENS Cachan, France)
 * Ralf Kuesters (University of Trier, Germany)
 * Gavin Lowe (University of Oxford, UK)
 * Jun Pang (University of Luxembourg, Luxembourg; co-chair)
 * Mark Ryan (University of Birmingham, UK)
 * Dominique Unruh (Saarland University, Germany)
 * Luca Vigano (University of Verona, Italy)
 * Chenyi Zhang (University of New South Wales, Australia)

[TYPES/announce] PhD position in probabilistic processes and modal logic at VU University Amsterdam

[Bas Luttik]

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

In the research project

  From Modal Logic to Probabilistic Processes and Back

there is a vacancy for a 4 year PhD position at the VU University Amsterdam.

This is a joint project between the Theoretical Computer Science group 
at the VU University Amsterdam and the Model Driven Software Engineering 
group at Eindhoven University of Technology.


The project involves research at the crossroads of modal logic, process 
algebra, and structural operational semantics, in the context of 
probabilistic processes.


More information on the project can be found at

  http://www.cs.vu.nl/~tcs/problog.pdf

To apply, send a CV, letter of motivation, and names of at least two 
references to Wan Fokkink (w.j.fokk...@vu.nl) and Bas Luttik 
(s.p.lut...@tue.nl). Deadline for application is May 15, 2011.

[TYPES/announce] [fm-announcements] NFM 2011 - call for participation

[Havelund, Klaus (318M)]

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


  CALL FOR PARTICIPATION

   NFM 2011
   Third NASA Formal Methods Symposium

   Pasadena, California, USA
  April 18 - 20, 2011

http://lars-lab.jpl.nasa.gov/nfm2011


THEME:

The NASA Formal Methods Symposium is a forum for theoreticians and
practitioners from academia, government and industry, with the goals
of identifying challenges and providing solutions to achieving
assurance in mission- and safety-critical systems. The focus of the
symposium is on formal methods, and aims to foster collaboration
between NASA researchers and engineers and the wider aerospace and
academic formal methods communities. The symposium will be comprised
of a mixture of invited talks, invited tutorials, and presentation of
papers and tool demonstrations.


COSTS:

There will be no registration fee charged to participants.


INVITED SPEAKERS:

Rustan Leino, Microsoft Research, USA:

   "From Retrospective Verification to Forward-Looking Development"

Oege de Moor, University of Oxford, UK:

   "Do Coding Standards Improve Software Quality?"

Andreas Zeller, Saarland University, Germany:

   "Specifications for Free"


TUTORIALS:

Andreas Bauer, NICTA and Australian National University, Australia, and
Martin Leucker, University of Luebec, Germany:

   "The Theory and Practice of SALT - Structured Assertion Language forTemporal 
Logic"

Bart Jacobs, Katholieke Universiteit Leuven, Belgium:

   "VeriFast: a Powerful, Sound, Predictable, Fast Verifier for C and Java"

Michal Moskal, Microsoft Research, USA:

   "Verification of Functional Correctness of Concurrent C Programs with VCC"


HISTORY:

NFM 2011 is the third edition of the NASA Formal Methods Symposium,
organized by NASA on a yearly basis. The first in 2009 and was
organized at NASA Ames Research Center, Moffett Field, California. The
second in 2010 was organized at NASA head quarters, Washington
D.C. The symposium originated from the earlier Langley Formal Methods
Workshop series.


PROGRAMME CHAIRS:

Mihaela Bobaru, NASA/Jet Propulsion Laboratory
Klaus Havelund, NASA/Jet Propulsion Laboratory
Gerard Holzmann, NASA/Jet Propulsion Laboratory
Rajeev Joshi, NASA/Jet Propulsion Laboratory


PROGRAMME COMMITTEE:

Rajeev Alur, University of Pennsylvania, USA
Tom Ball, Microsoft Research, USA
Howard Barringer, University of Manchester, UK
Saddek Bensalem, Verimag Laboratory, France
Nikolaj Bjoerner, Microsoft Research, USA
Eric Bodden, Technical University Darmstadt, Germany
Marsha Chechik, University of Toronto, Canada
Rance Cleaveland, University of Maryland, USA
Dennis Dams, Bell Labs/Alcatel-Lucent, Belgium
Ewen Denney, NASA Ames Research Center, USA
Matt Dwyer, University of Nebraska, USA
Cormac Flanagan, UC Santa Cruz, USA
Dimitra Giannakopoulou, NASA Ames Research Center, USA
Patrice Godefroid, Microsoft Research, USA
Alex Groce, Oregon State University, USA
Radu Grosu, Stony Brook, USA
John Hatcliff, Kansas State University, USA
Mats Heimdahl, University of Minnesota, USA
Mike Hinchey, Lero - the Irish SW. Eng. Research Centre, Ireland
Sarfraz Khurshid, University of Texas at Austin, USA
Orna Kupferman, Jerusalem Hebrew University, Israel
Kim Larsen, Aalborg University, Denmark
Rupak Majumdar, Max Planck Institute, Germany
Kenneth McMillan, Cadence Berkeley Labs, USA
Cesar Munoz, NASA Langley, USA
Madan Musuvathi, Microsoft Research, USA
Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA
Corina Pasareanu, NASA Ames Research Center, USA
Shaz Qadeer, Microsoft Research, USA
Grigore Rosu, University of Illinois at Urbana-Champaign,
Nicolas Rouquette, NASA/Jet Propulsion Laboratory, USA
Kristin Rozier, NASA Ames Research Center, USA
John Rushby, SRI International, USA
Wolfram Schulte, Microsoft Research, USA
Koushik Sen, Berkeley University, USA
Sanjit Seshia, Berkeley University, USA
Natarajan Shankar, SRI International, USA
Willem Visser, University of Stellenbosch, South Africa
Mahesh Viswanathan, University of Illinois, USA
Ben Di Vito, NASA Langley, USA
Mike Whalen, University of Minnesota, USA

STEERING COMMITTEE:

Ewen Denney, NASA Ames Research Center
Dimitra Giannakopoulou, NASA Ames Research Center
Klaus Havelund, NASA/Jet Propulsion Laboratory
Gerard Holzmann, NASA/Jet Propulsion Laboratory
Cesar Munoz, NASA Langley
Corina Pasareanu, NASA Ames Research Center
James Rash, NASA Goddard
Kristin Y. Rozier, NASA Ames Research Center
Ben Di Vito, NASA Langley

[TYPES/announce] [fm-announcements] RV 2011 - 2nd Call for Papers and Tutorials

[Havelund, Klaus (318M)]

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


2nd Call for Papers and Tutorials

International Conference on Runtime Verification (RV 2011)
September 27 - 30, 2011
San Francisco, California, USA
http://rv2011.eecs.berkeley.edu/

Runtime verification (RV) is concerned with monitoring and analysis of
software or hardware system executions.  The field is often referred
to under different names, such as runtime verification, runtime
monitoring, runtime checking, runtime reflection, runtime analysis,
dynamic analysis, runtime symbolic analysis, trace analysis, log file
analysis, etc.  RV can be used for many purposes, such as security or
safety policy monitoring, debugging, testing, verification,
validation, profiling, fault protection, behavior modification (e.g.,
recovery), etc.  A running system can be abstractly regarded as a
generator of execution traces, i.e., sequences of relevant states or
events. Traces can be processed in various ways, e.g., checked against
formal specifications, analyzed with special algorithms, visualized,
etc.  Topics of interest include, but are not limited to:

* program instrumentation techniques
* specification languages for writing monitors
* dynamic program slicing
* record-and-replay
* trace simplification for debugging
* extraction of monitors from specifications
* APIs for writing monitors
* programming language constructs for monitoring
* model-based monitoring and reconfiguration
* the use of aspect oriented programming for dynamic analysis
* algorithmic solutions to minimize runtime monitoring impact
* combination of static and dynamic analysis
* full program verification based on runtime verification
* intrusion detection, security policies, policy enforcement
* log file analysis
* model-based test oracles
* observation-based debugging techniques
* fault detection and recovery
* model-based integrated health management and diagnosis
* program steering and adaptation
* dynamic concurrency analysis
* dynamic specification mining
* metrics and statistical information gathered during runtime
* program execution visualization
* data structure repair for error recovery
* parallel algorithms for efficient monitoring
* monitoring for effective fault localization and program repair

The RV series of events started in 2001, as an annual workshop.  The
RV'01 to RV'05 proceedings were published in ENTCS.  Since 2006, the
RV proceedings have been published in LNCS.  In year 2010, RV became
an international conference.  Links to past RV events can be found at
the permanent URL:

   http://runtime-verification.org


INVITED SPEAKERS
TBD

Talk titles will be made available on RV 2011 web page.


PAPER SUBMISSION

RV will have two research paper categories: regular and short
papers. Papers in both categories will be reviewed by the conference
Program Committee.

* Regular papers (up to 15 pages) should present original unpublished
results.  Applications of runtime verification are particularly
welcome.  A Best Paper Award (USD 300) will be offered.

* Short papers (up to 5 pages) may present novel but not necessarily
thoroughly worked out ideas, for example emerging runtime verification
techniques and applications, or techniques and applications that
establish relationships between runtime verification and other
domains.  Accepted short papers will be presented in special short
talk (5-10 minutes) and poster sessions.

In addition to short and regular papers, proposals for tutorials and
tool demonstrations are welcome.  Proposals should be up to 2 pages
long.

* Tutorial proposals on any of the topics above, as well as on topics
at the boundary between RV and other domains, are welcome.  Accepted
tutorials will be allocated up to 15 pages in the conference
proceedings.  Tutorial presentations will be at least 2 hours.

* Tool demonstration proposals should briefly introduce the problem
solved by the tool and give the outline of the demonstration.  Tool
papers will be allocated 5 pages in the conference proceedings. A Best
Tool Award (USD 200) will be offered.

Submitted tutorial and tool demonstration proposals will be evaluated
by the corresponding chairs, with the help of selected reviewers.

All accepted papers, including tutorial and tool papers, will appear
in the LNCS proceedings.  Submitted papers must use the LNCS style.
At least one author of each accepted paper must attend RV'11 to
present the paper.  Papers must be submitted electronically using the
EasyChair system.  A link to the electronic submission page will be
made available on the RV'11 web page.


IMPORTANT DATES

June 5, 2011 - Submission of regular and short papers
June 12, 2011 - Submission of tutorial and tool demonstration proposals
July 24, 2011 - Notification for regular, short, and tool papers
August 21, 2011 - Submission of camera-ready versions of accepted papers
September 27-30, 2011 - RV 2011 Conference and tu