Programming Languages and Systems [electronic resource] : 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007. Proceedings / edited by Rocco Nicola.

Contributor(s): Nicola, Rocco [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 4421Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XVIII, 542 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540713166Subject(s): Computer science | Software engineering | Data structures (Computer science) | Logic design | Computer Science | Programming Languages, Compilers, Interpreters | Programming Techniques | Software Engineering | Logics and Meanings of Programs | Data StructuresAdditional physical formats: Printed edition:: No titleDDC classification: 005.13 LOC classification: QA76.7-76.73QA76.76.C65Online resources: Click here to access online
Contents:
Invited Talk -- Techniques for Contextual Equivalence in Higher-Order, Typed Languages -- Models and Languages for Web Services -- Structured Communication-Centred Programming for Web Services -- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements -- A Calculus for Orchestration of Web Services -- A Concurrent Calculus with Atomic Transactions -- Verification -- Modal I/O Automata for Interface and Product Line Theories -- Using History Invariants to Verify Observers -- Term Rewriting -- On the Implementation of Construction Functions for Non-free Concrete Data Types -- Anti-pattern Matching -- Language Based Security -- A Certified Lightweight Non-interference Java Bytecode Verifier -- Controlling the What and Where of Declassification in Language-Based Security -- Cost Analysis of Java Bytecode -- Logics and Correctness Proofs -- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning -- Abstract Predicates and Mutable ADTs in Hoare Type Theory -- Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic -- Static Analysis and Abstract Interpretation I -- Modular Shape Analysis for Dynamically Encapsulated Programs -- Static Analysis by Policy Iteration on Relational Domains -- Computing Procedure Summaries for Interprocedural Analysis -- Small Witnesses for Abstract Interpretation-Based Proofs -- Static Analysis and Abstract Interpretation II -- Interprocedurally Analysing Linear Inequality Relations -- Precise Fixpoint Computation Through Strategy Iteration -- Semantic Theories for Object Oriented Languages -- A Complete Guide to the Future -- The Java Memory Model: Operationally, Denotationally, Axiomatically -- Immutable Objects for a Java-Like Language -- Process Algebraic Techniques -- Scalar Outcomes Suffice for Finitary Probabilistic Testing -- Probabilistic Anonymity Via Coalgebraic Simulations -- A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) -- A Core Calculus for a Comparative Analysis of Bio-inspired Calculi -- Applicative Programming -- A Rewriting Semantics for Type Inference -- Principal Type Schemes for Modular Programs -- A Consistent Semantics of Self-adjusting Computation -- Multi-language Synchronization -- Types for Systems Properties -- Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts -- Type Reconstruction for General Refinement Types -- Dependent Types for Low-Level Programming.
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 EBK7518

Invited Talk -- Techniques for Contextual Equivalence in Higher-Order, Typed Languages -- Models and Languages for Web Services -- Structured Communication-Centred Programming for Web Services -- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements -- A Calculus for Orchestration of Web Services -- A Concurrent Calculus with Atomic Transactions -- Verification -- Modal I/O Automata for Interface and Product Line Theories -- Using History Invariants to Verify Observers -- Term Rewriting -- On the Implementation of Construction Functions for Non-free Concrete Data Types -- Anti-pattern Matching -- Language Based Security -- A Certified Lightweight Non-interference Java Bytecode Verifier -- Controlling the What and Where of Declassification in Language-Based Security -- Cost Analysis of Java Bytecode -- Logics and Correctness Proofs -- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning -- Abstract Predicates and Mutable ADTs in Hoare Type Theory -- Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic -- Static Analysis and Abstract Interpretation I -- Modular Shape Analysis for Dynamically Encapsulated Programs -- Static Analysis by Policy Iteration on Relational Domains -- Computing Procedure Summaries for Interprocedural Analysis -- Small Witnesses for Abstract Interpretation-Based Proofs -- Static Analysis and Abstract Interpretation II -- Interprocedurally Analysing Linear Inequality Relations -- Precise Fixpoint Computation Through Strategy Iteration -- Semantic Theories for Object Oriented Languages -- A Complete Guide to the Future -- The Java Memory Model: Operationally, Denotationally, Axiomatically -- Immutable Objects for a Java-Like Language -- Process Algebraic Techniques -- Scalar Outcomes Suffice for Finitary Probabilistic Testing -- Probabilistic Anonymity Via Coalgebraic Simulations -- A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) -- A Core Calculus for a Comparative Analysis of Bio-inspired Calculi -- Applicative Programming -- A Rewriting Semantics for Type Inference -- Principal Type Schemes for Modular Programs -- A Consistent Semantics of Self-adjusting Computation -- Multi-language Synchronization -- Types for Systems Properties -- Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts -- Type Reconstruction for General Refinement Types -- Dependent Types for Low-Level Programming.

There are no comments on this title.

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

Powered by Koha