|
|
|
|
LEADER |
03714nam a22005055i 4500 |
001 |
978-3-642-14808-8 |
003 |
DE-He213 |
005 |
20151204181837.0 |
007 |
cr nn 008mamaa |
008 |
100821s2010 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642148088
|9 978-3-642-14808-8
|
024 |
7 |
|
|a 10.1007/978-3-642-14808-8
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Theoretical Aspects of Computing – ICTAC 2010
|h [electronic resource] :
|b 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010. Proceedings /
|c edited by Ana Cavalcanti, David Deharbe, Marie-Claude Gaudel, Jim Woodcock.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
300 |
|
|
|a XIII, 397 p. 60 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6255
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
700 |
1 |
|
|a Cavalcanti, Ana.
|e editor.
|
700 |
1 |
|
|a Deharbe, David.
|e editor.
|
700 |
1 |
|
|a Gaudel, Marie-Claude.
|e editor.
|
700 |
1 |
|
|a Woodcock, Jim.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642148071
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6255
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-14808-8
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|