Mostrar el registro sencillo del ítem

Especificación de la red móvil mediante un enfoque formal similar a wp

dc.contributor.authorKumar Singh, Awadheshspa
dc.contributor.authorGhanekar, Umeshspa
dc.contributor.authorBandyopadhyay, Anup Kumarspa
dc.date.accessioned2020-10-27T00:21:10Z
dc.date.available2020-10-27T00:21:10Z
dc.date.issued2005-12-01
dc.identifier.issn2539-2115
dc.identifier.issn1657-2831
dc.identifier.urihttp://hdl.handle.net/20.500.12749/9021
dc.description.abstractEl documento tiene como objetivo proporcionar un sistema formal, motivado por la condición previa más débil de Dijkstra lógica, para especificar la red móvil. El documento muestra cómo se puede especificar la movilidad utilizando un enfoque basado en el estado y la transición, que permite que los hosts móviles sean tratados como nodos en un sistema distribuido estructurado estáticamente tradicional. Otro objetivo es razonar formalmente sobre la posibles comportamientos de un sistema formado por componentes móviles. El procedimiento de entrega sirve como una ilustración para la notación. La contribución del artículo es el desarrollo de un estilo de modelado y razonamiento sobre las propiedades temporales que permite una análisis exhaustivo de los sistemas móviles.spa
dc.format.mimetypeapplication/pdfspa
dc.language.isospaspa
dc.publisherUniversidad Autónoma de Bucaramanga UNAB
dc.relationhttps://revistas.unab.edu.co/index.php/rcc/article/view/1063/1035
dc.relation.urihttps://revistas.unab.edu.co/index.php/rcc/article/view/1063
dc.rightsDerechos de autor 2005 Revista Colombiana de Computación
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.sourceRevista Colombiana de Computación; Vol. 6 Núm. 2 (2005): Revista Colombiana de Computación; 1-19
dc.subjectInnovaciones tecnológicas
dc.subjectCiencia de los computadores
dc.subjectDesarrollo de tecnología
dc.subjectIngeniería de sistemas
dc.subjectInvestigaciones
dc.subjectTecnologías de la información y las comunicaciones
dc.subjectTIC´s
dc.titleEspecificación de la red móvil mediante un enfoque formal similar a wpspa
dc.title.translatedSpecifying mobile network using a wp-like formal approacheng
dc.type.driverinfo:eu-repo/semantics/article
dc.type.localArtículospa
dc.type.coarhttp://purl.org/coar/resource_type/c_7a1f
dc.subject.keywordsTechnological innovationseng
dc.subject.keywordsComputer scienceeng
dc.subject.keywordsTechnology developmenteng
dc.subject.keywordsSystems engineeringeng
dc.subject.keywordsInvestigationseng
dc.subject.keywordsInformation and communication technologieseng
dc.subject.keywordsICT'seng
dc.subject.keywordsWeakest preconditioneng
dc.subject.keywordsMobile computingeng
dc.subject.keywordsSpecification verificationeng
dc.subject.keywordsSafetyeng
dc.subject.keywordsHandovereng
dc.identifier.instnameinstname:Universidad Autónoma de Bucaramanga UNABspa
dc.type.hasversionInfo:eu-repo/semantics/publishedVersion
dc.type.hasversioninfo:eu-repo/semantics/acceptedVersionspa
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessspa
dc.relation.referencesR. M. B. E. Morsi and J. F. Leathrum. A formal specification and verification of GSM using the OSI-RM formal object model. In Proceedings of the Applied Telecommunication Symposium ATS’03, 30 March – 03 April, Orlando, Florida, pages 1– 6, 2003.
dc.relation.referencesL. Andriantsiferana, B. Ghribi and L. Logrippo. Prototyping and formal requirement validation of GPRS: a mobile data packet radio service for GSM. In Dependable Computing for Critical Application: Proceedings of the IEEE Conference, 6–8 January, pages 109–128, 1999.
dc.relation.referencesJ. A. Hall, Seven myths of formal methods. IEEE Software, vol. 7, September, pages 11- 19, 1990.
dc.relation.referencesL. Lamport, Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2): 190–222, 1983.
dc.relation.referencesK. Finney, Mathematical notation in formal specification – too difficult for the masses?’. IEEE Transactions on Software Engineering, 22(2): 158-159, 1996
dc.relation.referencesG. J. Doherty, J. F. Campos and M. D. Harrison, Representational reasoning and verification. Formal Aspects of Computing, 12(4): 260-277, 2000.
dc.relation.referencesW. H. Hesselink, Predicate transformers for recursive procedures with local variables. Formal Aspects of Computing, 11(6): 616-636, 1999.
dc.relation.referencesZ. Chaochen, C. A. R. Hoare and A. P. Raven, A calculus of durations. Information Processing Letters, 40(5): 269-276, 1991.
dc.relation.referencesM. Kirchner. Program verification with the mathematical soft-ware system Theorema. PhD thesis, Research Institute of Symbolic Computation, Linz, Austria, 1999.
dc.relation.referencesK. L. Ildiko. Program verification using Hoare logic. In Computer Aided Verification of Information Systems – A Practical Industry Oriented Approach: Proceedings of the Workshop CAVIS’03, 12th of February, e-Austria Institute, Timisoara, Romania, 2003.
dc.relation.references]G. Smith. A formal framework for modeling and analyzing mobile systems. In Australasian Computer Science: Proceedings of the 27th ACM International Conference ACSC 2004, 26: 193–202, 2004.
dc.relation.referencesT. Imielinski and B. R. Badrinath, Mobile wireless computing: challenges in data management. Communications of the ACM, 37(10): 18–28, 1994.
dc.relation.referencesL. Lamport. Verification and specification of concurrent programs. In: J. W. de Bakker, W. –P. de Roever and G. Rozenberg (eds.), A Decade of Concurrency – Reflections and Perspectives: Proceedings of the REX Workshop, June, The Netherlands, SpringerVerlag, LNCS 803, pages 347–374, 1993.
dc.relation.referencesE. W. Dijkstra. A Discipline of Programming. Prentice Hall, Englewood Cliffs, NJ, 1976.
dc.relation.referencesN. Popov. Verification using weakest precondition strategy. In Computer Aided Verification of Information Systems – A Practical Industry Oriented Approach: Proceedings of the Workshop CAVIS’03, 12th of February, e-Austria Institute, Timisoara, Romania, 2003.
dc.relation.referencesK. R. M. Leino. Efficient weakest preconditions. Technical Report MSR-TR-2004-34, April, Microsoft Research, 2004.
dc.relation.referencesM. Ben-Ari. Mathematical Logic for Computer Science. Prentice Hall, Englewood Cliffs, NJ, 1993.
dc.relation.referencesE. D’Hondt and P. Panangaden. Quantum weakest preconditions. In Quantum Programming Languages: Proceedings of the 2nd International Workshop QPL2004, 12– 13 July, Turku, Finland, pages 75–90, 2004.
dc.relation.referencesA. K. Singh and A. K. Bandyopadhyay, Verifying mutual exclusion and liveness properties with split preconditions. Journal of Computer Science and Technology, To appear, 2004.
dc.relation.referencesK. M. Chandi and B. A. Sanders, Predicate transformers for reasoning about concurrent computation. Science of Computer Programming, 24(2): 129–148, 1995.
dc.relation.referencesG. P. Pollini, Trends in hndover design. IEEE Communications Magazine, March, pages 82–90, 1996.
dc.relation.referencesR. Vijayan and J. M. Holtzman, A model for analyzing handoff algorithms. IEEE Transactions on Vehicular Technology, 42(3): 351–356, 1993.
dc.relation.referencesF. Graziosi, M. Pratesi, M. Ruggieri and F. Santucci, A multi-cell model of handover initiation in mobile cellular networks. IEEE Transactions on Vehicular Technology, 48(3): 802–814, 1999.
dc.relation.referencesS. Agarwal and J. M. Holtzman, Modelling and analysis of handoff algorithms in multicellular systems. In Proceedings of the IEEE Vehicular Technology Conference, pages 300–304, 1997.
dc.relation.referencesA. Aaroud, S. E. Labhalla and B. Bounabat. Design of GSM handover using MARDS model. In Information Technology and Applications: Proceedings of the 2nd International Conference ICITA2004, 9–11 January, Harbin, China, 2004.
dc.relation.referencesF. Orava and J. Parrow, An algebraic verification of a mobile network. Formal Aspects of Computing, 4(6): 497–543, 1992.
dc.relation.referencesT. Kapus and Z. Brezocnik. Verification of a mobile network in a shared-variables model. Presented at the Verifications in New Orientations’97 Workshop, May, Val Bregaglia, Switzerland, 1997.
dc.relation.referencesT. Kapus and Z. Brezocnik. TLA-style specification of a mobile network. In Proceedings of the 23rd EURUMICRO IEEE Conference EUROMICRO’97, 1–4 September, pages 440–447, 1997.
dc.relation.referencesT. Kapus and Z. Brezocnik. Verification of a mobile network handover procedure using Murφ. In Proceedings of the 6th Electro technical and Computer Science Conference ERK’97, Z. A. J. C. Baldomir (ed.), 25–27 September, Portoro~, Slovenia, pages A/83– 86, 1997.
dc.relation.referencesW. H. Hesselink, An assertional criterion for atomicity. Acta Informatica, 38(5): 343–366, 2002.
dc.relation.referencesL. Lamport, Proving liveness properties of concurrent programs. ACM Transactions on Programming Languages and Systems, 4(3): 155–495, 1982.
dc.relation.referencesM. Charpentier. An approach to composition motivated by wp. In Fundamental Approaches to Software Engineering: Proceedings of the 5th International Conference FASE’2002, April, Springer-Verlag, LNCS 2306, pages 1–14, 2002.
dc.relation.referencesN. H. Minsky, Y. M. Minsky and V. Ungureanu. Making tuple spaces safe for heterogeneous distributed systems. In Applied Computing – Special Track on Coordination Models, Languages and Applications: Proceedings of the ACM Symposium ACMSAC’2000, 19–21 April, Como, Italy, pages 218–226, 2000.
dc.relation.referencesL. Chunlin and L. Layuan. An agent-based approach for grid computing. In Parallel and Distributed Computing Applications and Technologies: Proceedings of the 4th International Conference PDCAT’2003, 27–29 August, pages 608–611, 2003.
dc.relation.referencesL. Lamport, A simple approach to specifying concurrent systems. Communications of the ACM, 32(1): 32–45, 1989.
dc.relation.referencesJ. V. Guttag and J. J. Horning. Formal specification as a design tool. In Principles of Programming Languages: Proceedings of the ACM Symposium, January, Las Vegas, pages 251–261, 1980
dc.relation.referencesL. Lamport. What it means for a concurrent program to specify a specification: why no one has specified priority. In Principles of Programming Languages: Proceedings of the 12th ACM SIGACT-SIGPLAN Symposium, January, New Orleans, pages 78–83, 1985.
dc.relation.referencesK. Sabnani, An algorithmic technique for protocol verification. IEEE Transaction on Communication, 36(8): 924–931, 1988.
dc.relation.referencesP. Wolper. Specifying interesting properties of programs in prepositional temporal logic. In Principles of Programming Languages: Proceedings of the 13th ACM Symposium, pages 184–193, 1986.
dc.relation.referencesL. Lamport. “Sometime” is sometimes “not never”: On the temporal logic of programs. In Principles of Programming Languages: Proceedings of the 7th Annual ACM Symposium, 28–30 January, Las Vegas, pages 174–185, 1980.
dc.relation.referencesE. A. Emerson. Temporal and modal logic. In: J. v. Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. B, chapter 16, Elsevier Science, pages 995–1072, 1990.
dc.relation.referencesZ. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer–Verlag, New York, 1992.
dc.relation.referencesZ. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. SpringerVerlag, New York, 1995.
dc.relation.referencesE. M. Clarke, O. Grumberg and D. A. Peled. Model Checking. MIT Press, 1999.
dc.relation.references]B. Bérard et al. Systems and Soft-ware Verification: Model-Checking Techniques and Tools. Springer–Verlag, New York, 2001.
dc.relation.referencesF. Laroussinie, N. Markey and P. Schnoebelen. Temporal logic with forgettable past. In Logic in Computer Science: Proceedings of the 17 Annual IEEE Symposium LICS'2002, 22–25 July th , Copenhagen, Denmark, pages 383–392, 2002.
dc.relation.referencesF. Laroussinie, N. Markey and P. Schnoebelen. Temporal logic with forgettable past. In Logic in Computer Science: Proceedings of the 17 Annual IEEE Symposium LICS'2002, 22–25 July th , Copenhagen, Denmark, pages 383–392, 2002.
dc.relation.referencesH. Dierks, Comparing model checking and logical reasoning for real-time systems. Formal Aspects of Computing, 16(2): 104–120, 2004.
dc.contributor.orcidAnup Kumar Bandyopadhyay [0000-0002-0503-8441]spa
dc.subject.lembInnovaciones tecnológicasspa
dc.subject.lembCiencia de los computadoresspa
dc.subject.lembDesarrollo de tecnologíaspa
dc.subject.lembIngeniería de sistemasspa
dc.subject.lembInvestigacionesspa
dc.subject.lembTecnologías de la información y las comunicacionesspa
dc.identifier.repourlrepourl:https://repository.unab.edu.co
dc.description.abstractenglishThe paper aims at providing a formal system, motivated by Dijkstra’s weakest precondition logic, for specifying mobile network. The paper shows how mobility can be specified using a state and transition based approach, which allows mobile hosts to be treated as nodes in a traditional statically structured distributed system. Another goal is to reason formally about the possible behaviors of a system consisting of mobile components. The handover procedure serves as an illustration for the notation. The contribution of the paper is the development of a style of modeling and reasoning about the temporal properties that allows for a straightforward and thorough analysis of mobile systems.eng
dc.subject.proposalCondición previa más débilspa
dc.subject.proposalComputación móvilspa
dc.subject.proposalEspecificaciónspa
dc.subject.proposalVerificaciónspa
dc.subject.proposalSeguridadspa
dc.subject.proposalEntregarspa
dc.type.redcolhttp://purl.org/redcol/resource_type/CJournalArticle
dc.rights.creativecommonsAtribución-NoComercial-SinDerivadas 2.5 Colombia*


Ficheros en el ítem

Thumbnail
Nombre:
2005_Articulo_Especificación de ...
Tamaño:
304.8Kb
Formato:
PDF
Descripción:
Artículo
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem

Atribución-NoComercial-SinDerivadas 2.5 Colombia
Excepto si se señala otra cosa, la licencia del ítem se describe como Atribución-NoComercial-SinDerivadas 2.5 Colombia