Proving Properties of Multidimensional Recurrences with Application to Regular Parallel Algorithms
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
On Model Checking Synchronised Hardware Circuits
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Threshold and Bounded-Delay Voting in Critical Control Systems
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Formal Design of Distributed Control Systems with Lustre
SAFECOMP '99 Proceedings of the 18th International Conference on Computer Computer Safety, Reliability and Security
Test-Suite Reduction for Model Based Tests: Effects on Test Quality and Implications for Testing
Proceedings of the 19th IEEE international conference on Automated software engineering
Combination Model Checking: Approach and a Case Study
Proceedings of the 19th IEEE international conference on Automated software engineering
On the effect of test-suite reduction on automatically generated model-based tests
Automated Software Engineering
A Case for Specification Validation
Verified Software: Theories, Tools, Experiments
Semantics-preserving implementation of multirate mixed-criticality synchronous programs
Proceedings of the 20th International Conference on Real-Time and Network Systems
| Hi-index | 0.00 |
In this paper, we intend to show how to use the synchronous dataflow language Lustre, combined with the PVS proof system in deriving provably-correct (distributed) control programs. We hopefully illustrate, based on a railway emergency braking system example, the features of our approach - asynchronous periodic programs with nearly the same period, communicating by sampling - equational reasoning which leaves to the Lustre compiler the task of scheduling computations - no distinction between control programs and physical environments which are sampled in the same way. This allows us to provide "elementary" proofs based on difference equations instead of differential ones which require more involved PVS formalization.