Modelling and Verification of CoAP over Routing Layer Using SPIN Model Checker

Many of the communication protocols developed for the resource constrained devices are rarely subjected to protocol verification. Design flaws like deadlocks, livelocks, non-progressive cycles etc. may come into view during the realization and can cause catastrophic effects in safety-critical applic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Procedia computer science Ročník 93; s. 299 - 308
Hlavní autoři: Vattakunnel, Anchal J., Kumar, N. Suresh, Kumar, G Santhosh
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2016
Témata:
ISSN:1877-0509, 1877-0509
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Many of the communication protocols developed for the resource constrained devices are rarely subjected to protocol verification. Design flaws like deadlocks, livelocks, non-progressive cycles etc. may come into view during the realization and can cause catastrophic effects in safety-critical applications. Formal specification of the protocol represented as a model helps to describe and analyse the conformability of the implementation to its specification and subsequently reveal design flaws, if any in the system. The formal model is subject to verification by inserting correctness and safety properties of the protocol and validating logical correctness using a model checking tool. All model checkers suffer from state explosion problem due to enormous states of the model being created. The key contribution of the present work is the introduction of a method to develop a compact verification model which is amenable to full state space search by abstracting the key elements of a protocol. Moreover, many protocol verification works presented in the existing literature consider only a single layer of a communication protocol. To correctly model the overall behaviour of a protocol, interactions between the layers have to be incorporated. The proposed method has been proven useful by considering verification of an application protocol, CoAP for constrained devices by abstracting out the aspects of the underlying routing protocol RPL. Reliable message exchanges among various entities are modeled and its safety and correctness properties were analysed and verified. The results obtained show that the model performs the full state space search by considering all possible routing paths and are free from design flaws. The method described has been implemented by building a validation model in PROMELA and the model is verified by using SPIN model checker. The methodology used in this paper can be used to verify any application layer protocol for constrained devices in IoT scenario that run on top of routing layer.
AbstractList Many of the communication protocols developed for the resource constrained devices are rarely subjected to protocol verification. Design flaws like deadlocks, livelocks, non-progressive cycles etc. may come into view during the realization and can cause catastrophic effects in safety-critical applications. Formal specification of the protocol represented as a model helps to describe and analyse the conformability of the implementation to its specification and subsequently reveal design flaws, if any in the system. The formal model is subject to verification by inserting correctness and safety properties of the protocol and validating logical correctness using a model checking tool. All model checkers suffer from state explosion problem due to enormous states of the model being created. The key contribution of the present work is the introduction of a method to develop a compact verification model which is amenable to full state space search by abstracting the key elements of a protocol. Moreover, many protocol verification works presented in the existing literature consider only a single layer of a communication protocol. To correctly model the overall behaviour of a protocol, interactions between the layers have to be incorporated. The proposed method has been proven useful by considering verification of an application protocol, CoAP for constrained devices by abstracting out the aspects of the underlying routing protocol RPL. Reliable message exchanges among various entities are modeled and its safety and correctness properties were analysed and verified. The results obtained show that the model performs the full state space search by considering all possible routing paths and are free from design flaws. The method described has been implemented by building a validation model in PROMELA and the model is verified by using SPIN model checker. The methodology used in this paper can be used to verify any application layer protocol for constrained devices in IoT scenario that run on top of routing layer.
Author Kumar, N. Suresh
Vattakunnel, Anchal J.
Kumar, G Santhosh
Author_xml – sequence: 1
  givenname: Anchal J.
  surname: Vattakunnel
  fullname: Vattakunnel, Anchal J.
  email: anchaljacob@gmail.com
– sequence: 2
  givenname: N. Suresh
  surname: Kumar
  fullname: Kumar, N. Suresh
  email: sureshkumar@cusat.ac.in
– sequence: 3
  givenname: G Santhosh
  surname: Kumar
  fullname: Kumar, G Santhosh
  email: san@cusat.ac.in
