Cavalcanti / Deharbe / Gaudel | Theoretical Aspects of Computing | Buch | 978-3-642-14807-1 | sack.de

Buch, Englisch, 397 Seiten, Gewicht: 621 g

Reihe: Theoretical Computer Science and General Issues

Cavalcanti / Deharbe / Gaudel

Theoretical Aspects of Computing

7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010, Proceedings
1. Auflage 2010
ISBN: 978-3-642-14807-1
Verlag: Springer

7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010, Proceedings

Buch, Englisch, 397 Seiten, Gewicht: 621 g

Reihe: Theoretical Computer Science and General Issues

ISBN: 978-3-642-14807-1
Verlag: Springer


The now well-established series of International Colloquia on Theoretical - pects of Computing (ICTAC) brings together practitionersand researchersfrom academia, industry and government to present research results, and exchange experience and ideas. Beyond these scholarly goals, another main purpose is to promote cooperation in research and education between participants and their institutions, from developing and industrial countries. ThisvolumecontainsthepaperspresentedatICTAC2010.Itwasheldduring September 1–3 in the city of Natal, Rio Grande do Norte, Brazil. Therewere68submissionsbyauthorsfrom24countriesallaroundthe world. Each submission was reviewed by at least three, and on average four, Program Committee members and external reviewers. After extensive discussions, they decided to accept the 23 (regular) papers presented here. Authors of a selection of these papers were invited to submit an extended version of their work to a special issue of the Theoretical Computer Science journal. Seven of the papers were part of a special track including one paper on “F- mal Aspects of Software Testing”, and six on the “Grand Challenge in Veri?ed Software.”ThespecialtrackwasjointlyorganizedbyMarie-ClaudeGaudel,from the Universit´ e de Paris-Sud, and Jim Woodcock, from the University of York.

Cavalcanti / Deharbe / Gaudel Theoretical Aspects of Computing jetzt bestellen!

Zielgruppe


Professional/practitioner

Weitere Infos & Material


Invited Papers and Abstract.- Invariants and Well-Foundedness in Program Algebra.- A Theory of Software Product Line Refinement.- The TLA?+? Proof System: Building a Heterogeneous Verification Platform.- Grammars.- Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules.- Minimal Tree Language Extensions: A Keystone of XML Type Compatibility and Evolution.- Tracking Down the Origins of Ambiguity in Context-Free Grammars.- Semantics.- Prioritized slotted-Circus.- A Denotational Semantical Model for Orc Language.- An Extended cCSP with Stable Failures Semantics.- Preference and Non-deterministic Choice.- Modelling.- Material Flow Abstraction of Manufacturing Systems.- Specification and Verification of a MPI Implementation for a MP-SoC.- Special Track: Formal Aspects of Software Testing and Grand Challenge in Verified Software.- Testing of Abstract Components.- Scalable Distributed Concolic Testing: A Case Study on a Flash Storage Platform.- Analyzing a Formal Specification of Mondex Using Model Checking.- Formal Modelling of Separation Kernel Components.- Mechanized Verification with Sharing.- Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking.- Dynamite 2.0: New Features Based on UnSAT-Core Extraction to Improve Verification of Software Requirements.- Logics.- Complete Calculi for Structured Specifications in Fork Algebra.- Towards Managing Dynamic Reconfiguration of Software Systems in a Categorical Setting.- Characterizing Locality (Encapsulation) with Bisimulation.- Justification Logic and History Based Computation.- Algorithms and Types.- A Class of Greedy Algorithms and Its Relation to Greedoids.- On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types.- A Modality for Safe Resource Sharing andCode Reentrancy.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.