Author:
Goriac Eugen-Ioan,Lucanu Dorel,Roşu Grigore
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Bouhoula, A., Rusinowitch, M.: Automatic case analysis in proof by induction. In: IJCAI, pp. 88–94. Morgan Kaufmann Publishers Inc., San Francisco (1993)
2. Bouhoula, A., Rusinowitch, M.: Observational proofs by rewriting. Theor. Comput. Sci. 275(1-2), 675–698 (2002)
3. Dijkstra, E.W.: Guarded commands, non-determinacy and formal derivation of programs. Commun. ACM 18(8), 453–457 (1975)
4. Goguen, J., Lin, K., Roşu, G.: Circular coinductive rewriting. In: ASE 2000: Proceedings of the 15th IEEE International Conference on Automated Software Engineering, pp. 123–132. IEEE, Washington (2000)
5. Lecture Notes in Computer Science;J. Goguen,2003
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A short overview of Hidden Logic;Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science;2018
2. Behavioral equivalence of hidden k-logics: An abstract algebraic approach;Journal of Applied Logic;2016-07
3. On Automation of OTS/CafeOBJ Method;Specification, Algebra, and Software;2014
4. Automatic equivalence proofs for non-deterministic coalgebras;Science of Computer Programming;2013-09
5. Rewriting logic bibliography by topic: 1990–2011;The Journal of Logic and Algebraic Programming;2012-10