Output details
11 - Computer Science and Informatics
University of Sheffield
Return to search
Output 0 of 0 in the submission
Article title
Algebraic Notions of Termination
Type
D - Journal article
Title of journal
Logical Methods in Computer Science
Article number
1
Volume number
7
Issue number
1
First page of article
-
ISSN of journal
18605974
Year of publication
2011
Number of additional authors
2
Additional information
<10> This international collaboration initiates a new algebraic approach to modular termination conditions for programs and software systems. It uses extensions of Kleene algebras, which are fundamental mathematical structures for program analysis and verification. It generalises termination analysis techniques that are used, e.g., by Microsoft for device driver verification (Terminator). The results have been elaborated in three successor journal papers (2 JLAP, 1 ENTCS) and several successor conference publications, including work on non-termination analysis and implementations in theorem proving environments. Its different versions (journal, preprint and conference) have 29 GoogleScholar citations.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
6
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
