Titlebook: Engineering Theories of Software Intensive Systems; Proceedings of the N Manfred Broy,Johannes Grünbauer,Tony Hoare Conference proceedings

有抱負者

Interface-Based Design interfaces specify the protocol aspects of component interaction. Their formalization, called ., permits a compiler to check the compatibility of component interaction protocols. Interface automata support incremental design and independent implementability. Incremental design means that the compat

glisten

The Dependent Delegate Dilemmanships: a supplier (.) called from within the execution of a routine, where the invariant is not required to hold, may call back into the originating object, which it then catches in an inconsistent state. This is one of the problems arising from the application of assertion-based semantics to a mod

盲信者

Formalizing Counterexample-Driven Refinement with Weakest Preconditionsf the safety property holds of the abstraction then it also holds of the original program..However, if the property does not hold of the abstraction along some trace . (a counterexample), it may or may not hold of the original program on trace .. If it can be proved that the property does not hold i

止痛藥

A Mechanically Checked Proof of a Comparator Sort Algorithmal signal processing chip. The abstract algorithm uses an unlimited number of systolic comparator modules to sort a stream of data. In addition to proving that the algorithm produces an ordered permutation of its input, we prove two theorems that are important to verifying the microcode implementati

obtuse

Keys in Formal Verificatione application of abstraction methods for their verification..After introducing the computational model of . (.) and the specification language of (linear) . (.), we describe a standard approach to verification by Finitary abstraction. This is a method by which an infinite-state system is abstracted

CRUC

逢迎春日

Process Algebra: A Unifying Approachir states, and whose edges are labelled with the names of events by which they interact with their environment. A trace of the behaviour of a process is recorded as a sequence of observable events in which the process engages. Refinement is defined as the inclusion of all traces of a more refined pr

aggrieve

調(diào)味品

A Tree Semantics of an Orchestration Languagepresentation of programming language semantics. The more operational styles give more concrete guidance to the implementer on how a program should be executed. The more abstract styles are more helpful in proving the correctness of particular programs. The style adopted in this paper is neutral betw

費解

Model Driven Security their security requirements and use tools to automatically generate system architectures from the models including complete, configured security infrastructures. Rather than fixing one particular modeling language for this process, we propose a general schema for constructing such languages that co