Sciweavers

592 search results - page 33 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
FTRTFT
2000
Springer
13 years 11 months ago
Modeling Faults of Distributed, Reactive Systems
Formal methods can improve the development of systems with high quality requirements, since they usually o er a precise, nonambiguous speci cation language and allow rigorous veri ...
Max Breitling
DGCI
2005
Springer
14 years 1 months ago
Algorithms for the Topological Watershed
The watershed transformation is an efficient tool for segmenting grayscale images. An original approach to the watershed [1,9] consists in modifying the original image by lowering...
Michel Couprie, Laurent Najman, Gilles Bertrand
FTDCS
2004
IEEE
13 years 11 months ago
Introducing Compositionality in Web Service Descriptions
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
Monika Solanki, Antonio Cau, Hussein Zedan
AOSD
2010
ACM
14 years 2 months ago
A theory of distributed aspects
Over the last five years, several systems have been proposed to take distribution into account in Aspect-Oriented Programming. While they appeared to be fruitful to develop or im...
Nicolas Tabareau
PLDI
2010
ACM
13 years 11 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner