8 citations found. Retrieving documents...
H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36:591--616, 2000.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Typing Non-uniform Concurrent Objects - Ravara (1999)   (10 citations)  (Correct)

....actors. In a community of communicating actors a fairness assumption is assumed. A di erent approach is that of Sernadas et al. that investigate the algebraic speci cation and veri cation of concurrent, object oriented systems, using categorical techniques [CSSE92, CSS93, CSS94, ES90, EGS91, EC00, SSE87, SFSE89, SEC90, SE91, SSC95, SSC98] 1.2 Non uniform objects In the beginning of the 90 s, Nierstrasz argued that typing concurrent objects posed particular problems, due to the non uniform service availability of concurrent objects . By synchronisation constraints, the availability of ....

Hans-Dieter Ehrich and Carlos Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36:591-616, 2000.


FireWorks - Technical Report for Year 2 - Ryan (1999)   (Correct)

.... Workshop on Advances in Modal Logic (AiML 98) 25th International Colloquium on Automata, Languages, and Programming (ICALP 98) and 2nd International Workshop on Frontiers of Combining Systems (FroCos 98) With respect to temporal logic approaches, the current emphasis is on distribution [EC98] in close cooperation with Braunschweig, denotational semantics [SSC98] and evolving speci cation [SSSS98] in close cooperation with Namur and Magdeburg. Abduction techniques in 7 this context have been developed in [Gou98] and were presented in [GS99] Default speci cation and reasoning ....

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Research report, Section of Computer Science, Department of Mathematics, Instituto Superior Tecnico, 1096 Lisboa, Portugal, 1998. Submitted for publication.


Metareasoning about Security Protocols using Distributed.. - Caleiro, Vigano, Basin (2004)   (1 citation)  Self-citation (Caleiro)   (Correct)

No context found.

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36:591--616, 2000.


Foundations of a Module Concept for Distributed Object Systems - Filipe (2000)   (1 citation)  Self-citation (Ehrich)   (Correct)

No context found.

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36(8):591--616, 2000.


On the Development and Use of a Formal Object Oriented.. - Kowsari (2002)   Self-citation (Ehrich)   (Correct)

No context found.

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36(Fasc. 8):591--616, 2000.


Checking Object Systems Via Multiple Observers - Ehrich, Pinger (2000)   Self-citation (Ehrich)   (Correct)

....used to specify local conditions with the added possibility to formulate properties of other objects during communication points. In this sense, the logic is global although all statements are bound to a locality. We capitalize on a result on translating distributed logics published in [ECSD98,EC00] and show how such global conditions can be distributed over the objects involved, separating the necessary communication and making it explicit. The approach is orthogonal to the method used for checking: testing, automatic theorem proving, interactive theorem proving, or model checking. In ....

....happens during a given transition, and an individual set # i of state predicate symbols expressing which attributes have which values in a given state. Let # = I, A i , # i i#I ) be the observer signature. Our multi observer logic is like the distributed logic D 1 described in [ECSD98,EC00] but instantiated with CTL, the computation tree logic due to E. Clarke and A.E. Emerson [CE81] This logic D 1 (#) or D 1 for short when # is clear from context is defined as follows. Definition 1. The observer logic D 1 is the I indexed family of local logics D i 1 i#I where, ....

[Article contains additional citation context not shown here]

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36 (Fasc. 8):591--616, 2000.


Mechanisms for Combining Logics - Caleiro, Sernadas, Sernadas   Self-citation (Caleiro)   (Correct)

....and this becomes clear by noting that synchroniza35 tion is indeed a special case of fibring: it corresponds to fibring of l.s.p. s whose signatures only have constants. The quite general ideas underlying these relationships are not so rare. Similar phenomena have been recognized for instance in [13, 12] in a study of temporal logics for distributed systems. Similar ideas also underly the (as far as we know) unpublished paper [40] that we have discovered by incident on a recent web exploration, where they are also used to provide characterizations of interleaved languages by means of paired ....

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Research report, Section of Computer Science, Department of Mathematics, Instituto Superior T'ecnico, 1096 Lisboa, Portugal, 1998. Submitted for publication.


Towards a Metalogic for Security Protocol Analysis.. - Caleiro, Vigano, Basin   (Correct)

No context found.

H.-D. Ehrich and C. Caleiro. Specifying communication in distributed information systems. Acta Informatica, 36:591--616, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC