2014
DOI: 10.1007/978-3-319-05032-4_19
|View full text |Cite
|
Sign up to set email alerts
|

Verification of Solid State Interlocking Programs

Abstract: We report on the inclusion of a formal method into an industrial design process. Concretely, we suggest carrying out a verification step in railway interlocking design between programming the interlocking and testing this program. Safety still relies on testing, but the burden of guaranteeing completeness and correctness of the validation is in this way greatly reduced. We present a complete methodology for carrying out this verification step in the case of ladder logic programs and give results for real world… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 25 publications
(21 citation statements)
references
References 12 publications
(15 reference statements)
0
21
0
Order By: Relevance
“…This suggests that the details of object placement at one station seldom influence the object placements at another station. Such locality of properties has been earlier exploited by other railway verification approaches, e.g., [23] or [4]. Bonacchi et al [4], in particular use locality to split model checking problems into smaller pieces, and using topology data to optimize variable ordering in BDD-based verification.…”
Section: Incremental Verificationmentioning
confidence: 99%
“…This suggests that the details of object placement at one station seldom influence the object placements at another station. Such locality of properties has been earlier exploited by other railway verification approaches, e.g., [23] or [4]. Bonacchi et al [4], in particular use locality to split model checking problems into smaller pieces, and using topology data to optimize variable ordering in BDD-based verification.…”
Section: Incremental Verificationmentioning
confidence: 99%
“…This principle has been exploited in [22] to define domain-oriented optimisation of the variable ordering in a BDD-based verification. Locality can be used also for slicing, as suggested in [3,9,8,1]: the idea is to consider only the portion of the model that has influence on the property to be verified, by a topological selection of interested track elements (therefore closely related to the cone of influence of the property): this allows for a much more efficient verification of the single property, but comes at the price of repeating the slicing and the verification for every property, and of separately checking that verifying slices does actually imply the satisfaction of desired properties for the whole system. Nevertheless, it appears that when automated, this process can offer significant time and memory savings.…”
Section: Compositionalitymentioning
confidence: 99%
“…Locality can be used also for slicing, as suggested in (17) and (25). The idea is to consider only the portion of the model that has influence on the property to be verified, by a topological selection of interested track elements: this allows for a much more efficient verification, at the price of repeating the verification activity for each extracted slice and of showing that verifying slices does implies the satisfaction of desired properties for the whole system.…”
Section: Environment Assumptions and Slicingmentioning
confidence: 99%