Achim Jung | 1 Apr 2011 11:47
Picon
Picon
Favicon

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

[ 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.
(Continue reading)

Jun PANG | 1 Apr 2011 15:08
Picon
Favicon

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

[ 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
(Continue reading)

Bas Luttik | 1 Apr 2011 15:31
Picon
Picon
Favicon

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

[ 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.fokkink@...) and Bas Luttik 
(s.p.luttik@...). Deadline for application is May 15, 2011.

Havelund, Klaus (318M | 1 Apr 2011 21:14
Picon
Picon
Favicon

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

[ 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.
(Continue reading)

Havelund, Klaus (318M | 1 Apr 2011 21:51
Picon
Picon
Favicon

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

[ 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 tutorials


ORGANIZERS

Programme committee chairs:
Sarfraz Khurshid (University of Texas at Austin, USA)
Koushik Sen (University of California at Berkeley, USA)

Local organization chairs:
Jacob Burnim (University of California at Berkeley, USA)
Nicholas Jalbert (University of California at Berkeley, USA)


PROGRAM COMMITTEE

Howard Barringer (University of Manchester, UK)
Eric Bodden (Technical University Darmstadt, Germany)
Rance Cleaveland (University of Maryland, USA)
Mads Dam (Kungliga Tekniska högskolan, Sweden)
Brian Demsky (University of California at Irvine, USA)
Bernd Finkbeiner (Saarland University, Germany)
Cormac Flanagan (University of California at Santa Cruz, USA)
Patrice Godefroid (Microsoft Research Redmond, USA)
Jean Goubault-Larrecq (ENS Cachan, France)
Susanne Graf (Verimag, France)
Radu Grosu (State University of New York at Stony Brook, USA)
Lars Grunske (University of Kaiserslautern, Germany)
Aarti Gupta (NEC Laboratories America, USA)
Rajiv Gupta (University of California at Riverside, USA)
Klaus Havelund (NASA/JPL, USA)
Mats Heimdahl (University of Minnesota, USA)
Gerard Holzmann (NASA/JPL, USA)
Sarfraz Khurshid (University of Texas at Austin, USA) (co-chair)
Viktor Kuncak (École Polytechnique Fédérale De Lausanne, Switzerland)
Kim Larsen (Aalborg University, Denmark)
Martin Leucker (University of Luebeck, Germany)
Rupak Majumdar (Max Planck Institute Germany and University of California
at Los Angeles USA)
Greg Morrisett (Harvard University, USA)
Mayur Naik (Intel Berkeley Labs, USA)
Brian Nielsen (Aalborg University, Denmark)
Klaus Ostermann (University of Marburg, Germany)
Corina Pasareanu (NASA Ames, USA)
Wim De Pauw (IBM T. J. Watson, USA)
Doron Peled (Bar Ilan University, Israel)
Suzette Person (NASA Langley, USA)
Gilles Pokam (Intel, Santa Clara, USA)
Shaz Qadeer (Microsoft Research Redmond, USA)
Derek Rayside (University of Waterloo, Canada)
Grigore Rosu (University of Illinois at Urbana-Champaign, USA)
Wolfram Schulte (Microsoft Research Redmond, USA)
Manu Sridharan (IBM T. J. Watson, USA)
Koushik Sen (University of California, Berkeley, USA) (co-chair)
Peter Sestoft (IT University of Copenhagen, Denmark)
Scott Smolka (State University of New York at Stony Brook, USA)
Oleg Sokolsky (University of Pennsylvania, USA)
Mana Taghdiri (Karlsruhe Institute of Technology, Germany)
Serdar Tasiran (Koc University, Turkey)
Nikolai Tillmann (Microsoft Research Redmond, USA)
Shmuel Ur (Shmuel Ur Innovation, Israel)
Willem Visser (University of Stellenbosch, South Africa)
Mahesh Viswanathan (University of Illinois at Urbana-Champaign, USA)
Xiangyu Zhang (Purdue University, USA)


RV STEERING COMMITTEE

Howard Barringer (University of Manchester, UK)
Klaus Havelund (NASA/JPL, USA)
Gerard Holzmann (NASA/JPL, USA)
Insup Lee (University of Pennsylvania, USA)
Grigore Rosu (University of Illinois at Urbana-Champaign, USA)
Oleg Sokolsky (University of Pennsylvania, USA)


================
Steve Freund | 4 Apr 2011 03:10
Picon

[TYPES/announce] Second CFP: Formal Techniques for Java-like Programs (FTfJP) 2011

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

SECOND CALL FOR PAPERS

FTfJP 2011: Formal Techniques for Java-like Programs
colocated with ECOOP 2011, Lancaster UK
July 26, 2011

URL: http://www.cs.williams.edu/FTfJP2011/index.html

OVERVIEW

Formal techniques can help analyze programs, precisely describe
program behavior, and verify program properties. Newer languages such
as Java and C# provide good platforms to bridge the gap between formal
techniques and practical program development, because of their
reasonably clear semantics and standardized libraries. Moreover, these
languages are interesting targets for formal techniques, because the
novel paradigm for program deployment introduced with Java, with its
improved portability and mobility, opens up new possibilities for
abuse and causes concern about security.

Work on formal techniques and tools for programs and work on the
formal underpinnings of programming languages themselves naturally
complement each other. This workshop aims to bring together people
working in both these fields, on topics such as:

- formal techniques for Java, C#, Scala or similar languages
- specification techniques and interface specification languages
(Continue reading)

Cristian Prisacariu | 4 Apr 2011 12:03
Picon
Picon

[TYPES/announce] Deadline Extended (14 Apr.): FCT 2011

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

!!!!
!! Deadline Extended until _14 April_ (midnight Hawaii time) !!
!!!!

--------------------------------------------------------------------
                        Call for Papers

                            FCT 2011
  18th International Symposium on Fundamentals of Computation Theory
                         http://fct11.ifi.uio.no/

                August 22-25, 2011, Oslo, Norway

NEW: scholarships are available for eligible student participants!
     See the registration web-page for more information.

The Symposium on  Fundamentals of  Computation Theory was  established
in 1977 for researchers interested in all aspects of theoretical
computer science, as well as new emerging  fields such as
bio-inspired computing. It is a biennial series of conferences
previously held in Poznan (Poland, 1977), Wendisch-Rietz 
(Germany,  1979),  Szeged (Hungary, 1981),  Borgholm (Sweden,  1983), 
Cottbus (Germany, 1985),  Kazan (Russia, 1987),  Szeged (Hungary,
1989), Gosen-Berlin (Germany,  1991),  Szeged (Hungary,  1993), 
Dresden (Germany,  1995), Krakow (Poland,  1997),  Iasi (Romania, 
1999), Riga (Latvia,  2001), Malmo (Sweden, 2003), Lubeck (Germany,
2005), Budapest (Hungary, 2007), and Wroclaw (Poland, 2009).
(Continue reading)

Jaroslav Sevcik | 4 Apr 2011 12:51
Picon

[TYPES/announce] CompCertTSO release

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

Dear all,

we are pleased to announce a release of CompCertTSO, a certified
compiler from a multithreaded C-like language with a TSO relaxed
memory model to x86 assembly language with a realistic x86-TSO memory
model; the development builds on CompCert.  The code, documentation,
and papers are available here:

http://www.cl.cam.ac.uk/~pes20/CompCertTSO/

They build with Coq 8.3pl1 and OCaml 3.12.0.    Any comments would be
very welcome.

Jaroslav, Viktor, Francesco, Suresh, and Peter

Luigi Santocanale | 4 Apr 2011 23:03
Picon
Favicon

[TYPES/announce] TACL 2011, third and last call for papers (submission deadline approaching: 18/04/2011)

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

                    [Apologies for multiple copies]

              *Submission deadline approaching: 18/04/2011*

===============================================================================
            TOPOLOGY, ALGEBRA AND CATEGORIES IN LOGIC (TACL 2011)
                      Third and final call for papers
===============================================================================

                           July 26-30, 2011
                Universités Aix-Marseille I-II-III, France
                   http://www.lif.univ-mrs.fr/tacl2011/

Scope
-----

Studying logics via semantics is a well-established and very active
branch of mathematical logic, with many applications, in computer
science and elsewhere. The area is characterized by results, tools
and techniques stemming from various fields, including universal
algebra, topology, category theory, order, and model theory. The
program of the conference TACL 2011 will focus on three
interconnecting mathematical themes central to the semantical study
of logics and their applications: algebraic, categorical, and
topological methods. This is the fifth conference in the series
Topology, Algebra and Categories in Logic (TACL, formerly TANCL).
Earlier installments of this conference have been organized in
(Continue reading)

Emanuel Kitzelmann | 5 Apr 2011 23:23
Picon

[TYPES/announce] Extended submission deadline, AAIP 2011

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

4th Workshop on Approaches and Applications of Inductive Programming, AAIP 2011

*The deadline for paper submissions has been extended to April 24, 2011.*

More information on AAIP 2011:
http://www.cogsys.wiai.uni-bamberg.de/aaip11/

--

-- 
Dr. Emanuel Kitzelmann
International Computer Science Institute (ICSI)
1947 Center Street, Suite 600
Berkeley, CA 94704, USA

e-mail: emanuel@...
phone: +1 510 666 2883


Gmane