Properties of a predicate transformer of the VRS system

Authors:
A. A. Letichevsky;A. B. Godlevsky;A. A. Letychevsky, Jr;S. V. Potiyenko;V. S. Peschanenko
Affiliations:
Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine;Kherson State University, Kherson, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 13
Cited 0

win and sin: predicate transformers for concurrency

ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Practical Decision Procedure for Arithmetic with Function Symbols

Journal of the ACM (JACM)
A Discipline of Programming

A Discipline of Programming
Semantics of Timed Message Sequence Charts

Cybernetics and Systems Analysis
A Model for Interaction of Agents and Environments

WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Action Language Verifier

Proceedings of the 16th IEEE international conference on Automated software engineering
Leveraging UML to deliver correct telecom applications

UML for real
Systems Specification by Basic Protocols

Cybernetics and Systems Analysis
Basic protocols, message sequence charts, and the verification of requirements specifications

Computer Networks: The International Journal of Computer and Telecommunications Networking - Telecommunications and UML languages
Predicate transformers in the context of symbolic modeling of transition systems

Cybernetics and Systems Analysis
Semantics of message sequence charts

SDL'05 Proceedings of the 12th international conference on Model Driven

Quantified Score

Hi-index	0.00

Visualization

Abstract

Models specified in the language of basic protocols are considered. These models are attribute transition systems, and their states are defined by formulas of multisort first-order predicate calculus over system attributes. Attributes of simple numeric and symbolic types, functional types, and queues are allowed. Assignment operators, queue update operators, and arbitrary formulas are used in postconditions of basic protocols. To pass from one state to another, a predicate transformer is constructed as a function of formula transformation. The following main property of the predicate transformer is proved: it calculates the strongest postcondition for symbolic states.