|
|
|
|
LEADER |
04957nam a22006015i 4500 |
001 |
978-3-540-75292-9 |
003 |
DE-He213 |
005 |
20151204175251.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540752929
|9 978-3-540-75292-9
|
024 |
7 |
|
|a 10.1007/978-3-540-75292-9
|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 2007
|h [electronic resource] :
|b 4th International Colloquium, Macau, China, September 26-28, 2007. Proceedings /
|c edited by Cliff B. Jones, Zhiming Liu, Jim Woodcock.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
300 |
|
|
|a XI, 486 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 4711
|
505 |
0 |
|
|a Domain Theory: Practice and Theories A Discussion of Possible Research Topics -- Linking Semantic Models -- Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems -- Mobile Ambients with Timers and Types -- Automatic Refinement of Split Binary Semaphore -- Stepwise Development of Simulink Models Using the Refinement Calculus Framework -- Bisimulations for a Distributed Higher Order ?-Calculus -- A Complete and Compact Propositional Deontic Logic -- Verifying Lock-Freedom Using Well-Founded Orders -- Tree Components Programming: An Application to XML -- A Framework for Incorporating Trust into Formal Systems Development -- A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees -- Distributed Time-Asynchronous Automata -- Skolem Machines and Geometric Logic -- A Logical Calculus for Modelling Interferences -- Reflection and Preservation of Properties in Coalgebraic (bi)Simulations -- Controlling Process Modularity in Mobile Computing -- Failures: Their Definition, Modelling and Analysis -- C WS: A Timed Service-Oriented Calculus -- Regular Linear Temporal Logic -- Algebraic Semantics for Compensable Transactions -- Axiomatizing Extended Temporal Logic Fragments Via Instantiation -- Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau -- Linear Context Free Languages -- FM for FMS: Lessons Learned While Applying Formal Methods to the Study of Flexible Manufacturing Systems -- On Equality Predicates in Algebraic Specification Languages -- Data-Distributions in PowerList Theory -- Quasi-interpretation Synthesis by Decomposition -- Composing Transformations to Optimize Linear Code -- Building Extended Canonizers by Graph-Based Deduction -- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model -- On the Expressive Power of QLTL.
|
520 |
|
|
|a This book constitutes the refereed proceedings of the 4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007 held in Macau, China in September 2007. The 29 revised full papers presented together with 3 invited talks and summaries of 2 tutorials were carefully reviewed and selected from 69 submissions. The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing such as automata theory and formal languages, principles and semantics of programming languages, software architectures and their description languages, software specification, refinement, and verification, model checking and theorem proving, real-time, embedded and hybrid systems, theory of parallel, distributed, and internet-based (grid) computing, simulation and modeling, and service-oriented development.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Computation by Abstract Devices.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Software Engineering.
|
700 |
1 |
|
|a Jones, Cliff B.
|e editor.
|
700 |
1 |
|
|a Liu, Zhiming.
|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 9783540752905
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4711
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-75292-9
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|