|
|
|
|
LEADER |
04682nam a22005535i 4500 |
001 |
978-3-642-03466-4 |
003 |
DE-He213 |
005 |
20151204175258.0 |
007 |
cr nn 008mamaa |
008 |
100301s2009 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642034664
|9 978-3-642-03466-4
|
024 |
7 |
|
|a 10.1007/978-3-642-03466-4
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.6-76.66
|
072 |
|
7 |
|a UM
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
082 |
0 |
4 |
|a 005.11
|2 23
|
245 |
1 |
0 |
|a Theoretical Aspects of Computing - ICTAC 2009
|h [electronic resource] :
|b 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings /
|c edited by Martin Leucker, Carroll Morgan.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
300 |
|
|
|a XII, 357 p.
|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 5684
|
505 |
0 |
|
|a Invited Papers -- Static Analysis of Concurrent Programs Using Ordinary Differential Equations -- The PlusCal Algorithm Language -- The Secret Art of Computer Programming -- Verification, Testing and Statistics -- Full Research Papers -- ?-Types for Effects and Freshness Analysis -- A First-Order Policy Language for History-Based Transaction Monitoring -- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete -- Transmission Protocols for Instruction Streams -- A Deadlock-Free Semantics for Shared Memory Concurrency -- On the Expressiveness of Forwarding in Higher-Order Communication -- On the Hairpin Completion of Regular Languages -- Context-Free Languages of Countable Words -- Automatic Conflict Detection on Contracts -- A Sound Observational Semantics for Modal Transition Systems -- Regular Expressions with Numerical Constraints and Automata with Counters -- On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations -- Integration Testing from Structured First-Order Specifications via Deduction Modulo -- A Minimized Assumption Generation Method for Component-Based Software Verification -- A Formal Approach to Heuristically Test Restorable Systems -- Constrained Reachability of Process Rewrite Systems -- Input-Output Model Programs -- Tool Papers -- IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata -- GSPeeDI – A Verification Tool for Generalized Polygonal Hybrid Systems -- Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems.
|
520 |
|
|
|a This book constitutes the refereed proceedings of the 6th International Colloquium on Theoretical Aspects of Computing, ICTAC 2009 held in Kuala Lumpur, Malaysia, in August 2009. The 17 revised full papers and 3 revised papers presented with 4 invited lectures were carefully reviewed and selected from 81 submissions. The papers address all theoretical aspects and methodological issues of computing, such as software specification, refinement, verification and testing, model checking and theorem proving, software architectures, coordination and feature interaction, integration of theories, formal and engineering methods and tools, models of concurrency, security, and mobility, parallel, distributed, and internet-based (grid) computing, real-time, embedded and hybrid systems, automata theory and formal languages, principles and semantics of languages, logics and their applications, type and category theory in computer science, case studies, theories, tools and experiments of verified systems, service-oriented architectures, as well as domain modelling and domain-specific technology.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Software Engineering.
|
700 |
1 |
|
|a Leucker, Martin.
|e editor.
|
700 |
1 |
|
|a Morgan, Carroll.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642034657
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 5684
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-03466-4
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|