clarke e kozen d (8 risultati)

Condizione: New. In.

Paperback. Condizione: New.

Taschenbuch. Condizione: 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 semanticsfor ALGOL-like languages: An overview.- Yet another process logic.- A proof system for partial correctness of dynamic networks of processes.- Errata.

Taschenbuch. Condizione: Neu. Logics of Programs | Workshop Carnegie Mellon University Pittsburgh, PA, June 6-8, 1983 | E. Clarke (u. a.) | Taschenbuch | vi | Englisch | 1984 | Springer | EAN 9783540128960 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback/ broschiert. Condizione: Gut. 527 S. Programmierung Datenverarbeitung Mathematische Logik Mathematik guter Zustand/ good Ex-Library. Brownish paper. ha1082263 Sprache: Englisch Gewicht in Gramm: 900.

Taschenbuch. Condizione: 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.

Condizione: 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.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. 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 semanticsfor ALGOL-like languages: An overview.- Yet another process logic.- A proof system for partial correctness of dynamic networks of processes.- Errata.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 540 pp. Englisch.