| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424150 | Electronic Notes in Theoretical Computer Science | 2009 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
