Proving Equality of Streams Automatically
暂无分享,去创建一个
[1] Hans Zantema,et al. Proving Productivity in Infinite Data Structures , 2010, RTA.
[2] Hans Zantema. Well-Definedness of Streams by Termination , 2009, RTA.
[3] Jos C. M. Baeten,et al. Process Algebra: Equational Theories of Communicating Processes , 2009 .
[4] Grigore Rosu,et al. Circular Coinduction: A Proof Theoretical Foundation , 2009, CALCO.
[5] Jiho Kim,et al. Coinductive Properties of Causal Maps , 2008, AMAST.
[6] Grigore Rosu,et al. Automating Coinduction with Case Analysis , 2010, ICFEM.
[7] Jeffrey Shallit,et al. Automatic Sequences: Theory, Applications, Generalizations , 2003 .
[8] Grigore Rosu,et al. Circular Coinduction with Special Contexts , 2009, ICFEM.
[9] Grigore Rosu,et al. Conditional Circular Coinductive Rewriting with Case Analysis , 2002, WADT.
[10] Grigore Rosu,et al. CIRC : A Circular Coinductive Prover , 2007, CALCO.
[11] Jörg Endrullis,et al. Data-Oblivious Stream Productivity , 2008, LPAR.
[12] Grigore Rosu,et al. Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.