Sciweavers

1356 search results - page 18 / 272
» The ideal of verified software
Sort
View
SIGSOFT
2003
ACM
16 years 13 days ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
ACMSE
2007
ACM
15 years 3 months ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy
ATAL
2009
Springer
15 years 4 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
HICSS
2000
IEEE
153views Biometrics» more  HICSS 2000»
15 years 4 months ago
On Verifying Distributed Multithreaded Java Programs
Distributed multithreaded software systems are becoming more and more important in modern networked environment. For these systems, concurrency control and thread synchronization ...
Jessica Chen
HCI
2009
14 years 9 months ago
Trust in Online Technology: Towards Practical Guidelines Based on Experimentally Verified Theory
Abstract. A large amount of research attempts to define trust, yet relatively little research attempts to experimentally verify what makes trust needed in interactions with humans ...
Christian Detweiler, Joost Broekens