969 resultados para abstract
Resumo:
The verification of information flow properties of security devices is difficult because it involves the analysis of schematic diagrams, artwork, embedded software, etc. In addition, a typical security device has many modes, partial information flow, and needs to be fault tolerant. We propose a new approach to the verification of such devices based upon checking abstract information flow properties expressed as graphs. This approach has been implemented in software, and successfully used to find possible paths of information flow through security devices.
Resumo:
A number of integrations of the state-based specification language Object-Z and the process algebra CSP have been proposed in recent years. In developing such integrations, a number of semantic decisions have to be made. In particular, what happens when an operation's precondition is not satisfied? Is the operation blocked, i.e., prevented from occurring, or can it occur with an undefined result? Also, are outputs from operations angelic, satisfying the environment's constraints on them, or are they demonic and not influenced by the environment at all? In this paper we discuss the differences between the models, and show that by adopting a blocking model of preconditions together with an angelic model of outputs one can specify systems at higher levels of abstraction.
Resumo:
A Solomon four-group experiment, controlling for order effects, examined the effect of a sponsorship stimulus on consumers’ perceptions of concrete and abstract brand attributes. Results for this study suggested that consumers who are aware of an association between an event sponsorship and a brand demonstrate more favorable perceptions of abstract brand attributes than those who are unaware of such an association. The same favourable perceptions were not found for concrete brand attributes.
Resumo:
We extend the method of quasilinearization to differential equations in abstract normal cones. Under some assumptions, corresponding monotone iterations converge to the unique solution of our problem and this convergence is superlinear or semi–superlinear
Resumo:
∗ The work is partially supported by NSFR Grant No MM 409/94.
Resumo:
The paper introduces a method for dependencies discovery during human-machine interaction. It is based on an analysis of numerical data sets in knowledge-poor environments. The driven procedures are independent and they interact on a competitive principle. The research focuses on seven of them. The application is in Number Theory.