Proving correctness of timed concurrent constraint programs
From MaRDI portal
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(15)- Formal reasoning about actor programs using temporal logic
- A general proof system for modalities in concurrent constraint programming
- Coinduction in concurrent timed systems
- Labeled calculi applied to verification and analysis of time-concerned programs. I
- Abstract diagnosis for timed concurrent constraint programs
- Proving Failure-Free Properties of Concurrent Systems Using Temporal Logic
- Concurrent and reactive constraint programming
- Declarative Diagnosis of Temporal Concurrent Constraint Programs
- A stuttering closed temporal logic for modular reasoning about concurrent programs
- Proving correctness of constraint logic programs with dynamic scheduling
- Proving correctness of timed concurrent constraint programs
- Proving concurrent constraint programming correct, revisited
- TCC, with history
- Proving sequential function chart programs using timed automata
- Generalizing logical execution time
This page was built for publication: Proving correctness of timed concurrent constraint programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738216)