Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development . Notes in Computer Science, 185, Band 185)

Ehrig, Hartmut, James Thatcher Maurice Nivat u. a.:

ISBN 10: 3540151982 / ISBN 13: 9783540151982

Editore: Springer, 2008

Riguardo questo articolo

436 Seiten Gedunkelt. Innerhalb Deutschlands Versand je nach Größe/Gewicht als Großbrief bzw. Bücher- und Warensendung mit der Post oder per DHL. Rechnung mit MwSt.-Ausweis liegt jeder Lieferung bei. Sprache: Englisch Gewicht in Gramm: 658 Taschenbuch, Größe: 15.5 x 2.5 x 23.5 cm.

Codice articolo 810249

Dati bibliografici

• Titolo: Mathematical Foundations of Software Development. Proceedings of the International Joint Conference on Theory and Practice of Software Development . Notes in Computer Science, 185, Band 185)
• Editore: Springer
• Data di pubblicazione: 2008
• Lingua: Inglese
• ISBN 10: 3540151982
• ISBN 13: 9783540151982
• Rilegatura: Brossura
• Edizione: 1985.
• Condizione: Gut
• Peso: 658 grammi
• Cataloghi dei venditori:
  • Informatik

Descrizione articolo

Contenuti

Specification and top down design of distributed systems.- Specification languages for distributed systems.- Semantically based programming tools (Summary).- From function level semantics to program transformation and optimization.- Inductively defined functions.- Three approaches to type structure.- On the maximum size of random trees.- Fast searching in a real algebraic manifold with applications to geometric complexity.- Typed categorical combinatory logic.- A path ordering for proving termination of term rewriting systems.- A rewrite rule based approach for synthesizing abstract data types.- “Delayability” in proofs of strong normalizability in the typed lambda Calculus.- Bisimulations and abstraction homomorphisms.- A metric characterization of fair computations in CCS.- A complete modal proof system for a subset of SCCS.- Amalgamation of graph transformations with applications to synchronization.- Decompilation of control structures by means of graph transformations.- Synchronized bottom-up tree automata and L-systems.- On observational equivalence and algebraic specification.- Parameter preserving data type specifications.- On the parameterized algebraic specification of concurrent systems.- The semantics of shared submodules specifications.- Why Horn formulas matter in computer science: Initial structures and generic examples.- On the implementation of abstract data types by programming language constructs.- A LISP compiler for FP language and its proof via algebraic semantics.