Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
  • 1
    UID:
    b3kat_BV036032882
    Umfang: 1 Online-Ressource (VI, 406 S. , graph. Darst.)
    ISBN: 3540114947 , 0387114947
    Serie: Lecture notes in computer science 137
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Programmierung ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    UID:
    almahu_BV000031893
    Umfang: VI, 406 S. : graph. Darst.
    ISBN: 3-540-11494-7 , 0-387-11494-7
    Serie: Lecture notes in computer science 137
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    Schlagwort(e): Programmierung ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    UID:
    gbv_595131832
    Umfang: Online-Ressource (VI, 406 S.)
    Ausgabe: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540391845
    Serie: Lecture notes in computer science 137
    Inhalt: Applicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm.
    Anmerkung: Literaturangaben
    Weitere Ausg.: ISBN 3540114947
    Weitere Ausg.: ISBN 0387114947
    Weitere Ausg.: ISBN 9783540114949
    Weitere Ausg.: Erscheint auch als Druck-Ausgabe International Symposium on Programming (5 : 1982 : Turin) International Symposium on Programming Berlin [u.a.] : Springer, 1982 ISBN 3540114947
    Weitere Ausg.: ISBN 0387114947
    Sprache: Englisch
    Schlagwort(e): Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    almafu_9959186244402883
    Umfang: 1 online resource (VIII, 416 p.)
    Ausgabe: 1st ed. 1982.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39184-3
    Serie: Lecture Notes in Computer Science, 137
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Applicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-11494-7
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    UID:
    almahu_9947920879402882
    Umfang: VIII, 416 p. , online resource.
    ISBN: 9783540391845
    Serie: Lecture Notes in Computer Science, 137
    Anmerkung: Applicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm.
    In: Springer eBooks
    Weitere Ausg.: Printed edition: ISBN 9783540114949
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    UID:
    almahu_9948621223102882
    Umfang: VIII, 416 p. , online resource.
    Ausgabe: 1st ed. 1982.
    ISBN: 9783540391845
    Serie: Lecture Notes in Computer Science, 137
    Anmerkung: Applicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm.
    In: Springer Nature eBook
    Weitere Ausg.: Printed edition: ISBN 9783662207109
    Weitere Ausg.: Printed edition: ISBN 9783540114949
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg : Springer Berlin Heidelberg
    UID:
    gbv_1649200048
    Umfang: Online-Ressource
    ISBN: 9783540391845
    Serie: Lecture Notes in Computer Science 137
    Weitere Ausg.: ISBN 9783540114949
    Weitere Ausg.: Buchausg. u.d.T. Turin, April 6 - 9, 1982 1982 ISBN 3540114947
    Weitere Ausg.: ISBN 0387114947
    Sprache: Englisch
    Fachgebiete: Informatik
    RVK:
    URL: Cover
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edoccha_9959186244402883
    Umfang: 1 online resource (VIII, 416 p.)
    Ausgabe: 1st ed. 1982.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39184-3
    Serie: Lecture Notes in Computer Science, 137
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Applicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-11494-7
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Online-Ressource
    Online-Ressource
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    UID:
    edocfu_9959186244402883
    Umfang: 1 online resource (VIII, 416 p.)
    Ausgabe: 1st ed. 1982.
    Ausgabe: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-39184-3
    Serie: Lecture Notes in Computer Science, 137
    Anmerkung: Bibliographic Level Mode of Issuance: Monograph , Applicative communicating processes in first order logic -- A machine-level semantics for nondeterministic, parallel programs -- A formalized proof system for total correctness of while programs -- Automatic program transformation viewed as theorem proving -- An enlarged definition and complete axiomatization of observational congruence of finite processes -- Perluette : A compilers producing system using abstract data types -- A weakest precondition semantics for communicating processes -- From abstract model to efficient compilation of patterns -- Computer-based synthesis of logic programs -- On some syntactic equivalences of program schemas and related transformations -- Procedures and concurrency: A study in proof -- Another characterization of weakest preconditions -- Powerdomains and nondeterministic recursive definitions -- Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code -- The simple semantics for Coppo-Dezani-Sallé types -- Proving the correctness of implementations of shared data abstractions -- Specification of communicating processes and process implementation correctness -- A system for reasoning within and about algebraic specifications -- Tuning algebraic specifications by type merging -- Communicating agents for applicative concurrent programming -- On effective computations of non-deterministic schemes -- Specification and verification of concurrent systems in CESAR -- Proof of separability A verification technique for a class of security kernels -- A method for program synthesis -- The use of transformations to implement an algorithm. , English
    In: Springer eBooks
    Weitere Ausg.: ISBN 3-540-11494-7
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Meinten Sie 9783540114994?
Meinten Sie 9783540119449?
Meinten Sie 9783540114499?
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie auf den KOBV Seiten zum Datenschutz