Formal Methods for Components and Objects: Third by Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf,

By Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, Willem-Paul de Roever

Formal tools were utilized effectively to the verification of medium-sized courses in protocol and layout. even though, their program to the advance of huge structures calls for extra emphasis on specification, modelling and validation innovations helping the options of reusability and modifiability, and their implementation in new extensions of latest programming languages. This publication provides revised instructional lectures given by way of invited audio system on the 3rd overseas Symposium on Formal equipment for parts and items, FMCO 2004, held in Leiden, The Netherlands, in November 2004. The 14 revised lectures via best researchers current a entire account of the opportunity of formal equipment utilized to massive and complicated software program structures akin to component-based platforms and item structures. The publication presents an precise mixture of principles on software program engineering and formal equipment that replicate the increasing physique of data on smooth software program systems.

Table of Contents


Formal tools for elements and gadgets, 3rd International
Symposium, FMCO 2004, Leiden, The Netherlands, November 2 - five, 2004,
Revised Lectures

ISBN-10 3540291318 ISBN-13 9783540291312



The Mobi-J Project
The Omega Project
Sponsoring Institutions

Table of Contents

A idea of Predicate-Complete try assurance and Generation

1 Introduction
2 A Characterization of Predicate-Complete attempt Coverage
three Formalizing Abstraction
3.1 Concrete Transition Systems
3.2 summary Transition Systems
3.3 Predicate Abstraction
3.4 Predicate Abstraction of Programs
3.5 Example
four Defining the higher and decrease Bounds
4.1 top certain Computation
4.2 reduce certain Computation L
five Example
6 try Generation
6.1 course Generation
6.3 become aware of try out Runs
6.4 Abstraction Re.nement
7 Discussion
eight similar Work
8.1 Control-Flow assurance Criteria
8.2 Symbolic Execution and attempt Generation
8.3 Three-Valued version Checking
nine Conclusion

A point of view on part Refnement

1 Introduction
2 Coalgebraic types for software program Components
2.1 Coalgebras
2.2 Components
2.3 an element Calculus
three Behavioural Refinemet
3.1 Component's Behaviour and Bisimulation
3.2 Refinement
four facts Refinement
4.1 nation Refinement
4.2 form Refinement
five Conclusions and extra Work

A totally summary Semantics for UML Components

1 Introduction
1.1 Contribution of This Paper
1.2 comparable Work
2 UML sessions, State-Machines and Components
2.1 summary State-Machines
2.2 Components
2.3 Operational Semantics
three trying out Semantics
four hint Semantics
4.1 hint Definbility
five hint Abstractions
6 complete Abstraction
7 end and destiny Work

From (Meta) gadgets to features: A Java and AspectJ element of View

1 classes from Object-Oriented Languages
1.1 barriers (CONS)
1.2 Contributions (PRO)
2 The Java classification version and Its linked MOP
2.1 Exposing the Java type Model
2.2 utilizing the Java MOP
2.3 a few Drawbacks of the Java MOP
three AGuidedTourofAspectJ
3.1 The sign up for element and suggestion Models
3.2 Behavioral Crosscutting
3.3 Structural Crosscutting
four end and Open Questions
A Annex

MoMo:AModalLogic for Reasoning approximately Mobility

1 Introduction
2 µKlaim
2.1 µKlaim Syntax
2.2 Operational Semantics
three MoMo: A Modal common sense for Mobility
3.1 Kernel Fragment
3.2 kingdom Properties
3.3 Temporal Properties
3.5 Mobility Properties
3.6 Syntax and Semantics of MoMo
four ProofSystem
4.1 Sequents and Proofs
4.2 Names Handling
4.3 facts Rules
five Proving houses of cellular Systems
6 Conclusions and destiny Works

Probabilistic Linda-Based Coordination Languages

