Process algebra
Structured operational semantics and bisimulation as a congruence
Information and Computation
The meaning of negative premises in transition system specifications
Journal of the ACM (JACM)
Finite axiom systems for testing preorder and De Simone process languages
Theoretical Computer Science
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Axiomatizing GSOS with Termination
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Axiomatisations of Weak Equivalences for De Simone Languages
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Congruence for structural congruences
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
When developing a new language with semantics described by Structural Operational Semantics (SOS), one often wants an axiomatisation of this language (w.r.t. to some equivalence) as well. We describe a method for automating the straightforward soundness proofs for the axioms of such an axiomatisation.