Towards Structured Specifying: Theory, Practice, Applications |
Contents
Preface | 7 |
The semilattice of specifications | 32 |
A generalized specification model | 44 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
axiomatically axioms and rules binary relations Boudriga candidate programs cartesian product Chapter clause condition ics continuous process correct with respect current input deductive system definition denote discrete mathematics dom(R domain element empty equivalence equivalence relation expression floor formal function f functional abstraction given glb(R,R Hence illustrative example image set init axiom init pop init rule init top axiom input sequence input space integer interpretation least fixpoint least upper bound lemma less-defined lift lub(R,R mathematics memory bearing systems memoryless programs Mili monitor more-defined newline notation O-operation operation output space partially correct past inputs predicate procedure proof properties Proposition prove push pop rule Q.init Q.init.Q q.init.top Q=q.init.push(t R-minimal element R1 and R2 relation defined relative product represented request reset sequence Q SOFTWARE ENGINEERING specifier group stack data type subset sufficient conditions terminates theorem transitive closure trivial University of Tunis validation group verification and validation verify y)ER y=error