Sciweavers

2488 search results - page 127 / 498
» An improvement in formal verification
Sort
View
84
Voted
COOPIS
2004
IEEE
15 years 4 months ago
Checking Asynchronously Communicating Components Using Symbolic Transition Systems
Abstract. Explicit behavioural interface description languages (BIDLs, protocols) are now recognized as a mandatory feature of component languages in order to address component reu...
Olivier Maréchal, Pascal Poizat, Jean-Claud...
95
Voted
ACSD
2001
IEEE
74views Hardware» more  ACSD 2001»
15 years 4 months ago
From Code to Models
One of the corner stones of formal methods is the notion traction enables analysis. By the construction of act model we can trade implementation detail for analytical power. The i...
Gerard J. Holzmann
101
Voted
ATAL
2010
Springer
15 years 1 months ago
Model checking detectability of attacks in multiagent systems
Information security is vital to many multiagent system applications. In this paper we formalise the notion of detectability of attacks in a MAS setting and analyse its applicabil...
Ioana Boureanu, Mika Cohen, Alessio Lomuscio
104
Voted
RE
2008
Springer
15 years 8 days ago
Requirements Capture with RCAT
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex. With the increasing dependence on...
Margaret H. Smith, Klaus Havelund
SIGSOFT
2003
ACM
16 years 1 months 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