Detecting races in relay ladder logic programs (Q1856156)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Detecting races in relay ladder logic programs |
scientific article; zbMATH DE number 1862272
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Detecting races in relay ladder logic programs |
scientific article; zbMATH DE number 1862272 |
Statements
Detecting races in relay ladder logic programs (English)
0 references
2000
0 references
Relay Ladder Logic (RLL) is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. The cost of bugs in RLL programs is extremely high, often measured in millions of dollars (for shutting down a factory) or human safety (for rides). In the paper, we describe our experience in applying constraint-based program analysis techniques to analyze production RLL programs. Our approach is an interesting combination of probabilistic testing and program analysis, and we show that our system is able to detect bugs with high probability, up to the approximations made by the conservative program analysis. We demonstrate that our analysis is useful in detecting some flaws in production RLL programs that are difficult to find by other techniques.
0 references
constraints
0 references
software
0 references
static analysis
0 references
testing
0 references
verification
0 references