1 Introduction
2 Linda
2.1 including Probabilities/Quantities
2.2 information pushed Approach
2.3 agenda pushed Approach
three allotted Tuple areas: KLAIM
3.1 A middle KLAIM Calculus
3.2 Probabilistic KLAIM
3.3 Stochastic KLAIM
four Analysis
4.1 Probabilistic summary Interpretation
4.2 research - Discrete Case
4.3 research - non-stop Case
five Conclusions

Games with safe Equilibria,

1 Introduction
2 De.nitions
three 2-Player Non-zero-sum video games on Graphs
3.1 particular Maximal safe Equilibria
3.2 Algorithmic Characterization
four .-Regular Objectives
five n-Player Games
6 Conclusion

Priced Timed Automata: Algorithms and Applications

1 advent and Motivation
2 Priced Timed Automata
three optimum Scheduling
four Modeling
4.1 activity store Scheduling
4.2 job Graph Scheduling
4.3 motor vehicle Routing with Time Windows
4.4 plane Landing
4.5 PTA as opposed to MILP
4.6 commercial Case research: metal Production
4.7 commercial Case learn: Lacquer Production
five different Optimization Problems

rCOS: Refinement of part and item Systems

1 Introduction
2 Semantic Basis
2.1 courses as Designs
2.2 Refinement of Designs
three item Systems
3.1 Syntax
3.2 Semantics
3.3 overview of Expressions
four Object-Oriented Refinement
4.1 Refinement of item Systems
4.2 constitution Refinement
4.3 legislation of Structural Refinement
five part Systems
5.1 Introduction
5.2 Interfaces
5.3 Contracts
5.4 Component
5.5 Semantics Components
5.6 Refinement and Composition of Components
6 Conclusion
6.1 comparable Work
6.2 destiny Work

Program new release and Components

1 Introduction
2 software Generation
2.1 what's It?
2.2 what's for?
three Names and software program Components
four A middle Calculus with Names: MMLN
4.2 Simpli cation
4.3 Computation
4.4 kind Safety
five Programming Examples
6 RelatingMMLN
to MetaML
6.1 MetaML2
6.2 Translation of MetaML2 into MMLN
7 RelatingMMLN
to CMS
7.1 CMS
7.2 MLN
7.3 Translation of CMS into MLN
eight Conclusions and similar Work

Assertion-Based Encapsulation, item Invariants and Simulations

1 Introduction
2 How Shared gadgets and Reentrant Callbacks Violate Encapsulation
three Reentrance and item Invariants
four Sharing and item Invariants
five extra points of the inv /own Discipline
6 Pointer Con nement and Simulation
7 past Single-Object Invariants
eight demanding situations for destiny Work

A Dynamic Binding procedure for a number of Inheritance and Asynchronously
Communicating Objects

1 Introduction
2 Inheritance: Reuse of habit and Reuse of Code
2.1 a number of Inheritance
2.2 Naming rules for Conflic Resolution
2.3 digital Binding
three A Language for Asynchronously speaking Objects
four a number of Inheritance
4.1 Qualifie Names
4.2 digital Binding
five instance: Combining Authorization Policies
6 An Operational Semantics of Inheritance and digital Binding
6.1 procedure Confgurations
6.2 Concurrent Transitions
6.3 strategy Calls
6.4 digital and Static Binding of approach Calls
6.5 Guarded Statements
6.6 item production and characteristic Instantiation
7 similar Work
eight Conclusion

Observability, Connectivity, and Replay in a Sequential Calculus of

1 Introduction
2 Observability and Classes
2.1 Cross-Border Instantiation and Connectivity
2.2 Di.erent Observers and Order of Events
2.3 periods as turbines of gadgets, Replay, and Determinism
three A Single-Threaded Calculus with Classes
3.1 Operational Semantics
four hint Semantics and Ordering on Traces
4.1 stability Conditions
4.2 Equivalences
five complete Abstraction
5.1 concept of Observation
5.2 criminal Traces
5.3 Soundness and Completeness
6 Conclusion