BookMark eNqFkM1OwzAQhC1UJErpE3DxCyTYcRI7Bw5VxE-lUhBQrpbjbMAlxJUdKvXtcVoOiAPsZXek_UaaOUWjznaA0DklMSU0v1jHG2e1j5MgYsLjhKZHaEwF5xHJSDH6cZ-gqfdrEoYJUVA-Rss7W0Pbmu4Vq67GL-BMY7Tqje2wbXBpZw_YbsHhR_vZD18LtQtq5Yf76WG-xHsDXL6Bfgd3ho4b1XqYfu8JWl1fPZe30eL-Zl7OFpFmqeijihaEV0WaKZ3lkNAsgYLTCmilRJbktKE8V4xXIkhScKE4EK4Y5EkKmgFjE8QOvtpZ7x00cuPMh3I7SYkcWpFruW9FDq1IwmVoJVDFL0qbfp-1d8q0_7CXBxZCrK0BJ7020GmojQPdy9qaP_kvMRp_7A
CitedBy_id crossref_primary_10_1002_dac_3447
crossref_primary_10_1016_j_cose_2025_104440
crossref_primary_10_1007_s11235_023_01075_5
crossref_primary_10_1007_s10586_022_03963_y
Cites_doi 10.1007/s100090050010
10.1109/32.588521
10.1007/978-0-387-35394-4_26
10.1109/GLOCOM.2007.137
10.1023/A:1008696026254
10.17487/rfc7252
10.1109/LANMAN.2011.6076934
10.1109/ICMECH.2011.5971218
10.1145/2508443.2508452
10.7146/brics.v3i24.20005
10.1109/CNS.1988.4993
10.1109/MIC.2012.29
10.1016/S0140-3664(96)01150-4
10.1109/MELCON.2004.1348275
10.1145/1278972.1278992
10.1007/s100090050044
10.1007/978-3-642-16901-4_38
10.1109/SURV.2012.111412.00158
10.1145/1721933.1721950
10.1007/978-1-84800-328-6_8
ContentType Journal Article
Copyright 2016 The Authors
Copyright_xml – notice: 2016 The Authors
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.procs.2016.07.214
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1877-0509
EndPage 308
ExternalDocumentID 10_1016_j_procs_2016_07_214
S1877050916314557
GroupedDBID --K
0R~
0SF
1B1
457
5VS
6I.
71M
AACTN
AAEDT
AAEDW
AAFTH
AAIKJ
AALRI
AAQFI
AAXUO
ABMAC
ACGFS
ADBBV
ADEZE
AEXQZ
AFTJW
AGHFR
AITUG
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
E3Z
EBS
EJD
EP3
FDB
FNPLU
HZ~
IXB
KQ8
M41
M~E
NCXOZ
O-L
O9-
OK1
P2P
RIG
ROL
SES
SSZ
9DU
AAYWO
AAYXX
ABWVN
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEUPX
AFPUW
AIGII
AKBMS
AKRWK
AKYEP
CITATION
~HD
ID FETCH-LOGICAL-c348t-b1907b945ac56e2152e971be1ba85261f176a37b8a850978a7e07a3e624ec3e33
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000383945000041&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1877-0509
IngestDate Sat Nov 29 02:44:57 EST 2025
Tue Nov 18 22:32:04 EST 2025
Wed May 17 00:58:04 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Model checking
COAP
SPIN
Model Verification
PROMELA
IoT
Language English
License This is an open access article under the CC BY-NC-ND license.
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c348t-b1907b945ac56e2152e971be1ba85261f176a37b8a850978a7e07a3e624ec3e33
OpenAccessLink https://dx.doi.org/10.1016/j.procs.2016.07.214
PageCount 10
ParticipantIDs crossref_primary_10_1016_j_procs_2016_07_214
crossref_citationtrail_10_1016_j_procs_2016_07_214
elsevier_sciencedirect_doi_10_1016_j_procs_2016_07_214
PublicationCentury 2000
PublicationDate 2016
2016-00-00
PublicationDateYYYYMMDD 2016-01-01
PublicationDate_xml – year: 2016
  text: 2016
