Theoretical Aspects of Computing – ICTAC 2007: 4th International Colloquium, Macau, China, September 26-28, 2007. Proceedings

Free Download

Authors:

Edition: 1

Series: Lecture Notes in Computer Science 4711

ISBN: 3540752900, 9783540752905

Size: 4 MB (4500406 bytes)

Pages: 486/490

File format:

Language:

Publishing Year:

Category: Tags: , , , , , , ,

Dines Bjørner (auth.), Cliff B. Jones, Zhiming Liu, Jim Woodcock (eds.)3540752900, 9783540752905

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.


Table of contents :
Front Matter….Pages –
Domain Theory: Practice and Theories A Discussion of Possible Research Topics….Pages 1-17
Linking Semantic Models….Pages 18-33
Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems….Pages 34-49
Mobile Ambients with Timers and Types….Pages 50-63
Automatic Refinement of Split Binary Semaphore….Pages 64-78
Stepwise Development of Simulink Models Using the Refinement Calculus Framework….Pages 79-93
Bisimulations for a Distributed Higher Order π -Calculus….Pages 94-108
A Complete and Compact Propositional Deontic Logic….Pages 109-123
Verifying Lock-Freedom Using Well-Founded Orders….Pages 124-138
Tree Components Programming: An Application to XML….Pages 139-153
A Framework for Incorporating Trust into Formal Systems Development….Pages 154-168
A Higher-Order Demand-Driven Narrowing Calculus with Definitional Trees….Pages 169-184
Distributed Time-Asynchronous Automata….Pages 185-200
Skolem Machines and Geometric Logic….Pages 201-215
A Logical Calculus for Modelling Interferences….Pages 216-230
Reflection and Preservation of Properties in Coalgebraic (bi)Simulations….Pages 231-245
Controlling Process Modularity in Mobile Computing….Pages 246-259
Failures: Their Definition, Modelling and Analysis….Pages 260-274
C WS: A Timed Service-Oriented Calculus….Pages 275-290
Regular Linear Temporal Logic….Pages 291-305
Algebraic Semantics for Compensable Transactions….Pages 306-321
Axiomatizing Extended Temporal Logic Fragments Via Instantiation….Pages 322-336
Deciding Weak Bisimilarity of Normed Context-Free Processes Using Tableau….Pages 337-350
Linear Context Free Languages….Pages 351-365
FM for FMS: Lessons Learned While Applying Formal Methods to the Study of Flexible Manufacturing Systems….Pages 366-380
On Equality Predicates in Algebraic Specification Languages….Pages 381-395
Data-Distributions in PowerList Theory….Pages 396-409
Quasi-interpretation Synthesis by Decomposition….Pages 410-424
Composing Transformations to Optimize Linear Code….Pages 425-439
Building Extended Canonizers by Graph-Based Deduction….Pages 440-454
A Randomized Algorithm for BBCSPs in the Prover-Verifier Model….Pages 455-466
On the Expressive Power of QLTL….Pages 467-481
Back Matter….Pages –

Reviews

There are no reviews yet.

Be the first to review “Theoretical Aspects of Computing – ICTAC 2007: 4th International Colloquium, Macau, China, September 26-28, 2007. Proceedings”
Shopping Cart
Scroll to Top