[ecoop-info] [fm-announcements] RV 2011 final CfP -- paper deadline extension: June 12, 2011

Havelund, Klaus (318M) Klaus.Havelund at jpl.nasa.gov
Thu May 26 21:58:20 CEST 2011

******** Paper submission deadline extended to June 12, 2011 ********

International Conference on Runtime Verification (RV 2011)
September 27 - 30, 2011
San Francisco, California, USA
at the Historic Fairmont Hotel


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

* 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:



Dawson Engler, Stanford University
   Title: "Making Finite Verification of Raw C Code Easier than Writing a Test Case"

Cormac Flanagan, University of California, Santa Cruz
   Title: "Efficient and Precise Dynamic Detection of Destructive Races"

Wolfgang Grieskamp, Google
   Title: "Utilizing Protocol Contracts for Verifying Services in the Cloud"

Sharad Malik, Princeton University
   Title: "Runtime Verification: A Computer Architecture Perspective"

Vern Paxson, University of California, Berkeley
   Title: "Approaches and Challenges for Detecting Network Attacks in Real-Time"

Steven P. Reiss, Brown University
   Title: "What is My Program Doing?  Program Dynamics in Programmer's Terms"


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

* 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

In addition  to  short and regular papers,  tool demonstration papers
and tutorial proposals are  welcome.

* Tool demonstration papers (up to 5 pages) should briefly
 introduce the problem solved by the tool and give the outline
 of the demonstration.  A Best Tool Award (USD 200) will be

* Tutorial proposals (up to 2 pages) 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.

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.


June 12, 2011 - Submission of regular and short papers (Firm Deadline)
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


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)


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)


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)

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://web.satd.uma.es/pipermail/ecoop-info/attachments/20110526/58f0f10b/attachment-0001.html 

More information about the ecoop-info mailing list