PublicationDecade 2010
PublicationTitle Procedia computer science
PublicationYear 2016
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References M. Frappier, B. Fraikin, R. Chossart, R. Chane-Yack-Fa, and M. Ouenzar, “Comparison of model checking tools for information systems,” in.
Islam, Sqalli, Khan (bib0100) 2006; 3
Larsen, Pettersson, Yi (bib0050) 1997; 1
pp. 581-596, Springer, 2010.
2011.
G. Montenegro, N. Kushalnagar, J. Hui, and D. Culler, “Rfc 4944,”
D. Broman, E.A. Lee, S. Tripakis, and M. Törngren, “Viewpoints, formalisms, languages, and tools for cyber-physical systems,” in
vol. 802, no. 4.
pp. 49-54, ACM, 2012.
pp. 189-210, Springer, 2009.
Holzmann (bib0070) 1998; 13
D. Câmara, A.A. Loureiro, and F. Filali, “Formal verification of routing protocols for wireless ad hoc networks,” in
Z. Shelby, K. Hartke, and C. Bormann, “The constrained application protocol (coap)(rfc 7252),” 2014.
Ben-Ari (bib0055) 2010; 1
Palattella, Accettura, Vilajosana, Watteyne, Grieco, Boggia, Dohler (bib0120) 2013; 15
Holzmann (bib0025) 1997; 23
Holzmann (bib0065) 1997; 20
D. Câmara, A.A. F. Loureiro, and F. Filali, “Methodology for formal verification of routing protocols for ad hoc wireless networks,” in Global Telecommunications Conference, 2007. GLOBECOM’07. IEEE, pp. 705-709, IEEE, 2007.
de Vries, Tretmans (bib0075) 2000; 2
G. J. Holzmann, “Design and Validation of Computer Protocols Prentice Hall,”
D. Bošnački and D. Dams, “Integrating real time into spin: A prototype implementation,” in
pp. 767-772, IEEE, 2011.
Bharti, Kumar (bib0040) 2012; 2
pp. 78-82, ACM, 2007.
1991.
R. De Renesse and A. Aghvami, “Formal verification of ad-hoc routing protocols using spin model checker,” in Electrotechnical Conference, 2004. MELECON 2004. Proceedings of the 12th IEEE Mediterranean, vol. 3, pp. 1177-1182, IEEE, 2004.
1997.
W. Colitti, K. Steenhaut, N. De Caro, B. Buta, and V. Dobrota, “Evaluation of constrained application protocol for wireless sensor networks,” in Local & Metropolitan Area Networks (LANMAN), 2011 18th IEEE Workshop on, pp. 1-6, IEEE, 2011.
Javed Kashi (bib0095) 2010; 8
T. Winter, P. Thubert, J. Vasseur, et al., “Rpl: Routing protocol for low power and lossy networks, rfc6550,” 2012.
Jensen, Larsen, Skou (bib0110) 1996; 3
Bormann, Castellani, Shelby (bib0145) 2012; 16
L. Ericsson, “More than 50 billion connected devices,”
/
M. C. Yuang, “Survey of protocol verification techniques based on finite state machine models,” in Computer Networking Symposium, 1988., Proceedings of the, pp. 164-172, IEEE, 1988.
N. Accettura, L. Grieco, G. Boggia, and P. Camarda, “Performance analysis of the rpl routing protocol,” in
pp. 423-438, Springer, 1998.
R. Gerth, “A concise language reference for promela,”
G. Mulligan , “The 6lowpan architecture,” in
H. B. Ali, M.R. Karim, M. Ashraf, and D. M. Powers, “Modeling and verification of extensible authentication protocol for transport layer security in wireless lan environment,” in Software Technology and Engineering (ICSTE), 2010 2nd International Conference on, vol. 2, pp. V2-41, IEEE, 2010.
Kusy, Abdelwahed (bib0115) 2006; 6
Holzmann (10.1016/j.procs.2016.07.214_bib0065) 1997; 20
10.1016/j.procs.2016.07.214_bib0015
Bormann (10.1016/j.procs.2016.07.214_bib0145) 2012; 16
10.1016/j.procs.2016.07.214_bib0035
Holzmann (10.1016/j.procs.2016.07.214_bib0070) 1998; 13
10.1016/j.procs.2016.07.214_bib0135
10.1016/j.procs.2016.07.214_bib0150
10.1016/j.procs.2016.07.214_bib0030
10.1016/j.procs.2016.07.214_bib0130
10.1016/j.procs.2016.07.214_bib0010
Bharti (10.1016/j.procs.2016.07.214_bib0040) 2012; 2
10.1016/j.procs.2016.07.214_bib0080
10.1016/j.procs.2016.07.214_bib0060
Palattella (10.1016/j.procs.2016.07.214_bib0120) 2013; 15
Holzmann (10.1016/j.procs.2016.07.214_bib0025) 1997; 23
Larsen (10.1016/j.procs.2016.07.214_bib0050) 1997; 1
Kusy (10.1016/j.procs.2016.07.214_bib0115) 2006; 6
10.1016/j.procs.2016.07.214_bib0125
10.1016/j.procs.2016.07.214_bib0005
10.1016/j.procs.2016.07.214_bib0105
10.1016/j.procs.2016.07.214_bib0045
Javed Kashi (10.1016/j.procs.2016.07.214_bib0095) 2010; 8
Jensen (10.1016/j.procs.2016.07.214_bib0110) 1996; 3
de Vries (10.1016/j.procs.2016.07.214_bib0075) 2000; 2
10.1016/j.procs.2016.07.214_bib0085
10.1016/j.procs.2016.07.214_bib0140
10.1016/j.procs.2016.07.214_bib0020
Islam (10.1016/j.procs.2016.07.214_bib0100) 2006; 3
10.1016/j.procs.2016.07.214_bib0090
Ben-Ari (10.1016/j.procs.2016.07.214_bib0055) 2010; 1
References_xml – volume: 23
  start-page: 279
  year: 1997
  ident: bib0025
  article-title: The model checker spin
  publication-title: IEEE Transactions on software engineering
