On implementing behavioral rewriting
Proceedings of the 2002 ACM SIGPLAN workshop on Rule-based programming
Observational proofs by rewriting
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
Web-Based Support for Cooperative Software Engineering
Annals of Software Engineering
Complete Categorical Equational Deduction
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Behavioral abstraction is hiding information
Theoretical Computer Science - Selected papers of CMCS'03
Formal design and verification of operational transformation algorithms for copies convergence
Theoretical Computer Science - Algebraic methodology and software technology
Regular Strategies as Proof Tactics for CIRC
Electronic Notes in Theoretical Computer Science (ENTCS)
Sheaves, Objects, and Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Well-Definedness of Streams by Termination
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Information Sciences: an International Journal
Communicating Concurrent Objects in HiddenCCS
Electronic Notes in Theoretical Computer Science (ENTCS)
IWSAS'01 Proceedings of the 2nd international conference on Self-adaptive software: applications
CIRC: a circular coinductive prover
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Circular coinduction: a proof theoretical foundation
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Automating coinduction with case analysis
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A decision procedure for bisimilarity of generalized regular expressions
SBMF'10 Proceedings of the 13th Brazilian conference on Formal methods: foundations and applications
Incremental pattern-based coinduction for process algebra and its isabelle formalization
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Circular coinduction in coq using bisimulation-up-to techniques
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Hi-index | 0.00 |
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers ...