Sciweavers

2514 search results - page 356 / 503
» The use of industrial-strength formal methods
Sort
View
CSFW
2005
IEEE
16 years 1 days ago
Compositional Analysis of Contract Signing Protocols
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
Michael Backes, Anupam Datta, Ante Derek, John C. ...
ICWS
2003
IEEE
15 years 7 months ago
Application of Linear Logic to Web Service Composition
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
Jinghai Rao, Peep Küngas, Mihhail Matskin
AAAI
2000
15 years 7 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
EOR
2006
130views more  EOR 2006»
15 years 6 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni
ENTCS
2007
114views more  ENTCS 2007»
15 years 6 months ago
Parametric Performance Contracts for Software Components with Concurrent Behaviour
Performance prediction methods for component-based software systems aim at supporting design decisions of software architects during early development stages. With the increased a...
Jens Happe, Heiko Koziolek, Ralf Reussner