Internal axioms for domain semirings

New axioms for domain operations on semirings and Kleene algebras are proposed. They generalise the relational notion of domain-the set of all states that are related to some other state-to a wide range of models. They are internal since the algebras of state spaces are induced by the domain axioms. They are simpler and conceptually more appealing than previous two-sorted external approaches in which the domain algebra is determined through typing. They lead to a simple and natural algebraic approach to modal logics based on equational reasoning. The axiomatisations have been developed in a new style of computer-enhanced mathematics by automated theorem proving, and the approach itself is suitable for automated systems analysis and verification. This is demonstrated by a fully automated proof of a modal correspondence result for Lob's formula that has applications in termination analysis.

[1]  J. W. Degen,et al.  Towards intuitionistic dynamic logic , 2007 .

[2]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[3]  Patrick Maier Intuitionistic LTL and a New Characterization of Safety and Liveness , 2004, CSL.

[4]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[5]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[6]  Georg Struth,et al.  Automated verification of refinement laws , 2009, Annals of Mathematics and Artificial Intelligence.

[7]  Georg Struth,et al.  Kleene algebra with domain , 2003, TOCL.

[8]  Georg Struth,et al.  The Structure of the One-Generated Free Domain Semiring , 2008, RelMiCS.

[9]  Zoltán Ésik,et al.  A semiring-semimodule generalization of ω-context-free languages , 2004 .

[10]  Georg Struth,et al.  Domain Axioms for a Family of Near-Semirings , 2008, AMAST.

[11]  Georg Struth,et al.  Algebras of modal operators and partial correctness , 2006, Theor. Comput. Sci..

[12]  Mai Gehrke,et al.  Bounded distributive lattice expansions , 2004 .

[13]  Georg Struth,et al.  Modal Tools for Separation and Refinement , 2008, Refine@FM.

[14]  Georg Struth,et al.  Termination in Modal Kleene Algebra , 2004, IFIP TCS.

[15]  Georg Struth,et al.  Modal Semirings Revisited , 2008, MPC.

[16]  Dexter Kozen A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[17]  Viorica Sofronie-Stokkermans,et al.  Automated theorem proving by resolution in non-classical logics , 2007, Annals of Mathematics and Artificial Intelligence.

[18]  Burghard von Karger,et al.  Temporal algebra , 1998, Mathematical Structures in Computer Science.

[19]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[20]  Geoff Sutcliffe,et al.  The CADE-19 ATP System Competition , 2004, AI Commun..

[21]  Georg Struth,et al.  Automated Reasoning in Kleene Algebra , 2007, CADE.

[22]  Hans Leiß,et al.  Kleene modules and linear languages , 2006, J. Log. Algebraic Methods Program..