author: susanne graf

Formal Methods for Components and Objects: Third International Symposium, FMCO 2004, Leiden, The Netherlands, November 2-5, 2004, Revised Lectures

... Notes in Computer Science. Springer, 2004. Cristiano Calcagno, Walid Taha ... online from http://www.cs.rice.edu/∼{}taha/MetaOCaml/, 2001. E. Moggi and S ... calculus for link-time compilation. In ESOP '00 [ESOP00], pages 260–274 ...

Formal Methods for Components and Objects: First International Symposium, FMCO 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures

... ICollection, and IEnumerable. It is interesting to subject such interfaces to the same analysis as we have applied to the class. This analysis (see sections 6 and 7 for general statistics about the contract rates of .NET collection classes ...

Formal Methods for Components and Objects: 4th International Symposium, FMCO 2005, Amsterdam, The Netherlands, November 1-4, 2005, Revised Lectures

... (FlexeLint) http://www.gimpel.com. 2. (Coverity) http://www.coverity.com. 3. (Fortify) http://www.fortifysoftware.com/products/sca.jsp. 4. Holzmann, G.: Static source code checking for user-defined properties. In: Proc. IDPT 2002 ...

Formal Methods for Components and Objects: 6th International Symposium, FMCO 2007, Amsterdam, The Netherlands, October 24-26, 2007, Revised Lectures

... Modifiers from the set {rep,peer,any}. The syntax of our source language is given in Figure 3. We assume three countably infinite ... Modifiers and Owners Universe Types structure the heap. Universe Types for Topology and Encapsulation 77.

Formal Methods for Components and Objects: 5th International Symposium, FMCO 2006, Amsterdam, Netherlands, November 7-10,2006, Revised Lectures

... CCS. Notice that the above observations imply some semantics differences between CCS and the π-calculus. The former does not satisfy name α-equivalence because of the dynamic nature of name scoping—see Example 1. The latter uses static ...

Formal Methods for Components and Objects: 5th International Symposium, FMCO 2006, Amsterdam, Netherlands, November 7-10,2006, Revised Lectures

... CCS exam- ples in Section 3.2 ( see Remark 1 ) can easily be adapted here to illustrate that we obtain dynamic scoping of names if we do not perform the a - conversion in the substitution . It should be noticed that the above has not ...

Tools and Algorithms for the Construction and Analysis of Systems: 6th International Conference, TACAS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 - April 2, 2000 Proceedings

... sleeping barber problem [And91]. The barber allows a new customer into the shop with the event enext1. The customer gets a chair by calling the event ehaircut1 (as long as their is an available chair). Then the barber starts the haircut ...

This website uses cookies and collects data for optimal performance. Your continued use signifies agreement to our Privacy Policy.