Timing research and Timing Predictability prolonged Abstract

1 Execution-Time Variability
1.1 Timing Analysis
2 CostofUncertainty
three at the Multiplicative Nature of Uncertainty in Layered Systems
four in the direction of a Rational foundation for Design

Author Index

Show description

Read Online or Download Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2-5, 2004, Revised Lectures ... / Programming and Software Engineering) PDF

Similar compilers books

Verilog: Frequently Asked Questions: Language, Applications and Extensions

This ebook addresses "front finish" questions and concerns encountered in utilizing the Verilog HDL, in the course of the entire levels of layout, Synthesis and Verification. the problems mentioned within the e-book tend to be encountered in either ASIC layout tasks in addition to in gentle IP designs. those concerns are addressed in an easy Q&A structure.

Programming Multi-Agent Systems: Third International Workshop, ProMAS 2005, Utrecht, The Netherlands, July 26, 2005, Revised and Invited Papers

The realm of independent brokers and multi-agent structures (MAS) has grown right into a promising expertise delivering good possible choices for the layout of allotted, clever structures. a number of efforts were made by way of researchers and practitioners, either in academia and undefined, and through a number of standardisation consortia with the intention to offer new languages, instruments, tools, and frameworks so one can identify the required criteria for a large use of MAS know-how.

Compilers: Principles, techniques, and tools

Set of rules layout introduces algorithms through taking a look at the real-world difficulties that inspire them. The booklet teaches scholars various layout and research options for difficulties that come up in computing purposes. The textual content encourages an realizing of the set of rules layout approach and an appreciation of the function of algorithms within the broader box of laptop technological know-how.

Rule-Based Programming

Rule-Based Programming is a wide presentation of the rule-based programming strategy with many instance courses displaying the strengths of the rule-based method. The rule-based procedure has been used generally within the improvement of synthetic intelligence platforms, akin to professional structures and desktop studying.

Additional resources for Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2-5, 2004, Revised Lectures ... / Programming and Software Engineering)

Example text

Katis, N. Sabadini, and R. F. C. Walters. Bicategories of processes. Journal of Pure and Applied Algebra, 115(2):141–178, 1997. 25. P. Katis, N. Sabadini, and R. F. C. Walters. On the algebra of systems with feedback and boundary. Rendiconti del Circolo Matematico di Palermo, II(63):123– 156, 2000. 26. A. Kock. Strong functors and monoidal monads. Archiv f¨ ur Mathematik, 23:113– 120, 1972. 27. G. H. Mealy. A method for synthesizing sequential circuits. Bell Systems Techn. , 34(5):1045–1079, 1955.

Formal Aspects of Computing, 2(1):1–23, 1990. 35. J. N. Oliveira. Software reification using the Sets calculus. In Proc. of the BCS FACS 5th Refinement Workshop, Theory and Practice of Formal Software Development, London, UK, pages 140–171. Springer-Verlag, 8–10 January 1992. (Invited paper). 36. J. N. Oliveira and C. J. Rodrigues. Transposing relations: From Maybe functions to hash tables. In D. Kozen, editor, 7th International Conference on Mathematics of Program Construction, pages 334–356. Springer Lect.

Elsevier, 2003. 9. L. S. Barbosa, M. Sun, B. K. Aichernig, and N. Rodrigues. On the semantics of componentware: a coalgebraic perspective. In Jifeng He and Zhiming Liu, editors, Mathematical Frameworks for Component Software: Models for Analysis and Synthesis, Series on Component-Based Development. World Scientific, 2005. A Perspective on Component Refinement 47 10. M. A. Barbosa and L. S. Barbosa. Specifying software connectors. In K. Araki and Z. Liu, editors, 1st International Colloquium on Theorectical Aspects of Computing (ICTAC’04), pages 53–68, Guiyang, China, September 2004.

Download PDF sample

Rated 4.64 of 5 – based on 50 votes
Posted In CategoriesCompilers