|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
1487975 |
| 003 |
ICU |
| 005 |
19970810103300.0 |
| 008 |
930803s1992 enka 001 0 eng |
| 010 |
|
|
|a 92253191
|
| 020 |
|
|
|a 0521434572
|
| 035 |
|
|
|a (ICU)BID17345132
|
| 035 |
|
|
|a (OCoLC)27680819
|
| 040 |
|
|
|c DLC$dOrLoB
|
| 050 |
0 |
0 |
|a QA76.76.D47
|b F44 1992
|
| 082 |
|
|
|a 005.1/2
|2 20
|
| 100 |
1 |
|
|a Feijs, L. M. G.
|q (Loe M. G.)
|0 http://id.loc.gov/authorities/names/n91020568
|1 http://viaf.org/viaf/93752972
|
| 245 |
1 |
0 |
|a Formal specification and design /
|c L.M.G. Feijs & H.B.M. Jonkers.
|
| 260 |
|
|
|a Cambridge ;
|a New York :
|b Cambridge University Press,
|c 1992.
|
| 300 |
|
|
|a xvi, 335 p. :
|b ill. ;
|c 26 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|0 http://id.loc.gov/vocabulary/contentTypes/txt
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|0 http://id.loc.gov/vocabulary/mediaTypes/n
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|0 http://id.loc.gov/vocabulary/carriers/nc
|
| 440 |
|
0 |
|a Cambridge tracts in theoretical computer science
|v 35
|
| 504 |
|
|
|a Includes bibliographical reference (p. 303-307) and index.
|
| 505 |
2 |
0 |
|g 1.
|t Algebraic specification.
|g 1.
|t Introducing the basic concepts.
|g 1.2.
|t What is a(n algebraic) specification?
|g 1.3.
|t Names and signatures.
|g 1.4.
|t Algebras.
|g 1.5.
|t Flat algebraic specifications.
|g 1.6.
|t Terms and assertions.
|g 1.7.
|t Undefinedness and strictness.
|g 1.8.
|t Example: specification of switches.
|g 1.9.
|t Initial algebras.
|g 1.10.
|t Example: specification of pairs of switches.
|g 1.11.
|t Example: specification of natural numbers.
|g 2.
|t Setting up algebraic specifications.
|g 2.2.
|t Inductive predicate definitions.
|g 2.3.
|t Horn clauses.
|g 2.4.
|t Inductive function definitions.
|g 2.5.
|t Proof obligations and applications.
|g 2.6.
|t Consistency and categoricity.
|g 2.7.
|t How to set up an algebraic specification.
|g 2.8.
|t Example: specification of queues.
|g 2.9.
|t Example: specification of stacks.
|g 2.10.
|t Example: specification of bags.
|g 2.11.
|t Example: specification of symbolic expressions.
|g 3.
|t Structuring algebraic specifications.
|g 3.2.
|t Flat schemes.
|g 3.3.
|t Export schemes.
|g 3.4.
|t Import schemes.
|g 3.5.
|t Renaming schemes.
|g 3.6.
|t Abbreviation schemes.
|g 3.7.
|t Semantics of normal-form specifications.
|g 3.8.
|t Hidden names.
|g 4.
|t Implementing algebraic specifications.
|g 4.2.
|t Expressions.
|g 4.3.
|t Term interpretation of expressions.
|g 4.4.
|t Declarations.
|g 4.5.
|t Survey of assertions and expressions.
|g 4.6.
|t Algorithmic predicate definitions.
|g 4.7.
|t Algorithmic function definitions.
|g 4.8.
|t From inductive to algorithmic definitions.
|g 4.9.
|t Implementing an algebraic specification.
|g 4.10.
|t Example: implementation of sets --
|g II.
|t State-based specification.
|g 5.
|t From algebras to states.
|g 5.2.
|t What is a state-based specification?
|g 5.3.
|t Procedure names and class signatures.
|g 5.4.
|t States as algebras.
|g 5.5.
|t Classes.
|g 5.6.
|t Introducing variables.
|g 5.7.
|t Procedure definitions.
|g 5.8.
|t Comparison with imperative programs.
|g 5.9.
|t From predicate logic to dynamic logic.
|g 5.10.
|t Classes and specifications.
|g 6.
|t Setting up state-based specifications.
|g 6.1.
|t Kinds of axioms.
|g 6.2.
|t Example: specification of traffic lights.
|g 6.2.1.
|t Properties of all states.
|g 6.2.2.
|t Invariance properties.
|g 6.2.3.
|t Properties of the initial state.
|g 6.2.4.
|t Properties of state transitions.
|g 6.3.
|t Example: specification of attributes.
|g 6.4.
|t Example: specification of buffers.
|g 6.5.
|t Example: specification of a display.
|g 6.6.
|t How to set up an axiomatic state-based class description.
|g 7.
|t Structuring state-based specifications.
|g 7.2.
|t Example: specification of a database.
|g 7.2.1.
|t Tuples and relations.
|g 7.2.2.
|t Database schemas.
|g 7.2.3.
|t The contents of a database.
|g 7.2.4.
|t Tuple variables.
|g 7.2.5.
|t Expressions and qualifications.
|g 7.2.6.
|t Well-formedness.
|g 7.2.7.
|t Semantics of queries.
|g 7.2.8.
|t Example of an interactive session.
|g 8.
|t Implementing state-based specifications.
|g 8.2.
|t Statements.
|g 8.3.
|t Algorithmic procedure definitions.
|g 8.4.
|t Example: implementation of division.
|g 8.5.
|t Towards an implementation strategy.
|g 8.6.
|t The implementation strategy.
|g 8.7.
|t Example: implementation of a line editor.
|g 8.7.1.
|t Specifying the system.
|g 8.7.2.
|t Documenting a building block.
|g 8.7.3.
|t Choosing a representation.
|g 8.7.4.
|t Adding display-oriented features.
|g 8.7.5.
|t Implementing the display-oriented features.
|g 8.7.6.
|t Translation to C.
|g 8.7.7.
|t Executing the program --
|g III.
|t Advanced techniques.
|g 9.
|t Theoretical topics.
|g 9.2.
|t Undefinedness revisited.
|g 9.3.
|t Initial algebras.
|g 9.4.
|t Horn clauses.
|g 9.5.
|t Origin consistency.
|g 9.6.
|t Comparing two types of models.
|g 9.7.
|t The class concept revisited.
|g 10.
|t Additional language constructs.
|g 10.2.
|t Liberal scope rules.
|g 10.3.
|t Free definitions.
|g 10.4.
|t Parameterisation.
|g 10.5.
|t Abstraction schemes.
|g 10.6.
|t Application schemes.
|g 10.7.
|t Extending the normalization procedure.
|g 10.8.
|t More complex parameter restrictions.
|g 10.9.
|t Object creation and procedures with results.
|g 10.10.
|t Variable sort definitions.
|g 10.11.
|t Dependent definitions.
|g 10.12.
|t Example: specification of instances.
|g 10.13.
|t Unifying expressions and statements.
|g 11.
|t Towards large systems.
|g 11.2.
|t Graphical representation of modules.
|g 11.3.
|t Components and designs.
|g 11.4.
|t Applications.
|g 11.5.
|t Concluding remarks.
|t A Syntax.
|t A.1 General.
|t A.2 Concrete syntax.
|t A.3 Tokens.
|t A.4 Keywords.
|t A.5 Comments.
|t A.6 Grammar.
|t A.7 Operator priorities and associativities.
|t A.7.1 Operators in renamings and signatures.
|t A.7.2 Operators in assertions and expressions.
|t B Standard library.
|t B.1 Booleans.
|t B.2 Natural numbers.
|t B.3 Characters.
|t B.4 Tuples.
|t B.5 Finite sets.
|t B.6 Finite bags.
|t B.7 Finite sequences.
|t B.8 Finite maps.
|
| 650 |
|
0 |
|a Computer software
|x Development
|0 http://id.loc.gov/authorities/subjects/sh85029535
|
| 650 |
|
0 |
|a Object-oriented programming (Computer science)
|0 http://id.loc.gov/authorities/subjects/sh87007503
|
| 650 |
|
7 |
|a Computer software
|x Development.
|2 fast
|0 http://id.worldcat.org/fast/fst00872537
|
| 650 |
|
7 |
|a Object-oriented programming (Computer science)
|2 fast
|0 http://id.worldcat.org/fast/fst01042804
|
| 700 |
1 |
0 |
|a Jonkers, H. B. M.
|0 http://id.loc.gov/authorities/names/n86852564
|1 http://viaf.org/viaf/10159749
|
| 850 |
|
|
|a ICU
|
| 901 |
|
|
|a ToCBNA
|
| 903 |
|
|
|a HeVa
|
| 929 |
|
|
|a cat
|
| 999 |
f |
f |
|i 1e24f373-2c8b-5eee-ad5d-f9c95eae0572
|s 73bea1c6-a1ba-5135-9dc7-7f5c35355c79
|
| 928 |
|
|
|t Library of Congress classification
|a QA76.76.D47F440 1992
|l ASR
|c ASR-SciASR
|i 2553880
|
| 927 |
|
|
|t Library of Congress classification
|a QA76.76.D47F440 1992
|l ASR
|c ASR-SciASR
|e CRERAR
|b 39364559
|i 2876421
|
