Specification and Verification of Communication Protocols in AFFIRM Using State Transition Models

Extending statecharts with temporal logic

“…For reactive systems, a number of approaches to decomposition and specification have been proposed. Many of these methods are based on states and events to describe dynamic behavior, with finite state machines (FSMs) as the underlying formalism [5], [6], [7], [8], [9], [10], [11]. This approach has several drawbacks, such as exponential growth in the number of states and lack of a structured representation.…”

Trace specifications: methodology and models

“…Second, we see no way to extend the algebraic method to specify interprocess communication. While published research describes algebraic specification of communications protocols [22], this work makes heavy use of explicit state variables and so is not algebraic in the standard sense. However, traces extend naturally to handle interprocess communication [13, 141.…”

Síntesis de protocolos de comunicación a partir de especificaciones de servicio

“…Se han realizado ya algunos sistemas de verificación automática basados en tipos de datos abstractos, como es el caso de Affirm [Sun82], sistema que consta de un lenguaje de especificación basado en tipos de datos abstractos, una condición de verificación y un probador de teoremas interactivo que permite demostrar propiedades de las especificaciones.…”