– reference: //
– reference: , 2011.
– reference: M. Frappier, B. Fraikin, R. Chossart, R. Chane-Yack-Fa, and M. Ouenzar, “Comparison of model checking tools for information systems,” in.
– reference: G. Mulligan , “The 6lowpan architecture,” in
– reference: , 1997.
– reference: L. Ericsson, “More than 50 billion connected devices,”
– volume: 8
  year: 2010
  ident: bib0095
  article-title: Kashi Asifa, “Implementation of spin model checker for formal verification of distance vector routing protocol
  publication-title: (IJCSIS) International Journal of Computer Science and Information Security
– reference: D. Câmara, A.A. Loureiro, and F. Filali, “Formal verification of routing protocols for wireless ad hoc networks,” in
– reference: , pp. 78-82, ACM, 2007.
– reference: , pp. 767-772, IEEE, 2011.
– reference: H. B. Ali, M.R. Karim, M. Ashraf, and D. M. Powers, “Modeling and verification of extensible authentication protocol for transport layer security in wireless lan environment,” in Software Technology and Engineering (ICSTE), 2010 2nd International Conference on, vol. 2, pp. V2-41, IEEE, 2010.
– reference: D. Câmara, A.A. F. Loureiro, and F. Filali, “Methodology for formal verification of routing protocols for ad hoc wireless networks,” in Global Telecommunications Conference, 2007. GLOBECOM’07. IEEE, pp. 705-709, IEEE, 2007.
– reference: N. Accettura, L. Grieco, G. Boggia, and P. Camarda, “Performance analysis of the rpl routing protocol,” in
– reference: , pp. 423-438, Springer, 1998.
– reference: M. C. Yuang, “Survey of protocol verification techniques based on finite state machine models,” in Computer Networking Symposium, 1988., Proceedings of the, pp. 164-172, IEEE, 1988.
– reference: R. Gerth, “A concise language reference for promela,”
– reference: , pp. 581-596, Springer, 2010.
– reference: R. De Renesse and A. Aghvami, “Formal verification of ad-hoc routing protocols using spin model checker,” in Electrotechnical Conference, 2004. MELECON 2004. Proceedings of the 12th IEEE Mediterranean, vol. 3, pp. 1177-1182, IEEE, 2004.
– reference: , pp. 49-54, ACM, 2012.
– volume: 3
  year: 1996
  ident: bib0110
  article-title: Modelling and analysis of a collision avoidance protocol using spin and uppaal
  publication-title: BRICS Report Series
