The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
The modelling and analysis of security protocols: the csp approach
The modelling and analysis of security protocols: the csp approach
SAT-solving in CSP trace refinement
Science of Computer Programming
An optimization approach for effective formalized fUML model checking
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
The FDR refinement-checking tool, available free for academic purposes. [5] relies fundamentally upon the congruences between operational and denotational semantics for CSP, in order to determine a denotational property by exploring an operationally presented system. But the calculation of the standard structured operational semantics of complex systems proves a bottleneck in the performance of the tool, and so we compile a custom inference system for each case, optimised for facilitating execution of the relevant queries. Recent developments have revealed how these calculations can be re-used in restructuring systems to maximise the potential for hierarchical compression and for export to a related probabilistic formalism.