Output details
11 - Computer Science and Informatics
Swansea University
Return to search
Output 0 of 0 in the submission
Output title
Robustness of equations under operational extensions
Type
E - Conference contribution
Name of conference/published proceedings
Electronic Proceedings in Theoretical Computer Science
Volume number
41
Issue number
-
First page of article
106
ISSN of proceedings
2075-2180
Year of publication
2010
URL
-
Number of additional authors
2
Additional information
<10> Highly significant reference for the success of the £1.5M EPSRC PLanCompS project proposal (EP/I032495/1). Shows that by using a particular kind of bisimulation that supports open-world reasoning, algebraic behavioural properties of individual programming constructs can be proved independently, with proofs remaining sound when constructs are combined. It was previously thought that such robustness was impossible. The results are extended to specifications with negative premises in our CONCUR article with Mousavi (LNCS 8052(2013)46-60).
Interdisciplinary
-
Cross-referral requested
-
Research group
A - Theoretical Computer Science
Citation count
-
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