– volume: 1
  start-page: 40
  year: 2010
  end-page: 47
  ident: bib0055
  article-title: A primer on model checking
  publication-title: ACM Inroads
– reference: Z. Shelby, K. Hartke, and C. Bormann, “The constrained application protocol (coap)(rfc 7252),” 2014.
– volume: 16
  start-page: 62
  year: 2012
  ident: bib0145
  article-title: Coap: An application protocol for billions of tiny internet nodes
  publication-title: IEEE Internet Computing
– volume: 13
  start-page: 289
  year: 1998
  end-page: 307
  ident: bib0070
  article-title: An analysis of bitstate hashing
  publication-title: Formal methods in system design
– volume: 2
  start-page: 382
  year: 2000
  end-page: 393
  ident: bib0075
  article-title: On-the-fly conformance testing using spin
  publication-title: International Journal on Software Tools for Technology Transfer
– volume: 20
  start-page: 97
  year: 1997
  end-page: 105
  ident: bib0065
  article-title: Designing bug-free protocols with spin
  publication-title: Computer Communications
– reference: W. Colitti, K. Steenhaut, N. De Caro, B. Buta, and V. Dobrota, “Evaluation of constrained application protocol for wireless sensor networks,” in Local & Metropolitan Area Networks (LANMAN), 2011 18th IEEE Workshop on, pp. 1-6, IEEE, 2011.
– reference: , 1991.
– reference: * G. Montenegro, N. Kushalnagar, J. Hui, and D. Culler, “Rfc 4944,”
– reference: /
– reference: , pp. 189-210, Springer, 2009.
– reference: D. Broman, E.A. Lee, S. Tripakis, and M. Törngren, “Viewpoints, formalisms, languages, and tools for cyber-physical systems,” in
– volume: 6
  start-page: 704
  year: 2006
  ident: bib0115
  publication-title: Ftsp protocol verification using spin ISIS
– reference: , vol. 802, no. 4.
– reference: D. Bošnački and D. Dams, “Integrating real time into spin: A prototype implementation,” in
– reference: G. J. Holzmann, “Design and Validation of Computer Protocols Prentice Hall,”
– reference: T. Winter, P. Thubert, J. Vasseur, et al., “Rpl: Routing protocol for low power and lossy networks, rfc6550,” 2012.
– volume: 2
  year: 2012
  ident: bib0040
  article-title: Survey of network protocol verification techniques
  publication-title: International Journal of Scientific and Research Publications
– volume: 15
  start-page: 1389
  year: 2013
  end-page: 1406
  ident: bib0120
  publication-title: Standardized protocol stack for the internet of (important) things,” Communications Surveys & Tutorials, IEEE
– volume: 1
  start-page: 134
  year: 1997
  end-page: 152
  ident: bib0050
  article-title: Uppaal in a nutshell
  publication-title: International Journal on Software Tools for Technology Transfer (STTT)
– volume: 3
  start-page: 145
  year: 2006
  end-page: 159
  ident: bib0100
  publication-title: Modeling and formal verification of dhcp using spin.,”
– volume: 1
  start-page: 134
  issue: 1
  year: 1997
  ident: 10.1016/j.procs.2016.07.214_bib0050
  article-title: Uppaal in a nutshell
  publication-title: International Journal on Software Tools for Technology Transfer (STTT)
  doi: 10.1007/s100090050010
