Article

Free access

Anytime, anywhere: modal logics for mobile ambients

Authors:

Andrew D. GordonAuthors Info & Claims

POPL '00: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 365 - 377

https://doi.org/10.1145/325694.325742

Published: 05 January 2000 Publication History

Abstract

The Ambient Calculus is a process calculus where processes may reside within a hierarchy of locations and modify it. The purpose of the calculus is to study mobility, which is seen as the change of spatial configurations over time. In order to describe properties of mobile computations we devise a modal logic that can talk about space as well as time, and that has the Ambient Calculus as a model.

References

[1]

Abadi, M., Plotkin, G.D." A Logical View of Composition. TCS 114(1), 3-30, 1993.]]

Digital Library

[2]

Amadio, R.M., Prasad, S.: Localities and failures. FST & TCS '94, LNCS 880, 205-216, Springer, 1994.]]

Digital Library

[3]

Cardelli, L., Gordon, A.D.: Mobile Ambients. FoSSaCS'98, LNCS 1378, 140-155, Springer, 1998.]]

Digital Library

[4]

Cardelli, L., Gordon, A.D.: Types for Mobile Ambients. POPL'99, 79-92, 1999.]]

Digital Library

[5]

Cardelli, L., Ghelli, G., Gordon, A.D.: Mobility Types for Mobile Ambients. ICALP'99. LNCS 1644, 230-239, Springer, 1999.]]

Digital Library

[6]

Dam, M.: Relevance Logic and Concurrent Composition. LICS' 88, 178-185, 1988.]]

[7]

Dogen, K.: A Historical Introduction to Substructural Logics. In: Schroeder-Heistler, P., Dogen, K. (eds.): Substructural Logics. Studies in Logic and Computation 2, 1-30, Clarendon Press, 1994.]]

[8]

Engberg, U.H., Winskel, G." Linear Logic on Petri Nets. BRICS Report RS-94-3, 1994.]]

[9]

Engelfriet, J.: A Multiset Semantics for the 7t-calculus with Replication. TCS 153, 65-94, 1996.]]

Digital Library

[10]

Foumet, C., Gonthier, G.: A Calculus of Mobile Agents. CONCUR'96, LNCS 1119, Springer, 1999.]]

[11]

Gentzen, G." Untersuchungen fiber das logische Schlie6en. Mathematisehe Zeitschrift 39, 176-210, 405-431, 1935. English translation in: The collected papers of Gerhard Gentzen. M.E.Szabo (ed.), 132-213, North Holland, 1969.]]

[12]

Gordon, A.D., Cardelli, L.: Equational Properties of Mobile Ambients. FoSSaCS'99, LNCS 1578, 212-226, Springer, 1996.]]

Digital Library

[13]

Girard, J.-Y., Lafont, Y." Linear Logic and Lazy Computation. TAPSOFT 87, LNCS 250 vol 2, 53-66, Springer, 1987.]]

Digital Library

[14]

Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press, 1989.]]

Digital Library

[15]

Hennessy, H., Milner, R.: Algebraic Laws for Nondeterminism and Concurrency. JACM, 32(t) { 37-161, 1985.]]

Digital Library

[16]

Lafont, Y.: The Linear Abstract Machine. TCS (59)157- 180, 1988.]]

Digital Library

[17]

Milner, R.: Flowgraphs and Flow Algebras. JACM 26(4), 1979.]]

Digital Library

[18]

O'Heam, P.W., Pyre, D.: The Logic of Bunched Implications. Bulletin of Symbolic Logic. To appear, 1999.]]

[19]

Urquhart, A.: Semantics for Relevant Logics. Journal of Symbolic Logic 37(1)159-169, 1972.]]

[20]

Vitek, J., Castagna, G.: Seal: A Framework for Secure Mobile Computations. Intemet Programming Languages, LNCS 1686, 47-77, Springer, 1999.]]

Digital Library

Cited By

Giallorenzo SMontesi FPeressotti M(2024)Choral: Object-oriented Choreographic ProgrammingACM Transactions on Programming Languages and Systems10.1145/363239846:1(1-59)Online publication date: 16-Jan-2024
https://dl.acm.org/doi/10.1145/3632398
Jiang HLi L(2023)Improved Model Checking Algorithm for Mobile Ambients2023 4th International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)10.1109/ISCEIC59030.2023.10271211(319-323)Online publication date: 18-Aug-2023
https://doi.org/10.1109/ISCEIC59030.2023.10271211
Ciancia VGabelaia DLatella DMassink Mde Vink E(2023)On Bisimilarity for Polyhedral Models and SLCSFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-35355-0_9(132-151)Online publication date: 10-Jun-2023
https://doi.org/10.1007/978-3-031-35355-0_9
Show More Cited By

