Domain axioms for a family of near-semirings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5140 LNCS, Issue , 2008, Pages 330-345

  Desharnais, Jules ^a   Struth, Georg ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER NETWORKS; MATRIX ALGEBRA; TECHNOLOGY;

ACTION SYSTEMS; INTERNATIONAL CONFERENCES; SOFTWARE TECHNOLOGIES;

THEOREM PROVING;

EID: 51049110767     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79980-1_25     Document Type: Conference Paper

References (16)

1. http://www.dcs.shef.ac.uk/~georg/ka
2. Provei9 and Mace4. http://www.cs.unm.edu/~mccune/prover9
3. Back, R.J.R., von Wright. J.: Reasoning algebraically about loops. Acta Informatica 36(4), 295-334 (1999)
4. Bergstra. J.A., Fokkink, W.J., Ponse, A.: Process algebra with recursive operations. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 333-389. Elsevier, Amsterdam (2001)
5. Desharnais, J., Möller, B., Struth, G.: Kleene algebra with domain. ACM TOCL 7(4), 798-833 (2006)
6. Desharnais, J., Struth, G.: Domain semirings revisited. Technical Report CS-08-01, Department of Computer Science, University of Sheffield (2008); Accepted for Mathematics of Program Construction (MPC) (2008)
7. Furusawa, H., Tsumagari. N., Nishizawa, K.: A non-probabilistic model of probabilistic Kleene algebra. In: Berghammer, R., Möller, B., Struth, G. (eds.) Relations and Kleene Algebra in Computer Science. LNCS, vol. 4988, pp. 110-122. Springer, Heidelberg (2008)
8. Goranko, V.: The basic algebra of game equivalences. Studia Logica 75. 221-238 (2003)
9. Höfner, P., Struth, G.: Can refinement be automated? ENTCS 201, 197-222 (2007)
10. Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM TOCL 1(1), 60-76 (2000)
11. McIver, A.K., Gonzalia, C., Cohen, E., Morgan, C.C.: Using probabilistic Kleene algebra pKA for protocol verification. J. Logic and Algebraic Programming 76(1), 90-111 (2008)
12. Meinicke, L., Solin, K.: Refinement algebra for probabilistic programs. ENTCS 201, 177-195 (2007)
13. Möller, B.: Kleene getting lazy. Sc. Computer Programming 65(2), 195-214 (2007)
14. Pilz, G.: Near-Rings: The Theory and Its Application. North-Holland, Amsterdam (1983)
15. Solin, K., von Wright, J.: Refinement algebra with operators for enabledness and termination. In: Uustalu, T. (ed.) MPC 2006. LNCS, vol. 4014, pp. 397-415. Springer, Heidelberg (2006)
16. von Wright, J.: Towards a refinement algebra. Sc. Computer Programming 51(1-2), 23-45 (2004)