Central Library

Normal view MARC view ISBD view

Theoretical Aspects of Computing [electronic resource] : 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010, Proceedings / edited by Ana Cavalcanti, David Deharbe, Marie-Claude Gaudel, Jim Woodcock.

Contributor(s): Cavalcanti, Ana [editor.] | Deharbe, David [editor.] | Gaudel, Marie-Claude [editor.] | Woodcock, Jim [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 6255Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2010Edition: 1st ed. 2010.Description: XIII, 397 p. 60 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642148088.Subject(s): Computer science | Theory of ComputationAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
Contents:
Invited Papers and Abstract -- Invariants and Well-Foundedness in Program Algebra -- A Theory of Software Product Line Refinement -- The TLA?+? Proof System: Building a Heterogeneous Verification Platform -- Grammars -- Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules -- Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution -- Tracking Down the Origins of Ambiguity in Context-Free Grammars -- Semantics -- Prioritized slotted-Circus -- A Denotational Semantical Model for Orc Language -- An Extended cCSP with Stable Failures Semantics -- Preference and Non-deterministic Choice -- Modelling -- Material Flow Abstraction of Manufacturing Systems -- Specification and Verification of a MPI Implementation for a MP-SoC -- Special Track: Formal Aspects of Software Testing and Grand Challenge in Verified Software -- Testing of Abstract Components -- Scalable Distributed Concolic Testing: A Case Study on a Flash Storage Platform -- Analyzing a Formal Specification of Mondex Using Model Checking -- Formal Modelling of Separation Kernel Components -- Mechanized Verification with Sharing -- Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking -- Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software Requirements -- Logics -- Complete Calculi for Structured Specifications in Fork Algebra -- Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical Setting -- Characterizing Locality (Encapsulation) with Bisimulation -- Justification Logic and History Based Computation -- Algorithms and Types -- A Class of Greedy Algorithms and Its Relation to Greedoids -- On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types -- A Modality for Safe Resource Sharing andCode Reentrancy.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

Invited Papers and Abstract -- Invariants and Well-Foundedness in Program Algebra -- A Theory of Software Product Line Refinement -- The TLA?+? Proof System: Building a Heterogeneous Verification Platform -- Grammars -- Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules -- Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution -- Tracking Down the Origins of Ambiguity in Context-Free Grammars -- Semantics -- Prioritized slotted-Circus -- A Denotational Semantical Model for Orc Language -- An Extended cCSP with Stable Failures Semantics -- Preference and Non-deterministic Choice -- Modelling -- Material Flow Abstraction of Manufacturing Systems -- Specification and Verification of a MPI Implementation for a MP-SoC -- Special Track: Formal Aspects of Software Testing and Grand Challenge in Verified Software -- Testing of Abstract Components -- Scalable Distributed Concolic Testing: A Case Study on a Flash Storage Platform -- Analyzing a Formal Specification of Mondex Using Model Checking -- Formal Modelling of Separation Kernel Components -- Mechanized Verification with Sharing -- Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking -- Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software Requirements -- Logics -- Complete Calculi for Structured Specifications in Fork Algebra -- Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical Setting -- Characterizing Locality (Encapsulation) with Bisimulation -- Justification Logic and History Based Computation -- Algorithms and Types -- A Class of Greedy Algorithms and Its Relation to Greedoids -- On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types -- A Modality for Safe Resource Sharing andCode Reentrancy.

There are no comments for this item.

Log in to your account to post a comment.