Research on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. Over many decades, fundamental t- ories have emerged to describe functionality, temporal behavior and resource consumption. Theories of application domains are beginning to be exploited for modelling and analyzing intended computing systems before the expensive c- mitment is made to real programs and hardware. Recent years have seen major improvements in the cost-e?ectiveness of tools supporting the exploitation of theories through proof, model-checking and testing. Against this encouraging background, we are pleased to present papers that show something of the live- ness and diversity of research in theoretical aspects of computing today. ICTAC 2008, the 5th International Colloquium on Theoretical Aspects of Computing, was held on 1-3 September 2008 in Istanbul, Turkey, hosted by - banc? University. The ICTAC series was founded by the International Institute for SoftwareTechnologyof the United Nations University(UNU-IIST). It brings together practitioners and researchers from academia, industry and government to present results and to exchange ideas and experience addressing challenges in both theoretical aspects of computing and in the exploitation of theory through methodsandtoolsforsystemdevelopment. Theseriesalsopromotescooperation in research and education between participants and their institutions, from - veloping and industrial countries, in accordance with the mandate of the United Nations University. The previous ICTAC colloquia were held in Guiyang, China (2004, LNCS 3407), Hanoi, Vietnam (2005, LNCS 3722), Tunis, Tunisia (2006, LNCS 4281) and Macau SAR, China (2007, LNCS 4711).
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
ISBN-13
978-3-540-85762-4 (9783540857624)
DOI
10.1007/978-3-540-85762-4
Schweitzer Klassifikation
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.
