An approach to software system modelling and analysis

Riddle, William E.

doi:10.1016/0096-0551(79)90009-2

Cited by 19 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They introduced flow expressions, which allow for sequential operators (catenation and iterated catenation) as well as for parallel operators (shuffle and iterated shuffle). See also [26,27] for an approach using only the ordinary shuffle, but not the iterated shuffle. Starting from this, various subclasses of the flow expressions were investigated [4,6,15,16,17,18,19,31].…”

Section: The Shuffle Operation In Formal Language Theorymentioning

confidence: 99%

The n-ary Initial Literal and Literal Shuffle

Hoffmann

2021

Preprint

View full text Add to dashboard Cite

The literal and the initial literal shuffle have been introduced to model the behavior of two synchronized processes. However, it is not possible to describe the synchronization of multiple processes. Furthermore, both restricted forms of shuffling are not associative. Here, we extend the literal shuffle and the initial literal shuffle to multiple arguments. We also introduce iterated versions, much different from the iterated ones previously introduced for the binary literal and initial literal shuffle. We investigate formal properties, and show that in terms of expressive power, in a full trio, they coincide with the general shuffle. Furthermore, we look at closure properties with respect to the regular, context-free, context-sensitive, recursive and recursively enumerable languages for all operations introduced. Then, we investigate various decision problems motivated by analogous problems for the (ordinary) shuffle operation. Most problems we look at are tractable, but we also identify one intractable decision problem.

show abstract

Section: The Shuffle Operation In Formal Language Theorymentioning

confidence: 99%

The n-ary Initial Literal and Literal Shuffle

Hoffmann

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Firstly, an automaton is built that represents the set of symbolic traces under the SC memory model. For SC memory model such an automaton is obtained by language level shuffle operation [26,17] on individual processes. Subsequently, a symbolic trace is picked from this automaton and checked against a given safety property using weakest precondition axioms [15].…”

Section: Trace Partitioning Approachmentioning

confidence: 99%

Efficient Verification of Concurrent Programs Over TSO Memory Model

Narayan,

Sharma,

Arun-Kumar

2016

Preprint

View full text Add to dashboard Cite

We address the problem of efficient verification of multithreaded programs running over Total Store Order (TSO) memory model. It has been shown that even with finite data domain programs, the complexity of control state reachability under TSO is non-primitive recursive. In this paper, we first present a bounded-buffer verification approach wherein a bound on the size of buffers is placed; verification is performed incrementally by increasing the size of the buffer with each iteration of the verification procedure until the said bound is reached. For programs operating on finite data domains, we also demonstrate the existence of a buffer bound k such that if the program is safe under that bound, then it is also safe for unbounded buffers. We have implemented this technique in a tool ProofTraPar. Our results against memorax [2], a state-of-the-art sound and complete verifier for TSO memory model, have been encouraging.

show abstract

“…This formalism, described in detail in [35], was originally developed for studying distributed systems with dynamic structure [33]. It evolved from the PPML formalism [31] that served as the foundation for the DREAM software development system [30,341. One component of DPMS is a modeling language, called DYMOL, that can be used to formulate precise, high-level, procedural descriptions of constituent processes in a distributed system [35].…”

Section: Framework For a Design Notationmentioning

confidence: 99%

Describing and analyzing distributed software system designs

Avrunin

Wileden

1985

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

In this paper we outline an approach to describing and analyzing designs for distributed software systems. A descriptive notation is introduced, and analysis techniques applicable to designs expressed in that notation are presented. The usefulness of the approach is illustrated by applying it to a realistic distributed software-system design problem involving mutual exclusion in a computer network.

show abstract

An approach to software system modelling and analysis

Cited by 19 publications

References 10 publications

The n-ary Initial Literal and Literal Shuffle

The n-ary Initial Literal and Literal Shuffle

Efficient Verification of Concurrent Programs Over TSO Memory Model

Describing and analyzing distributed software system designs

Contact Info

Product

Resources

About