Index Terms

Anytime, anywhere: modal logics for mobile ambients
1. Theory of computation

Recommendations

Anytime approximate model reasoning
AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence

Propositional modal logics have two independent sources of complexity: unbounded logical omniscience and unbounded logical introspection. This paper discusses an approximation method to tame both of them, by merging propositional approximations with a ...
System support for anywhere anytime personal computing environment
M-MPAC '10: Proceedings of the 2nd International Workshop on Middleware for Pervasive Mobile and Embedded Computing

A personal computing environment is comprised of a set of components that include processors, storage devices, networking support, and peripheral devices. This paper identifies the key functionalities needed to build a loosely-coupled, anywhere, anytime ...
Toward secure and private service discovery anywhere anytime

With the advances in and convergence of Internet technologies, embedded computers, and wireless communication, computing devices have become part of our daily life. Hand-held devices and sensors with wireless connections create opportunities for many ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '00: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2000

402 pages

ISBN:1581131259

DOI:10.1145/325694

Chairmen:
Mark Wegman
IBM T. J. Watson Research Center, Yorktown Heights, NY
,
Thomas Reps
Univ. of Wisconsin

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 January 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

POPL00

Sponsor:

POPL00: Symposium on Principles of Programming Languages 2000

January 19 - 21, 2000

MA, Boston, USA

Acceptance Rates

POPL '00 Paper Acceptance Rate 30 of 151 submissions, 20%;

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

POPL '25

Sponsor:
sigplan

The 52nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages

January 19 - 25, 2025

Denver , CO , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

239
Total Citations
View Citations
1,019
Total Downloads

Downloads (Last 12 months)91
Downloads (Last 6 weeks)19

Reflects downloads up to 24 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Giallorenzo SMontesi FPeressotti M(2024)Choral: Object-oriented Choreographic ProgrammingACM Transactions on Programming Languages and Systems10.1145/363239846:1(1-59)Online publication date: 16-Jan-2024
https://dl.acm.org/doi/10.1145/3632398
Jiang HLi L(2023)Improved Model Checking Algorithm for Mobile Ambients2023 4th International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)10.1109/ISCEIC59030.2023.10271211(319-323)Online publication date: 18-Aug-2023
https://doi.org/10.1109/ISCEIC59030.2023.10271211
Ciancia VGabelaia DLatella DMassink Mde Vink E(2023)On Bisimilarity for Polyhedral Models and SLCSFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-35355-0_9(132-151)Online publication date: 10-Jun-2023
https://doi.org/10.1007/978-3-031-35355-0_9
Ciancia VGroote JLatella DMassink Mde Vink E(2023)Minimisation of Spatial Models Using Branching BisimilarityFormal Methods10.1007/978-3-031-27481-7_16(263-281)Online publication date: 3-Mar-2023
https://doi.org/10.1007/978-3-031-27481-7_16
Bavendiek KSchupp S(2022)A process calculus for privacy-preserving protocols in location-based service systemsJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2021.100735125(100735)Online publication date: Feb-2022
https://doi.org/10.1016/j.jlamp.2021.100735
Jipsen PLitak T(2021)An Algebraic Glimpse at Bunched Implications and Separation LogicHiroakira Ono on Substructural Logics10.1007/978-3-030-76920-8_5(185-242)Online publication date: 14-Dec-2021
https://doi.org/10.1007/978-3-030-76920-8_5
Nenzi LBartocci EBortolussi LLoreti MVisconti E(2020)Monitoring Spatio-Temporal Properties (Invited Tutorial)Runtime Verification10.1007/978-3-030-60508-7_2(21-46)Online publication date: 2-Oct-2020
https://doi.org/10.1007/978-3-030-60508-7_2
Vissat LLoreti MNenzi LHillston JMarion G(2019)Analysis of Spatio-temporal Properties of Stochastic Systems Using TSTLACM Transactions on Modeling and Computer Simulation10.1145/332616829:4(1-24)Online publication date: 10-Dec-2019
https://dl.acm.org/doi/10.1145/3326168
Li XSong WYe H(2018)ALChecker: A Tool for Checking Mobile Ambients2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)10.1109/SmartWorld.2018.00270(1577-1581)Online publication date: Oct-2018
https://doi.org/10.1109/SmartWorld.2018.00270
Ciancia VGilmore SGrilletti GLatella DLoreti MMassink M(2018)Spatio-temporal model checking of vehicular movement in public transport systemsInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-018-0483-820:3(289-311)Online publication date: 1-Jun-2018
https://dl.acm.org/doi/10.1007/s10009-018-0483-8
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents