04035nam 22005775 450 99646621200331620230221222250.01-280-38817-X97866135660963-642-14808-510.1007/978-3-642-14808-8(CKB)2670000000036356(SSID)ssj0000446827(PQKBManifestationID)11318386(PQKBTitleCode)TC0000446827(PQKBWorkID)10504736(PQKB)11377995(DE-He213)978-3-642-14808-8(MiAaPQ)EBC3065694(PPN)149018436(EXLCZ)99267000000003635620100821d2010 u| 0engurnn|008mamaatxtccrTheoretical 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 Woodcock1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XIII, 397 p. 60 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6255Bibliographic Level Mode of Issuance: Monograph3-642-14807-7 Includes bibliographical references and index.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 and Code Reentrancy.Theoretical Computer Science and General Issues,2512-2029 ;6255Computer scienceTheory of ComputationComputer science.Theory of Computation.003./54Cavalcanti Anaedthttp://id.loc.gov/vocabulary/relators/edtDeharbe Davidedthttp://id.loc.gov/vocabulary/relators/edtGaudel Marie-Claudeedthttp://id.loc.gov/vocabulary/relators/edtWoodcock Jimedthttp://id.loc.gov/vocabulary/relators/edtICTAC 2010BOOK996466212003316Theoretical Aspects of Computing2595065UNISA