Exploring modal worlds

被引:2
作者
Dang, Han-Hing [1 ]
Glueck, Roland [1 ]
Moeller, Bernhard [1 ]
Roocks, Patrick [1 ]
Zelend, Andreas [1 ]
机构
[1] Univ Augsburg, Inst Informat, D-86135 Augsburg, Germany
关键词
Bisimulation; Formal concept analysis; Pareto front; Rectangles; Separation logic; Software product lines;
D O I
10.1016/j.jlap.2014.02.004
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Modal idempotent semirings cover a large set of different applications. The paper presents a small collection of these, ranging from algebraic logics for program correctness over bisimulation refinement, formal concept analysis, database preferences to feature oriented software development. We provide new results and/or views on these domains; the modal semiring setting allows a concise and unified treatment, while being more general than, e.g., standard relation algebra. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码:135 / 153
页数:19
相关论文
共 22 条
  • [1] [Anonymous], 2012, Formal concept analysis: mathematical foundations
  • [2] Batory D., 1992, ACM Transactions on Software Engineering and Methodology, V1, P355, DOI 10.1145/136586.136587
  • [3] Batory D., 2013, CSTR1314 U TEX AUST
  • [4] Local action and abstract separation logic
    Calcagno, Cristiano
    O'Hearn, Peter W.
    Yang, Hongseok
    [J]. 22ND ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2007, : 366 - +
  • [5] Algebraic separation logic
    Dang, H. -H.
    Hoefner, P.
    Moeller, B.
    [J]. JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2011, 80 (06): : 221 - 247
  • [6] Kleene algebra with domain
    Desharnais, Jules
    Moeller, Bernhard
    Struth, Georg
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2006, 7 (04) : 798 - 833
  • [7] Ehm T., 2005, THESIS U AUGSBURG
  • [8] Erne M., ANN NEW YORK ACAD SC, V704, P103
  • [9] Glück R, 2009, LECT NOTES COMPUT SC, V5827, P134, DOI 10.1007/978-3-642-04639-1_10
  • [10] Han-Hing Dang, 2012, Mathematics of Program Construction. Proceedings 11th International Conference, MPC 2012, P177, DOI 10.1007/978-3-642-31113-0_10