win and sin: predicate transformers for concurrency
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Practical Decision Procedure for Arithmetic with Function Symbols
Journal of the ACM (JACM)
An axiomatic basis for computer programming
Communications of the ACM
A Model for Interaction of Agents and Environments
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Systems Specification by Basic Protocols
Cybernetics and Systems Analysis
Properties of a predicate transformer of the VRS system
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
In modelling attribute transition systems, classes of their states can be described in a given signature of functional and predicate symbols. A procedure is developed for transforming such formulas by assignment operators and the obtained formulas are proved to correspond to strongest postconditions. A peculiarity of this paper is that functional-type attributes can be used in specifying transition systems, in particular, their array-type attributes.