Section: New Results
Formalizing operational semantic specifications in logic
Participant : Dale Miller.
An important application area for some of the proof theory results of the team is in reasoning about the operational semantics of programs and specifications. Miller provided a survey of various approaches to encoding such semantic specifications in the survey article  . Miller and the former team member Alwen Tiu recent submitted a paper  that provides, in their opinion, the definitive treatment of the (finite) -calculus within the -tree syntax approach to encoding. In that paper, the syntax and transition semantics for the -calculus are presented as simple logic programs. Using those specifications, they developed the notions of open and late bisimulation. All of these specifications were declarative and without side conditions. A result of maintaining a high-level of declarativeness in these specifications, it was possible to describe a novel characterization of the differences between open and late bisimulations. Full adequacy results were provided, there by showing a precise match between the “standard” techniques for the specification of the -calculus and the more abstract, proof-theoretically inspired approach based on -trees syntax.