– volume: 23
  start-page: 279
  issue: 5
  year: 1997
  ident: 10.1016/j.procs.2016.07.214_bib0025
  article-title: The model checker spin
  publication-title: IEEE Transactions on software engineering
  doi: 10.1109/32.588521
– ident: 10.1016/j.procs.2016.07.214_bib0020
– ident: 10.1016/j.procs.2016.07.214_bib0080
  doi: 10.1007/978-0-387-35394-4_26
– ident: 10.1016/j.procs.2016.07.214_bib0085
  doi: 10.1109/GLOCOM.2007.137
– ident: 10.1016/j.procs.2016.07.214_bib0125
– volume: 13
  start-page: 289
  issue: 3
  year: 1998
  ident: 10.1016/j.procs.2016.07.214_bib0070
  article-title: An analysis of bitstate hashing
  publication-title: Formal methods in system design
  doi: 10.1023/A:1008696026254
– ident: 10.1016/j.procs.2016.07.214_bib0140
  doi: 10.17487/rfc7252
– ident: 10.1016/j.procs.2016.07.214_bib0150
  doi: 10.1109/LANMAN.2011.6076934
– ident: 10.1016/j.procs.2016.07.214_bib0010
  doi: 10.1109/ICMECH.2011.5971218
– ident: 10.1016/j.procs.2016.07.214_bib0045
  doi: 10.1145/2508443.2508452
– volume: 3
  issue: 24
  year: 1996
  ident: 10.1016/j.procs.2016.07.214_bib0110
  article-title: Modelling and analysis of a collision avoidance protocol using spin and uppaal
  publication-title: BRICS Report Series
  doi: 10.7146/brics.v3i24.20005
– ident: 10.1016/j.procs.2016.07.214_bib0005
– ident: 10.1016/j.procs.2016.07.214_bib0035
  doi: 10.1109/CNS.1988.4993
– volume: 16
  start-page: 62
  issue: 2
  year: 2012
  ident: 10.1016/j.procs.2016.07.214_bib0145
  article-title: Coap: An application protocol for billions of tiny internet nodes
  publication-title: IEEE Internet Computing
  doi: 10.1109/MIC.2012.29
– ident: 10.1016/j.procs.2016.07.214_bib0135
– volume: 20
  start-page: 97
  issue: 2
  year: 1997
  ident: 10.1016/j.procs.2016.07.214_bib0065
  article-title: Designing bug-free protocols with spin
  publication-title: Computer Communications
  doi: 10.1016/S0140-3664(96)01150-4
– ident: 10.1016/j.procs.2016.07.214_bib0105
– ident: 10.1016/j.procs.2016.07.214_bib0090
  doi: 10.1109/MELCON.2004.1348275
– ident: 10.1016/j.procs.2016.07.214_bib0015
– ident: 10.1016/j.procs.2016.07.214_bib0130
  doi: 10.1145/1278972.1278992
– volume: 2
  start-page: 382
  issue: 4
  year: 2000
  ident: 10.1016/j.procs.2016.07.214_bib0075
  article-title: On-the-fly conformance testing using spin
  publication-title: International Journal on Software Tools for Technology Transfer
  doi: 10.1007/s100090050044
– volume: 6
  start-page: 704
  year: 2006
  ident: 10.1016/j.procs.2016.07.214_bib0115
  publication-title: Ftsp protocol verification using spin ISIS
– ident: 10.1016/j.procs.2016.07.214_bib0060
  doi: 10.1007/978-3-642-16901-4_38
– volume: 15
  start-page: 1389
  issue: 3
  year: 2013
  ident: 10.1016/j.procs.2016.07.214_bib0120
  publication-title: Standardized protocol stack for the internet of (important) things,” Communications Surveys & Tutorials, IEEE
  doi: 10.1109/SURV.2012.111412.00158
– volume: 2
  year: 2012
  ident: 10.1016/j.procs.2016.07.214_bib0040
  article-title: Survey of network protocol verification techniques
  publication-title: International Journal of Scientific and Research Publications
