Representing and Reasoning with Operational Semantics

@incollection{citeulike:2254011, abstract = {The operational semantics of programming and specification languages is often presented via inference rules and these can generally be mapped into logic programming-like clauses. Such logical encodings of operational semantics can be surprisingly declarative if one uses logics that directly account for term-level bindings and for resources, such as are found in linear logic. Traditional theorem proving techniques, such as unification and backtracking search, can then be applied to animate operational semantic specifications. Of course, one wishes to go a step further than animation: using logic to encode computation should facilitate formal reasoning directly with semantic specifications. We outline an approach to reasoning about logic specifications that involves viewing logic specifications as theories in an object-logic and then using a meta-logic to reason about properties of those object-logic theories. We motivate the principal design goals of a particular meta-logic that has been built for that purpose.}, author = {Miller, Dale }, citeulike-article-id = {2254011}, doi = {10.1007/11814771\_3}, journal = {Automated Reasoning}, keywords = {proving, theorem}, pages = {4--20}, posted-at = {2008-01-18 21:08:19}, priority = {0}, title = {Representing and Reasoning with Operational Semantics}, url = {http://dx.doi.org/10.1007/11814771\_3}, year = {2006} }

TY - CHAP ID - citeulike:2254011 L3 - citeulike-article-id:2254011 TI - Representing and Reasoning with Operational Semantics JF - Automated Reasoning SP - 4 EP - 20 N2 - The operational semantics of programming and specification languages is often presented via inference rules and these can generally be mapped into logic programming-like clauses. Such logical encodings of operational semantics can be surprisingly declarative if one uses logics that directly account for term-level bindings and for resources, such as are found in linear logic. Traditional theorem proving techniques, such as unification and backtracking search, can then be applied to animate operational semantic specifications. Of course, one wishes to go a step further than animation: using logic to encode computation should facilitate formal reasoning directly with semantic specifications. We outline an approach to reasoning about logic specifications that involves viewing logic specifications as theories in an object-logic and then using a meta-logic to reason about properties of those object-logic theories. We motivate the principal design goals of a particular meta-logic that has been built for that purpose. KW - proving KW - theorem AU - Miller, Dale PY - 2006/// UR - http://dx.doi.org/10.1007/11814771_3 ER -