Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Theoretical aspects of computing : ICTAC 2009 : 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009 : proceedings / / Martin Leucker, Carroll Morgan (eds.)
| Theoretical aspects of computing : ICTAC 2009 : 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009 : proceedings / / Martin Leucker, Carroll Morgan (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XII, 357 p.) |
| Disciplina | 004n/a |
| Altri autori (Persone) |
LeuckerMartin
MorganCarroll |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Electronic data processing
Information theory |
| ISBN |
1-280-38320-8
9786613561121 3-642-03466-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Static Analysis of Concurrent Programs Using Ordinary Differential Equations -- The PlusCal Algorithm Language -- The Secret Art of Computer Programming -- Verification, Testing and Statistics -- Full Research Papers -- ?-Types for Effects and Freshness Analysis -- A First-Order Policy Language for History-Based Transaction Monitoring -- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete -- Transmission Protocols for Instruction Streams -- A Deadlock-Free Semantics for Shared Memory Concurrency -- On the Expressiveness of Forwarding in Higher-Order Communication -- On the Hairpin Completion of Regular Languages -- Context-Free Languages of Countable Words -- Automatic Conflict Detection on Contracts -- A Sound Observational Semantics for Modal Transition Systems -- Regular Expressions with Numerical Constraints and Automata with Counters -- On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations -- Integration Testing from Structured First-Order Specifications via Deduction Modulo -- A Minimized Assumption Generation Method for Component-Based Software Verification -- A Formal Approach to Heuristically Test Restorable Systems -- Constrained Reachability of Process Rewrite Systems -- Input-Output Model Programs -- Tool Papers -- IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata -- GSPeeDI – A Verification Tool for Generalized Polygonal Hybrid Systems -- Hierarchical Graph Rewriting as a Unifying Tool for Analyzing and Understanding Nondeterministic Systems. |
| Altri titoli varianti |
ICTAC 2009
International Colloquium on Theoretical Aspects of Computing 6th International Colloquium on Theoretical Aspects of Computing |
| Record Nr. | UNINA-9910484157503321 |
| Berlin, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical aspects of computing--ICTAC 2010 : 7th international colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010 : proceedings / / Ana Cavalcanti ... [et al.] (eds.)
| Theoretical aspects of computing--ICTAC 2010 : 7th international colloquium, Natal, Rio Grande do Norte, Brazil, September 1-3, 2010 : proceedings / / Ana Cavalcanti ... [et al.] (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XIII, 397 p. 60 illus.) |
| Disciplina | 003./54 |
| Altri autori (Persone) | CavalcantiAna |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Formal methods (Computer science)
Computer science - Mathematics Computer programming Electronic data processing Information theory |
| ISBN |
1-280-38817-X
9786613566096 3-642-14808-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Altri titoli varianti |
ICTAC 2010
International Colloquium on Theoretical Aspects of Computing 7th International Colloquium on Theoretical Aspects of Computing |
| Record Nr. | UNINA-9910484926703321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||