– volume: 3
  start-page: 145
  issue: 2
  year: 2006
  ident: 10.1016/j.procs.2016.07.214_bib0100
  publication-title: Modeling and formal verification of dhcp using spin.,” IJCSA
– volume: 1
  start-page: 40
  issue: 1
  year: 2010
  ident: 10.1016/j.procs.2016.07.214_bib0055
  article-title: A primer on model checking
  publication-title: ACM Inroads
  doi: 10.1145/1721933.1721950
– volume: 8
  issue: 3
  year: 2010
  ident: 10.1016/j.procs.2016.07.214_bib0095
  article-title: Kashi Asifa, “Implementation of spin model checker for formal verification of distance vector routing protocol
  publication-title: (IJCSIS) International Journal of Computer Science and Information Security
– ident: 10.1016/j.procs.2016.07.214_bib0030
  doi: 10.1007/978-1-84800-328-6_8
SSID ssj0000388917
Score 2.091091
Snippet Many of the communication protocols developed for the resource constrained devices are rarely subjected to protocol verification. Design flaws like deadlocks,...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 299
SubjectTerms COAP
IoT
Model checking
Model Verification
PROMELA
SPIN
Title Modelling and Verification of CoAP over Routing Layer Using SPIN Model Checker
URI https://dx.doi.org/10.1016/j.procs.2016.07.214
Volume 93
WOSCitedRecordID wos000383945000041&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1877-0509
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000388917
  issn: 1877-0509
  databaseCode: M~E
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELZayqGX0vJQt6WVD72FoM3T9hEhaA_VCmnpilvkGFsLrLIIQrW99Ld3ZuwsURchqNRLtHHieOX5Mh5PZr5h7EtyboURVse1csM4txL14LmLwTIe5loW0lH62OS7GI3k2Zk6CZ8LbqmcgGgauVio6_8qamgDYWPq7DPEvXwoNMBvEDocQexwfJLgsbqZJ9pGn_gEhnTBL0ehF_ODkwjDNiOMBaIUJ_0LmQjJZzCGTT6VR5tFh1OLERd945WSCgBPFIeOpSCisH52UpvottVXdxg644MlzRTdjPv334tCPPdoHzQWbPSnK1e-RmONfAbhUvBH-ERJ7x5bSZEhjSqFiJFkxi84D7QFNayyvh5VqrckZ0T9sKrtvePhEtcag9TrCRGxpj4r9S8a7TEOimOCAYrk7OIle5UK2E5huOfve78csuMoKtS8_JcdWRWFBa6M9bBB0zNSTt-yN2F3wQ88Kt6xF7bZZBtd5Q4eFPkWGy1BwgEkvA8SPnccQcIRJDyAhBNIOIGEI0g4PYAHkGyzH8dHp4ff4lBZIzZZLtu4BjNQ1CovtClKi6WNrRJJbZMaXk_YU7tElDoTtYRTTPTRwg6FzmyZ5tZkNst22Fozb-x7xpUqUl0a4ZCYr9CpBBNXm1I7V4J6kMmApd30VCbQzmP1k1nVxRdeVjSnFc5pNRQVzOmA7S07XXvWlcdvL7t5rwLwvUFYAVIe6_jhXzt-ZK_xzPvidtlae3NnP7F187O9uL35TIj6Awx0kXA
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Modelling+and+Verification+of+CoAP+over+Routing+Layer+Using+SPIN+Model+Checker&rft.jtitle=Procedia+computer+science&rft.au=Vattakunnel%2C+Anchal+J.&rft.au=Kumar%2C+N.+Suresh&rft.au=Kumar%2C+G+Santhosh&rft.date=2016&rft.pub=Elsevier+B.V&rft.issn=1877-0509&rft.eissn=1877-0509&rft.volume=93&rft.spage=299&rft.epage=308&rft_id=info:doi/10.1016%2Fj.procs.2016.07.214&rft.externalDocID=S1877050916314557
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1877-0509&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1877-0509&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1877-0509&client=summon