Theoretical Aspects of Computing - ICTAC 2008 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Fitzgerald, John S. (Επιμελητής έκδοσης), Haxthausen, Anne E. (Επιμελητής έκδοσης), Yenigun, Husnu (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5160
• Θέματα: Computer science.; Software engineering.; Computer programming.; Computers.; Algorithms.; Computer Science.; Programming Techniques.; Software Engineering/Programming and Operating Systems.; Theory of Computation.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.; Software Engineering.

 This book constitutes the refereed proceedings of the 5th International Colloquium on Theoretical Aspects of Computing, ICTAC 2008 held in Istanbul, Turkey in September 2008. The 27 revised full papers were carefully reviewed and selected from over 70 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. 

 Using Design Patterns in Formal Methods: An Event-B Approach -- A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules -- The Three Platonic Models of Divergence-Strict CSP -- Monotonic Abstraction in Action -- Non-interleaving Semantics with Causality for Nondeterministic Dataflow -- Symbolic Reachability for Process Algebras with Recursive Data Types -- Inclusion Test Algorithms for One-Unambiguous Regular Expressions -- Refinement of Kripke Models for Dynamics -- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers -- A Theory of Pointers for the UTP -- Recasting Constraint Automata into Büchi Automata -- A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables -- Towards Efficient Verification of Systems with Dynamic Process Creation -- An Observational Model for Transactional Calculus of Services Orchestration -- Everything Is PSPACE-Complete in Interaction Systems -- A New Approach for the Construction of Multiway Decision Graphs -- Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs -- Guided Test Generation from CSP Models -- Relaxing Goodness Is Still Good -- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time -- Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation Systems -- Testing Concurrent Objects with Application-Specific Schedulers -- A Theory of Bounded Fair Scheduling -- Fair Exchange Is Incomparable to Consensus -- Automatic Generation of CSP || B Skeletons from xUML Models -- Bounded Model Checking for Partial Kripke Structures -- Verification of Linear Duration Invariants by Model Checking CTL Properties -- Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks -- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation -- Instantiation for Parameterised Boolean Equation Systems.