Theoretical Aspects of Computing – ICTAC 2010 7th International Colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010. Proceedings /
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , , , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg,
2010.
|
Σειρά: | Lecture Notes in Computer Science,
6255 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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 and Code Reentrancy.