Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Theoretical Aspects of Computing - ICTAC 2007 -

Theoretical Aspects of Computing - ICTAC 2007

4th International Colloquium, Macau, China, September 26-28, 2007, Proceedings
Buch | Softcover
XI, 486 Seiten
2007 | 2007
Springer Berlin (Verlag)
978-3-540-75290-5 (ISBN)
CHF 74,85 inkl. MwSt

This book constitutes the refereed proceedings of the 4th International Colloquium on Theoretical Aspects of Computing, ICTAC 2007 held in Macau, China in September 2007.

The 29 revised full papers presented together with 3 invited talks and summaries of 2 tutorials were carefully reviewed and selected from 69 submissions. The aim of the colloquium is to bring together practitioners and researchers from academia, industry and government to present research results, and exchange experience, ideas, and solutions for their problems in theoretical aspects of computing such as automata theory and formal languages, principles and semantics of programming languages, software architectures and their description languages, software specification, refinement, and verification, model checking and theorem proving, real-time, embedded and hybrid systems, theory of parallel, distributed, and internet-based (grid) computing, simulation and modeling, and service-oriented development.

Domain Theory: Practice and Theories A Discussion of Possible Research Topics.- Linking Semantic Models.- Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems.- Mobile Ambients with Timers and Types.- Automatic Refinement of Split Binary Semaphore.- Stepwise Development of Simulink Models Using the Refinement Calculus Framework.- Bisimulations for a Distributed Higher Order ?-Calculus.- A Complete and Compact Propositional Deontic Logic.- Verifying Lock-Freedom Using Well-Founded Orders.- Tree Components Programming: An Application to XML.- A Framework for Incorporating Trust into Formal Systems Development.- A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees.- Distributed Time-Asynchronous Automata.- Skolem Machines and Geometric Logic.- A Logical Calculus for Modelling Interferences.- Reflection and Preservation of Properties in Coalgebraic (bi)Simulations.- Controlling Process Modularity in Mobile Computing.- Failures: Their Definition, Modelling and Analysis.- C WS: A Timed Service-Oriented Calculus.- Regular Linear Temporal Logic.- Algebraic Semantics for Compensable Transactions.- Axiomatizing Extended Temporal Logic Fragments Via Instantiation.- Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau.- Linear Context Free Languages.- FM for FMS: Lessons Learned While Applying Formal Methods to the Study of Flexible Manufacturing Systems.- On Equality Predicates in Algebraic Specification Languages.- Data-Distributions in PowerList Theory.- Quasi-interpretation Synthesis by Decomposition.- Composing Transformations to Optimize Linear Code.- Building Extended Canonizers by Graph-Based Deduction.- A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.- On the Expressive Power of QLTL.

Erscheint lt. Verlag 12.9.2007
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo XI, 486 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 749 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Compilerbau
Schlagworte Automat • Automata • Automata Theory • Component Systems • Computer Algebra • Concurrent Systems • Cooperative Systems • Distributed Computing • fault tolerance • finite -state models • formal language • Formal Languages • formal methods • Formal Verification • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Logical Foundations • Mobility • Model Checking • Modeling • probabilistic methods • Process Algebra • programming • Programming language • Programming Theory • real-time • Real-Time Systems • Semantics • Software Security • Systems Design • systems modeling • Temporal Logics • Term Rewriting • Testing • theorem proving • theoretical computer science • verification
ISBN-10 3-540-75290-0 / 3540752900
ISBN-13 978-3-540-75290-5 / 9783540752905
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen und Anwendungen

von Hanspeter Mössenböck

Buch | Softcover (2024)
dpunkt (Verlag)
CHF 41,85
a beginner's guide to learning llvm compiler tools and core …

von Kai Nacke

Buch | Softcover (2024)
Packt Publishing Limited (Verlag)
CHF 69,80