Mathematics of Program Construction [electronic resource] : 10th International Conference, MPC 2010, Québec City, Canada, June 21-23, 2010. Proceedings / edited by Claude Bolduc, Jules Desharnais, Béchir Ktari.

Contributor(s): Bolduc, Claude [editor.] | Desharnais, Jules [editor.] | Ktari, Béchir [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 6120Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: X, 427p. 57 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642133213Subject(s): Computer science | Monoclonal antibodies | Software engineering | Logic design | Artificial intelligence | Computer Science | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Software Engineering | Programming Languages, Compilers, Interpreters | Antibodies | Artificial Intelligence (incl. Robotics)Additional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access online
Contents:
Invited Talks -- The Algorithmics of Solitaire-Like Games -- Compositionality of Secure Information Flow -- Process Algebras for Collective Dynamics -- Contributed Talks -- On Automated Program Construction and Verification -- The Logic of Large Enough -- Dependently Typed Grammars -- Abstraction of Object Graphs in Program Verification -- Subtyping, Declaratively -- Compositional Action System Derivation Using Enforced Properties -- Designing an Algorithmic Proof of the Two-Squares Theorem -- Partial, Total and General Correctness -- Unifying Theories of Programming That Distinguish Nontermination and Abort -- Adjoint Folds and Unfolds -- An Abstract Machine for the Old Value Retrieval -- A Tracking Semantics for CSP -- Matrices as Arrows! -- Lucy-n: a n-Synchronous Extension of Lustre -- Sampling, Splitting and Merging in Coinductive Stream Calculus -- Generic Point-free Lenses -- Formal Derivation of Concurrent Garbage Collectors -- Temporal Logic Verification of Lock-Freedom -- Gradual Refinement.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK9054

Invited Talks -- The Algorithmics of Solitaire-Like Games -- Compositionality of Secure Information Flow -- Process Algebras for Collective Dynamics -- Contributed Talks -- On Automated Program Construction and Verification -- The Logic of Large Enough -- Dependently Typed Grammars -- Abstraction of Object Graphs in Program Verification -- Subtyping, Declaratively -- Compositional Action System Derivation Using Enforced Properties -- Designing an Algorithmic Proof of the Two-Squares Theorem -- Partial, Total and General Correctness -- Unifying Theories of Programming That Distinguish Nontermination and Abort -- Adjoint Folds and Unfolds -- An Abstract Machine for the Old Value Retrieval -- A Tracking Semantics for CSP -- Matrices as Arrows! -- Lucy-n: a n-Synchronous Extension of Lustre -- Sampling, Splitting and Merging in Coinductive Stream Calculus -- Generic Point-free Lenses -- Formal Derivation of Concurrent Garbage Collectors -- Temporal Logic Verification of Lock-Freedom -- Gradual Refinement.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha