Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1292316acmconferencesBook PagePublication PagesfseConference Proceedingsconference-collections
SAVCBS '07: Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
ACM2007 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
ESEC/FSE07: Joint 11th European Software Engineering Conference 2007 Dubrovnik Croatia September 3 - 4, 2007
ISBN:
978-1-59593-721-6
Published:
03 September 2007
Sponsors:
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 12 Jan 2025Bibliometrics
Skip Abstract Section
Abstract

This workshop is concerned with how formal (i.e., mathematical) techniques can be or should be used to establish a suitable foundation for the specification and verification of component-based systems. Component-based systems are a growing concern for the software engineering community. Specification and reasoning techniques are urgently needed to permit composition of systems from components. Component-based specification and verification is also vital for scaling advanced verification techniques such as extended static analysis and model checking to the size of real systems. The workshop will consider formalization of both functional and non-functional behavior, such as performance or reliability.

This workshop brings together researchers and practitioners in the areas of component-based software and formal methods to address the open problems in modular specification and verification of systems composed from components. We are interested in bridging the gap between principles and practice. The intent of bringing participants together at the workshop is to help form a community-oriented understanding of the relevant research problems and help steer formal methods research in a direction that will address the problems of component-based systems. For example, researchers in formal methods have only recently begun to study principles of object-oriented software specification and verification, but do not yet have a good handle on how inheritance can be exploited in specification and verification. Other issues are also important in the practice of component-based systems, such as concurrency, mechanization and scalability, performance (time and space), reusability, and understandability. The aim is to brainstorm about these and related topics to understand both the problems involved and how formal techniques may be useful in solving them.

The goals of the workshop are to produce:

1. An outline of collaborative research topics,

2. A list of areas for further exploration,

3. An initial taxonomy of the different dimensions along which research in the area can be categorized. For instance, static/dynamic verification, modular/whole program analysis, partial/complete specification, soundness/completeness of the analysis, are all continuums along which particular techniques can be placed, and

4. A web site that will be maintained after the workshop to act as a central clearinghouse for research in this area.

We received 17 submissions. All papers were reviewed by at least 3 PC members. After PC discussions via a conference tool, 8 papers were accepted for long presentation at the workshop. Similar to previous years, we accepted 6 additional submissions for short presentation, reflecting the community-building role of SAVCBS and the goal of promoting discussion and incubation of new ideas for which a full paper may be premature. One of the accepted short presentations was withdrawn by the authors. Three submissions were rejected.

This year's program also includes a solution to a specification and verification challenge problem posed to workshop attendees. The problem focused on the specification of the subject-observer pattern. This common programming pattern is to separate the component that encapsulates some state from the components that access that state. The former component is often called a subject, while the latter type is an observer. At a minimum, a subject has a method for registering an observer, a method for updating the encapsulated state, and a method for retrieving the value of the state. Observers must provide a method for being notified: the behavior of the pair is that when the update method is called, all registered observers have their notification method called. While familiar to many programmers, this problem poses real challenges for specification and verification systems and it has already been the topic of a number of papers in the field. The received and presented solution was reviewed by two members of the program committee.

Skip Table Of Content Section
Article
Effective verification of systems with a dynamic number of components

In the paper, we present a novel approach to verification of dynamic component-based systems, the systems that can have a changing number of components over their life-time. We focus our attention on systems with a stable part (called provider) and a ...

Article
Plan-directed architectural change for autonomous systems

Autonomous systems operate in an unpredictable world, where communication with those people responsible for its software architecture may be infrequent or undesirable. If such a system is to continue reliable operation it must be able to derive and ...

Article
Reachability analysis for annotated code

Well-specified programs enable code reuse and therefore techniques that help programmers to annotate code correctly are valuable. We devised an automated analysis that detects unreachable code in the presence of code annotations. We implemented it as an ...

Article
Faithful mapping of model classes to mathematical structures

Abstraction techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented specification languages like JML, a powerful abstraction technique is the use of model classes, that is, classes that ...

Article
Proof-transforming compilation of programs with abrupt termination

The execution of untrusted bytecode programs can produce undesired behavior. A proof on the bytecode programs can be generated to ensure safe execution. Automatic techniques to generate proofs, such as certifying compilation, can only be used for a ...

Article
An integrated verification environment for JML: architecture and early results

Tool support for the Java Modeling Language (JML) is a very pressing problem. A main issue with current tools is their architecture: the cost of keeping up with the evolution of Java is prohibitively high: e.g., almost three years following its release, ...

Article
Playing with time in publish-subscribe using a domain-specific model checker

Thanks to the sharp decoupling it fosters, the Publish-Subscribe paradigm is particularly suited to the implementation of dynamic applications where components join and leave the system unpredictably, and their distributed interactions change over time. ...

Article
On timed components and their abstraction

We develop a new technique for generating small-complexity abstractions of timed automata that provide an approximation of their timed input-output behavior. This abstraction is obtained by first augmenting the automaton with additional input clocks, ...

Article
Subject-observer specification with component-interaction automata

This paper presents our solution to the Subject-Observer Specification problem announced as the challenge problem of the SAVCBS 2007 workshop. The text consists of two parts. In the first part, we present the model of the Subject-Observer system in ...

Article
Game-based safety checking with Mage

Mage is a new experimental model checker based on game semantics. It adapts several techniques including lazy (on-the-fly) modelling, symbolic modelling, C.E.G.A.R. and approximated counterexample certification to game models. It demonstrates the ...

Article
Specification and verification of trustworthy component-based real-time reactive systems

This paper presents a formal methodology for the development of trustworthy real-time reactive systems (RTRS). Safety and security are considered as the two significant properties for trustworthy RTRS. The paper presents an overview of a component-based ...

Article
Components, objects, and contracts

Being a composite part of a larger system, a crucial feature of a component is its interface, as it describes the component's interaction with the rest of the system in an abstract manner. It is now commonly accepted that simple syntactic interfaces are ...

Article
Compositional failure-based semantic equivalences for Reo specifications

Reo is a coordination language for modeling component connectors of component-based computing systems. We show that the failure-based equivalences NDFD and CFFD are congruences with respect to composition operators of Reo.

Article
A concept for dynamic wiring of components: correctness in dynamic adaptive systems

Component-based Systems in our days tend to be more and more dynamic. Due to the increased mobility of devices hosting components, components have to be attached or detached to respectively from a system at runtime. This dynamic adaptation of the system ...

Contributors
  • University of Kaiserslautern-Landau

Recommendations

Acceptance Rates

SAVCBS '07 Paper Acceptance Rate 8 of 17 submissions, 47%;
Overall Acceptance Rate 37 of 46 submissions, 80%
YearSubmittedAcceptedRate
SAVCBS '0717847%
SAVCBS '061414100%
SAVCBS '051515100%
Overall463780%