An approach to software system modelling and analysis

DOI10.1016/0096-0551(79)90009-2MaRDI QIDQ4195931zbMATH OpenOpenAlexFDO

Authors William E. Riddle

Publication date 1979

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(79)90009-2

zbMATH Keywords

ConcurrencyLarge-ScaleParallelismSoftware System AnalysisSoftware System Modelling

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99)

Cited in

(12)

• Extending regular expressions with iterated shuffle
• The power of synchronizing operations on strings
• String shuffle: circuits and graphs
• Unshuffling a square is NP-hard
• Longest Common Subsequence with Gap Constraints
• Subsequences in bounded ranges: matching and analysis problems
• Combinatorial algorithms for subsequence matching: a survey
• Subsequences with generalised gap constraints: upper and lower complexity bounds
• The n-ary initial literal and literal shuffle
• Longest common subsequence with gap constraints
• Subsequence matching and analysis problems for formal languages
• Linear time subsequence and supersequence regex matching

This page was built for publication: An approach to software system modelling and analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4195931)