Sciweavers

592 search results - page 17 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 5 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
FM
2008
Springer
184views Formal Methods» more  FM 2008»
13 years 9 months ago
Safe and Reliable Metro Platform Screen Doors Control/Command Systems
In this article we would like to present some recent applications of the B formal method to the development of safety critical system. These SIL3/SIL41 compliant systems have their...
Thierry Lecomte
PLDI
2009
ACM
14 years 8 months ago
An integrated proof language for imperative programs
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
Karen Zee, Viktor Kuncak, Martin C. Rinard
CD
2005
Springer
14 years 1 months ago
Modelling Deployment Using Feature Descriptions and State Models for Component-Based Software Product Families
Abstract. Products within a product family are composed of different component configurations where components have different variable features and a large amount of dependency re...
Slinger Jansen, Sjaak Brinkkemper
ICSM
2009
IEEE
14 years 2 months ago
Prioritizing component compatibility tests via user preferences
Many software systems rely on third-party components during their build process. Because the components are constantly evolving, quality assurance demands that developers perform ...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....