000 03978nam a22005175i 4500
001 978-3-642-14808-8
003 DE-He213
005 20240423125955.0
007 cr nn 008mamaa
008 100821s2010 gw | s |||| 0|eng d
020 _a9783642148088
_9978-3-642-14808-8
024 7 _a10.1007/978-3-642-14808-8
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheoretical Aspects of Computing
_h[electronic resource] :
_b7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010, Proceedings /
_cedited by Ana Cavalcanti, David Deharbe, Marie-Claude Gaudel, Jim Woodcock.
250 _a1st ed. 2010.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2010.
300 _aXIII, 397 p. 60 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6255
505 0 _aInvited 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.
650 0 _aComputer science.
650 1 4 _aTheory of Computation.
700 1 _aCavalcanti, Ana.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aDeharbe, David.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGaudel, Marie-Claude.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWoodcock, Jim.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642148071
776 0 8 _iPrinted edition:
_z9783642148095
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v6255
856 4 0 _uhttps://doi.org/10.1007/978-3-642-14808-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c183686
_d183686