Abstract | ||
---|---|---|
The language Csp-Casl combines specifications of data and processes. We give an institution based semantics to Csp-Casl that allows us to re-use the institution independent structuring mechanisms of Casl. Furthermore, we extend Csp-Casl with a notion of refinement that reconciles the differing philosophies behind the refinement notions for Csp and Casl. We develop a compositional proof calculus for refinement along the Casl structuring mechanisms, and demonstrate that compositional proof techniques along parallel process composition from the context of Csp lifts to structured Csp-Casl specifications. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-28412-0_16 | WADT |
Keywords | Field | DocType |
refinement notion,institution independent structuring mechanism,compositional proof calculus,language csp-casl,parallel process composition,structured csp-casl specification,casl structuring mechanism,compositional modelling,compositional proof technique | Programming language,Parallel process,Computer science,Proof calculus,Algorithm,Theoretical computer science,TRACE (psycholinguistics),Proof obligation,Structuring,Amalgamation property,Semantics | Conference |
Citations | PageRank | References |
4 | 0.50 | 13 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Liam O'Reilly | 1 | 8 | 2.32 |
Till Mossakowski | 2 | 1052 | 90.11 |
Markus Roggenbach | 3 | 294 | 32.63 |