Titlebook: 5th Refinement Workshop; Proceedings of the 5 Cliff B. Jones,Roger C. Shaw,Tim Denvir Conference proceedings 1992 Springer-Verlag London 19

小蟲

PRISE

旅行路線

https://doi.org/10.1007/978-3-031-64495-5mal and informal elements: the formal elements follow the style of the refinement calculus, while the informal elements follow Knuth’s literate programming style. The combination of formal and informal elements allows for selective verification, an important requirement for practical use of formal r

genesis

Abdullah Nazhat Abdullah,Tarkan Aydinethods to the development of highly assured secure systems..Problems arising in the use of the standard paradigm for specification and refinement in Z are identified and discussed. Alternative methods which overcome some of these difficulties are presented..A fully worked example is provided showing

歌劇等

Abdelrahman Alkhodary,Berke Gurnd movement of our personal information comes a duty to demonstrate that computer systems are secure. Unfortuneately refinement which preserves “functional” properties does not necessarily preserve properties concerning the confidentiality of information. In this paper a way of describing confidenti

令人心醉

https://doi.org/10.1007/978-3-031-68098-4be synthesized by calculation in SETS, and the potential of this calculus for assessing, comparing or classifying specifications..The main results of the paper are concerned with a functorial approach to reification, particularly .. the systematic implementation of recursive data domains on non-recu

認(rèn)為

Synthesis Lectures on Network Systemstruction. A number of workers have developed such systems which are mainly based on a predicate transformer semantics. In this paper an alternative system is proposed, which is based instead on predicates in first order logic. This is a simpler framework, and its strengths and weaknesses are explore

miracle

著名

https://doi.org/10.1007/978-3-0348-0012-9own to be useful in program synthesis, where the unknown program can itself be represented by a parameterised metavariable, through an example which also illustrates some larger scale strategies for proof construction. Some conclusions are drawn concerning the mechanical support of this approach to

赦免