No Logics of Programs Read a customer review or write one .
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 8,02 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisEUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : Hay-on-Wye Booksellers, Hay-on-Wye, HEREF, Royaume-Uni
Etat : Good. This Paperback edition is in a good clean condition throughout. There are some signs of wear in places. Bottom right corner of the cover is a little bent. Inscriptions at the front, clean and readable throughout. N° de réf. du vendeur 109634-6
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A static analysis of CSP programs.- Compactness in semantics for merge and fair merge.- Algebraic tools for system construction.- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness.- The intractabilit. N° de réf. du vendeur 4881987
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783540128960_new
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - A static analysis of CSP programs.- Compactness in semantics for merge and fair merge.- Algebraic tools for system construction.- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness.- The intractability of validity in logic programming and dynamic logic.- A semantics and proof system for communicating processes.- Non-standard fixed points in first order logic.- Automatic verification of asynchronous circuits.- Mathematics as programming.- Characterization of acceptable by algol-like programming languages.- A rigorous approach to fault-tolerant system development.- A sound and relatively complete axiomatization of clarke's language L4.- Deciding branching time logic: A triple exponential decision procedure for CTL.- Equations in combinatory algebras.- Reasoning about procedures as parameters.- Introducing institutions.- A complete proof rule for strong equifair termination.- Necessary and sufficient conditions for the universality of programming formalisms.- There exist decidable context free propositonal dynamic logics.- A decision procedure for the propositional -calculus.- A verifier for compact parallel coordination programs.- Information systems, continuity and realizability.- A complete system of temporal logic for specification schemata.- Reasoning in interval temporal logic.- Hoare's logic for programs with procedures ¿ What has been achieved .- A theory of probabilistic programs.- A low level language for obtaining decision procedures for classes of temporal logics.- Deriving efficient graph algorithms (summary).- An introduction to specification logic.- An interval-based temporal logic.- Property preserving homomorphisms of transition systems.- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview.- Yet another process logic.- A proof system for partial correctness of dynamic networks of processes.- Errata. N° de réf. du vendeur 9783540128960
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -A static analysis of CSP programs.- Compactness in semantics for merge and fair merge.- Algebraic tools for system construction.- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness.- The intractability of validity in logic programming and dynamic logic.- A semantics and proof system for communicating processes.- Non-standard fixed points in first order logic.- Automatic verification of asynchronous circuits.- Mathematics as programming.- Characterization of acceptable by algol-like programming languages.- A rigorous approach to fault-tolerant system development.- A sound and relatively complete axiomatization of clarke's language L4.- Deciding branching time logic: A triple exponential decision procedure for CTL.- Equations in combinatory algebras.- Reasoning about procedures as parameters.- Introducing institutions.- A complete proof rule for strong equifair termination.- Necessary and sufficient conditions for the universality of programming formalisms.- There exist decidable context free propositonal dynamic logics.- A decision procedure for the propositional -calculus.- A verifier for compact parallel coordination programs.- Information systems, continuity and realizability.- A complete system of temporal logic for specification schemata.- Reasoning in interval temporal logic.- Hoare's logic for programs with procedures ¿ What has been achieved .- A theory of probabilistic programs.- A low level language for obtaining decision procedures for classes of temporal logics.- Deriving efficient graph algorithms (summary).- An introduction to specification logic.- An interval-based temporal logic.- Property preserving homomorphisms of transition systems.- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview.- Yet another process logic.- A proof system for partial correctness of dynamic networks of processes.- Errata. 540 pp. Englisch. N° de réf. du vendeur 9783540128960
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -A static analysis of CSP programs.- Compactness in semantics for merge and fair merge.- Algebraic tools for system construction.- PC-compactness, a necessary condition for the existence of sound and complete logics of partial correctness.- The intractability of validity in logic programming and dynamic logic.- A semantics and proof system for communicating processes.- Non-standard fixed points in first order logic.- Automatic verification of asynchronous circuits.- Mathematics as programming.- Characterization of acceptable by algol-like programming languages.- A rigorous approach to fault-tolerant system development.- A sound and relatively complete axiomatization of clarke's language L4.- Deciding branching time logic: A triple exponential decision procedure for CTL.- Equations in combinatory algebras.- Reasoning about procedures as parameters.- Introducing institutions.- A complete proof rule for strong equifair termination.- Necessary and sufficient conditions for the universality of programming formalisms.- There exist decidable context free propositonal dynamic logics.- A decision procedure for the propositional -calculus.- A verifier for compact parallel coordination programs.- Information systems, continuity and realizability.- A complete system of temporal logic for specification schemata.- Reasoning in interval temporal logic.- Hoare's logic for programs with procedures ¿ What has been achieved .- A theory of probabilistic programs.- A low level language for obtaining decision procedures for classes of temporal logics.- Deriving efficient graph algorithms (summary).- An introduction to specification logic.- An interval-based temporal logic.- Property preserving homomorphisms of transition systems.- From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview.- Yet another process logic.- A proof system for partial correctness of dynamic networks of processes.- Errata.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 540 pp. Englisch. N° de réf. du vendeur 9783540128960
Quantité disponible : 2 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9783540128960
Quantité disponible : 10 disponible(s)
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. N° de réf. du vendeur UTD14a-1993
Quantité disponible : 1 disponible(s)
Vendeur : Best Price, Torrance, CA, Etats-Unis
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9783540128960
Quantité disponible : 1 disponible(s)