Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communications of the ACM
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, II
Information and Computation
Model checking mobile processes
Information and Computation
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Local Model Checking for Value-Passing Processes (Extended Abstract)
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
A Spatial Logic for Concurrency
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Note on Model Checking the Modal nu-Calculus
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Multiple Tuple Spaces in Linda
PARLE '89 Proceedings of the Parallel Architectures and Languages Europe, Volume II: Parallel Languages
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Formulae Meet Programs Over the Net: A Framework for Correct Network Aware Programming
Automated Software Engineering
Model checking mobile stochastic logic
Theoretical Computer Science
Generalization of some properties of relations in the context of functional temporal×modal logic
International Journal of Computer Mathematics - Recent Advances in Computational and Applied Mathematics in Science and Engineering
Quantitative μ-calculus and CTL Based on Constraint Semirings
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Logic for Performance and Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
SoSL: a service-oriented stochastic logic
Rigorous software engineering for service-oriented systems
MoMo: a modal logic for reasoning about mobility
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
A complete temporal and spatial logic for distributed systems
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Mobile distributed programming in X-KLAIM
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Modeling adaptation with a tuple-based coordination language
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Modeling adaptation with Klaim
ACM SIGAPP Applied Computing Review
| Hi-index | 0.00 |
Klaim is an experimental programming language that supports a programming paradigm where both processes and data can be moved across different computing environments. The language relies on the use of explicit localities. This paper presents a temporal logic for specifying properties of Klaim programs. The logic is inspired by Hennessy-Milner Logic (HML) and the μ-calculus, but has novel features that permit dealing with state properties and impact of actions and movements over the different sites. The logic is equipped with a complete proof system that enables one to prove properties of mobile systems.