Internal axioms for domain semirings

Science of Computer Programming

Volumn 76, Issue 3, 2011, Pages 181-203

  Desharnais, Jules ^a   Struth, Georg ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Algebra of domain elements; Antidomain operator; Automated theorem proving; Boolean algebra; Codomain operator; Distributive lattice; Domain operator; Heyting algebra; Kleene algebra; Lb's formula; Modal semiring; Semiring

Indexed keywords

ANTIDOMAIN OPERATOR; AUTOMATED THEOREM PROVING; CODOMAIN OPERATOR; DISTRIBUTIVE LATTICE; DOMAIN ELEMENTS; DOMAIN OPERATOR; HEYTING ALGEBRAS; KLEENE ALGEBRAS; LB'S FORMULA; SEMI-RING;

AUTOMATION; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SYSTEMS ANALYSIS; THEOREM PROVING;

BOOLEAN ALGEBRA;

EID: 78751573011     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2010.05.007     Document Type: Conference Paper

References (27)

1. G. Birkhoff Lattice Theory Colloquium Publications vol. 25 1984 American Mathematical Society reprint
2. J.W. Blok, and D. Pigozzi Algebraizable logics Memoirs of the American Mathematical Society 77 396 1989
3. W. Degen, and J.M. Werner Towards intuitionistic dynamic logic Proceedings of Studia Logica 2006 Logic and Logical Philosophy vol. 15 2007 Nicolaus Copernicus University Press 305 324
4. J. Desharnais, B. Mller, and G. Struth Termination in modal Kleene algebra J.-J. Lvy, E.W. Mayr, J.C. Mitchell, IFIP TCS2004 2004 Kluwer 647 660 revised version: Algebraic Notions of Termination, Technical Report 200623, Institut fr Informatik, Universitt Augsburg, 2006
5. J. Desharnais, B. Mller, and G. Struth Kleene algebra with domain ACM Transactions on Computational Logic 7 4 2006 798 833
6. J. Desharnais, and G. Struth Domain axioms for a family of near-semirings J. Meseguer, G. Rou, Algebraic Methodology and Software Technology, 12th International Conference (AMAST 2008) Lect. Notes in Comp. Sci. vol. 5140 2008 Springer 330 345
7. J. Desharnais, and G. Struth Modal semirings revisited P. Audebaud, C. Paulin-Mohring, Mathematics of Program Construction, 9th International Conference MPC 2008 Lect. Notes in Comp. Sci. vol. 5133 2008 Springer 360 387
8. Z. sik, and W. Kuich A semiring-semimodule generalization of ω-context-free languages J. Karhumki, H. Maurer, G. Pun, G. Rozenberg, Theory is Forever Lect. Notes in Comp. Sci. vol. 3113 2004 Springer 68 80
9. J. Gunawardena, Idempotency 1998 Cambridge University Press
10. T. Hillenbrand, Waldmeister, http://www.waldmeister.org.
11. P. Hfner, and G. Struth Automated reasoning in Kleene algebra P. Pfenning, Automated DeductionCADE-21 Lect. Notes in Art. Intelligence vol. 4603 2007 Springer 279 294
12. P. Hfner, G. Struth, and G. Sutcliffe Automated verification of refinement laws Annals of Mathematics and Artificial Intelligence 55 12 2009 35 62
13. P. Jipsen, and G. Struth The structure of the one-generated free domain semiring R. Berghammer, B. Mller, G. Struth, Relations and Kleene Algebras in Computer Science LNCS vol. 4988 2008 Springer 234 242
14. P.J. Johnstone Stone Spaces 1982 Cambridge University Press
15. B. Jnsson, and A. Tarski Boolean algebras with operators, Part I American Journal of Mathematics 73 1951 891 939
16. D. Kozen A completeness theorem for Kleene algebras and the algebra of regular events Information and Computation 110 2 1994 366 390
17. D. Kozen Kleene algebra with tests ACM Transactions on Programming Languages and Systems 19 3 1997 427 443
18. H. Leiß Kleene modules and linear languages Journal of Logic and Algebraic Programming 66 2 2006 185 194
19. P. Maier Intuitionistic LTL and a new characterization of safety and liveness A. Tarlecki, J. Marcinkowski, Computer Science Logic, 18th International Workshop Lect. Notes in Comp. Sci. vol. 3210 2004 Springer 295 309
20. W. McCune, Prover9 and Mace4, http://www.cs.unm.edu/~mccune/prover9.
21. B. Mller, and G. Struth Algebras of modal operators and partial correctness Theoretical Computer Science 351 2 2006 221 239
22. V. Sofronie-Stokkermans Automated theorem proving by resolution in non-classical logics Annals of Mathematics and Artificial Intelligence 49 2007 221 252
23. G. Struth, Proof database, http://www.dcs.shef.ac.uk/georg/ka.
24. G. Struth Modal tools for separation and refinement Electronic Notes in Theoretical Computer Science 214 2008 81 101
25. G. Sutcliffe, C. Suttner, The CADE ATP system competition, www.cs.miami.edu/~tptp/CASC/.
26. G. Sutcliffe, C. Suttner, The TPTP problem library for automated theorem proving, www.tptp.org.
27. J. von Wright Towards a refinement algebra Science of Computer Programming 51 12 2004 23 45