Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Theoretical Aspects of Computing - ICTAC 2008

5th International Colloquium, Istanbul, Turkey, September 1-3, 2008, Proceedings
BuchKartoniert, Paperback
455 Seiten
Englisch
Springererschienen am18.08.2008
Research on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. 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).mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49

Produkt

KlappentextResearch on theoretical aspects of computing has a direct impact on the pr- tice of computer systems development. 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).
Details
ISBN/GTIN978-3-540-85761-7
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2008
Erscheinungsdatum18.08.2008
ReiheLecture Notes in Computer Science
Seiten455 Seiten
SpracheEnglisch
Gewicht708 g
IllustrationenXI, 455 p.
Artikel-Nr.10951072

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Schlagworte

Autor