On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type schemes.- Optimal run time optimization proved by a new look at abstract interpretations.- Transformation ordering.- On parametric algebraic specifications with clean error handling.- Toward formal development of programs from algebraic specifications: Implementations revisited.- Finite algebraic specifications of semicomputable data types.- On the semantics of concurrency: Partial orders and transition systems.- CCS without ?'s.- A fully observational model for infinite behaviours of communicating systems.- SMoLCS-driven concurrent calculi.- Parameterized horn clause specifications: Proof theory and correctness.- Partial composition and recursion of module specifications.- Efficient representation of taxonomies.- Applications of compactness in the Smyth powerdomain of streams.- Characterizing Kripke structures in temporal logic.- Dialogue with a proof system.- Induction principles formalized in the calculus of constructions.- Algebraic semantics.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Roberto Bruni is an associate professor in the Dept. of Computer Science of the University of Pisa. His research interests include concurrency, operational semantics, Petri nets, Java programming, business process modelling, software composition, and fog computing, and he teaches related courses to computer science and business informatics graduate and undergraduate students. He has served the community with committee membership of conferences such as FACS, Coordination, CONCUR and WRLA. He was previously an international fellow of the SRI International Computer Science Laboratory, and a visiting scholar of the University of Illinois at Urbana-Champaign.Ugo Montanari is an emeritus professor in the Dept. of Computer Science of the University of Pisa. He has published over 400 refereed articles or papers in theoretical computer science and artificial intelligence. His current research interests are the semantics of concurrency, process description languages, constraint programming, graph transformation systems, coordination models, algebraic and categorical models of concurrency, models and languages for open distributed systems, network-aware programming, service-oriented computing, and collective autonomic systems. He has served as a board member for key international scientific journals such as Fundamenta Informaticae, Theoretical Computer Science, Computer Science Review, Artificial Intelligence, the IEEE Transactions on Software Engineering, Logic Programming, Science of Computer Programming, Theory and Practice of Logic Programming, and New Generation Computing, and he has served the community as a chair or committee member, PC or steering, of major related conferences such as CONCUR, WRLA, CP, CALCO, CMCS, ICGT, and TGC. He was Vice-Director of the IMT School for Advanced Studies, Lucca. He is member of the Academia Europaea.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Zustand: Good. Volume 1. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,600grams, ISBN:3540176608. Bestandsnummer des Verkäufers 8494011
Anzahl: 1 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type schemes.- Optimal run time optimization proved by a new look at abstract interpretations.- Transformation ordering.- On parametric algebraic specifications with clean error handling.- Toward formal development of programs from algebraic specifications: Implementations revisited.- Finite algebraic specifications of semicomputable data types.- On the semantics of concurrency: Partial orders and transition systems.- CCS without 's.- A fully observational model for infinite behaviours of communicating systems.- SMoLCS-driven concurrent calculi.- Parameterized horn clause specifications: Proof theory and correctness.- Partial composition and recursion of module specifications.- Efficient representation of taxonomies.- Applications of compactness in the Smyth powerdomain of streams.- Characterizing Kripke structures in temporal logic.- Dialogue with a proof system.- Induction principles formalized in the calculus of constructions.- Algebraic semantics. 312 pp. Englisch. Bestandsnummer des Verkäufers 9783540176602
Anzahl: 1 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Bestandsnummer des Verkäufers I-9783540176602
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 5899001-n
Anzahl: 15 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 5899001
Anzahl: 15 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Bestandsnummer des Verkäufers ria9783540176602_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type schemes.- Optimal run time optimization proved by a new look at abstract interpretations.- Transformation ordering.- On parametric algebraic specifications with clean error handling.- Toward formal development of programs from algebraic specifications: Implementations revisited.- Finite algebraic specifications of semicomputable data types.- On the semantics of concurrency: Partial orders and transition systems.- CCS without 's.- A fully observational model for infinite behaviours of communicating systems.- SMoLCS-driven concurrent calculi.- Parameterized horn clause specifications: Proof theory and correctness.- Partial composition and recursion of module specifications.- Efficient representation of taxonomies.- Applications of compactness in the Smyth powerdomain of streams.- Characterizing Kripke structures in temporal logic.- Dialogue with a proof system.- Induction principles formalized in the calculus of constructions.- Algebraic semantics. Bestandsnummer des Verkäufers 9783540176602
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type sch. Bestandsnummer des Verkäufers 4883495
Anzahl: 1 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type schemes.- Optimal run time optimization proved by a new look at abstract interpretations.- Transformation ordering.- On parametric algebraic specifications with clean error handling.- Toward formal development of programs from algebraic specifications: Implementations revisited.- Finite algebraic specifications of semicomputable data types.- On the semantics of concurrency: Partial orders and transition systems.- CCS without 's.- A fully observational model for infinite behaviours of communicating systems.- SMoLCS-driven concurrent calculi.- Parameterized horn clause specifications: Proof theory and correctness.- Partial composition and recursion of module specifications.- Efficient representation of taxonomies.- Applications of compactness in the Smyth powerdomain of streams.- Characterizing Kripke structures in temporal logic.- Dialogue with a proof system.- Induction principles formalized in the calculus of constructions.- Algebraic semantics.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 312 pp. Englisch. Bestandsnummer des Verkäufers 9783540176602
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987 | Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87) | Hartmut Ehrig (u. a.) | Taschenbuch | xviii | Englisch | 1987 | Springer | EAN 9783540176602 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Bestandsnummer des Verkäufers 102147775
Anzahl: 1 verfügbar