𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formal derivation of a pattern matching algorithm

✍ Scribed by R.S. Bird; J. Gibbons; G. Jones

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
632 KB
Volume
12
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Derivation of a parallel string matching
Derivation of a parallel string matching algorithm
✍ Jayadev Misra πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 67 KB

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths.

Formal derivation of an algorithm for di
Formal derivation of an algorithm for distributed phase synchronization
✍ D.S. BuhΔƒceanu; W.H.J. Feijen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 620 KB

The main purpose of this paper is to create more evidence for the observation that parallel programs, distributed or not, can be formally -and economically -derived by means of just the predicate calculus and the theory of Owicki and Gries. The example selected here is the problem of phase synchroni

Rete: A fast algorithm for the many patt
Rete: A fast algorithm for the many pattern/many object pattern match problem
✍ Charles L. Forgy πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 982 KB

The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern. The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a f