Results 271 to 280 of about 553,328 (316)
Some of the next articles are maybe not open access.
Metavariables and Conditional Refinements in the Refinement Calculus
1994We describe two techniques for the refinement calculus that facilitate goal-directed development. The techniques achieve this by allowing the deferring of decisions about the precise form of refinement steps, so high-level choices can be expressed as soon as those choices are appropriate.
Raymond G. Nickson, Lindsay J. Groves
openaire +1 more source
The Least Conjunctive Refinement and Promotion in the Refinement Calculus
Formal Aspects of Computing, 1999Abstract. A syntactic calculation of Morgan's least conjunctive refinement operator for predicate transformers is developed. The operator is used to develop a general approach to lifting relational operators to predicate transformer operators.
openaire +2 more sources
2015
Counterexample-guided abstraction refinement CEGAR is a property-directed approach for the automatic construction of an abstract model for a given system. The approach learns information from infeasible error paths in order to refine the abstract model.
Dirk Beyer 0001 +2 more
openaire +1 more source
Counterexample-guided abstraction refinement CEGAR is a property-directed approach for the automatic construction of an abstract model for a given system. The approach learns information from infeasible error paths in order to refine the abstract model.
Dirk Beyer 0001 +2 more
openaire +1 more source
2006
The purpose of this initial chapter is to introduce concepts and techniques assumed as general background in the remaining chapters of this book. The relevant notions are introduced using a simple and well-known programming notation: Dijkstra’s language of guarded commands [18], presented in Section [1].
Ana Cavalcanti 0001 +2 more
openaire +1 more source
The purpose of this initial chapter is to introduce concepts and techniques assumed as general background in the remaining chapters of this book. The relevant notions are introduced using a simple and well-known programming notation: Dijkstra’s language of guarded commands [18], presented in Section [1].
Ana Cavalcanti 0001 +2 more
openaire +1 more source
Formal Aspects of Computing, 2012
Abstract Emergent behaviour—system behaviour not determined by the behaviours of system components when considered in isolation—is commonplace in multi-agent systems, particularly when agents adapt to environmental change. This article considers the manner in which Formal Methods may be used to authenticate the trustworthiness of such systems.
Jeff W. Sanders, Graeme Smith 0001
openaire +4 more sources
Abstract Emergent behaviour—system behaviour not determined by the behaviours of system components when considered in isolation—is commonplace in multi-agent systems, particularly when agents adapt to environmental change. This article considers the manner in which Formal Methods may be used to authenticate the trustworthiness of such systems.
Jeff W. Sanders, Graeme Smith 0001
openaire +4 more sources
Scientific American, 1919
<div class="htmlview paragraph">A short account of the discovery and early development of the oils in the Appalachian Field is followed by a description of several oil-testing instruments and of modern refinery practice with diagrams and drawings.
openaire +1 more source
<div class="htmlview paragraph">A short account of the discovery and early development of the oils in the Appalachian Field is followed by a description of several oil-testing instruments and of modern refinery practice with diagrams and drawings.
openaire +1 more source
1990
We investigate equivalence notions for concurrent systems. We consider “linear time” approaches where the system behaviour is characterised as the set of possible runs as well as “branching time” approaches where the conflict structure of systems is taken into account. We show that the usual interleaving equivalences, and also the equivalences based on
Rob van Glabbeek, Ursula Goltz
openaire +2 more sources
We investigate equivalence notions for concurrent systems. We consider “linear time” approaches where the system behaviour is characterised as the set of possible runs as well as “branching time” approaches where the conflict structure of systems is taken into account. We show that the usual interleaving equivalences, and also the equivalences based on
Rob van Glabbeek, Ursula Goltz
openaire +2 more sources
SSRN Electronic Journal, 2014
Despite claims that the modern approach to interpretation of contracts has usurped much of its function, the equitable jurisdiction to rectify a written contract on the ground of common mistake remains one of the most practically important areas of the law of contract.
openaire +2 more sources
Despite claims that the modern approach to interpretation of contracts has usurped much of its function, the equitable jurisdiction to rectify a written contract on the ground of common mistake remains one of the most practically important areas of the law of contract.
openaire +2 more sources
Refinement and Confidentiality
1992As computer systems become more powerful and cheaper they permeate more of our everyday life. With this greater reliance on the automated processing and movement of our personal information comes a duty to demonstrate that computer systems are secure.
openaire +1 more source