Home > Research > Publications & Outputs > Modular composition of redundancy management pr...

Links

View graph of relations

Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification & verification

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Published

Standard

Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification & verification. / Sinha, P.; Suri, Neeraj.
2001. 255-263 Paper presented at 21st International Conference on Distributed Computing Systems, Washington, District of Columbia, United States.

Research output: Contribution to conference - Without ISBN/ISSN Conference paperpeer-review

Harvard

Sinha, P & Suri, N 2001, 'Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification & verification', Paper presented at 21st International Conference on Distributed Computing Systems, Washington, United States, 16/04/01 - 19/04/01 pp. 255-263. <https://dl.acm.org/citation.cfm?id=879300>

APA

Sinha, P., & Suri, N. (2001). Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification & verification. 255-263. Paper presented at 21st International Conference on Distributed Computing Systems, Washington, District of Columbia, United States. https://dl.acm.org/citation.cfm?id=879300

Vancouver

Sinha P, Suri N. Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification & verification. 2001. Paper presented at 21st International Conference on Distributed Computing Systems, Washington, District of Columbia, United States.

Author

Sinha, P. ; Suri, Neeraj. / Modular composition of redundancy management protocols in distributed systems : An outlook on simplifying protocol level formal specification & verification. Paper presented at 21st International Conference on Distributed Computing Systems, Washington, District of Columbia, United States.9 p.

Bibtex

@conference{bea8b8019bda495481f000dd4c5d66b1,
title = "Modular composition of redundancy management protocols in distributed systems: An outlook on simplifying protocol level formal specification & verification",
abstract = "In recent years, formal methods (FMs) have been extensively used for verification and validation (V&V) of dependable distributed protocols. Over our studies in utilizing FMs for V&V, we have observed that a number of protocols providing for distributed and dependable services can often be formulated using a small set of basic functional primitives or their variations. Thus, from the formal viewpoint, the objective of this paper is to introduce techniques, utilizing concepts of category theory, that could effectively identify and reuse basic formal modules in order to simplify formal specification and verification for a spectrum of protocols.",
keywords = "Computer software, Data communication systems, Formal logic, Interfaces (computer), Large scale systems, Network protocols, Telecommunication services, Formal methods, Formal validation, Formal verification, Redundancy management protocol, Distributed computer systems",
author = "P. Sinha and Neeraj Suri",
year = "2001",
month = apr,
day = "16",
language = "English",
pages = "255--263",
note = "21st International Conference on Distributed Computing Systems ; Conference date: 16-04-2001 Through 19-04-2001",

}

RIS

TY - CONF

T1 - Modular composition of redundancy management protocols in distributed systems

T2 - 21st International Conference on Distributed Computing Systems

AU - Sinha, P.

AU - Suri, Neeraj

PY - 2001/4/16

Y1 - 2001/4/16

N2 - In recent years, formal methods (FMs) have been extensively used for verification and validation (V&V) of dependable distributed protocols. Over our studies in utilizing FMs for V&V, we have observed that a number of protocols providing for distributed and dependable services can often be formulated using a small set of basic functional primitives or their variations. Thus, from the formal viewpoint, the objective of this paper is to introduce techniques, utilizing concepts of category theory, that could effectively identify and reuse basic formal modules in order to simplify formal specification and verification for a spectrum of protocols.

AB - In recent years, formal methods (FMs) have been extensively used for verification and validation (V&V) of dependable distributed protocols. Over our studies in utilizing FMs for V&V, we have observed that a number of protocols providing for distributed and dependable services can often be formulated using a small set of basic functional primitives or their variations. Thus, from the formal viewpoint, the objective of this paper is to introduce techniques, utilizing concepts of category theory, that could effectively identify and reuse basic formal modules in order to simplify formal specification and verification for a spectrum of protocols.

KW - Computer software

KW - Data communication systems

KW - Formal logic

KW - Interfaces (computer)

KW - Large scale systems

KW - Network protocols

KW - Telecommunication services

KW - Formal methods

KW - Formal validation

KW - Formal verification

KW - Redundancy management protocol

KW - Distributed computer systems

M3 - Conference paper

SP - 255

EP - 263

Y2 - 16 April 2001 through 19 April 2001

ER -