Formal Component-Based Semantics

@inproceedings{Madlener2011FormalCS,
  title={Formal Component-Based Semantics},
  author={Ken Madlener and Sjaak Smetsers and Marko C. J. D. van Eekelen},
  booktitle={SOS},
  year={2011}
}
One of the proposed solutions for improving the scalability of semantics of programming languages is Component-Based Semantics, introduced by Peter D. Mosses. It is expected that this framework can also be used effectively for modular meta theoretic reasoning. This paper presents a formalization of Component-Based Semantics in the theorem prover COQ. It is based on Modular SOS, a variant of SOS, and makes essential use of dependent types, while profiting from type classes. This formalization… 
View PDF on arXiv
5 Citations
Methods Citations
2

Figures and Tables from this paper

5 Citations

Correctness of Functionally Specified Denotational and Operational Semantics
TLDR
A common functionally specified formalization of operational and denotational semantics that creates a framework giving the opportunity to formally prove properties about both programming languages in general and specific programs.
Formalizing Bialgebraic Semantics in PVS 6.0
TLDR
This paper specifies this work in the theorem prover PVS, and proves the adequacy theorem of this formalization of GSOS, to investigate whether PVS is adequately suited for formalizing metatheory.
Formally verified modular semantics
This chapter presents the results of the validation and verification of a crucial component of BOS, a large safety-critical system that decides when to close and open the Maeslantkering, a storm…
Second International Workshop on Rewriting Techniques for Program Transformations and Evaluation
TLDR
A scheme for modelling actor systems within sequential term rewriting and a natural deduction style proof system called “intuitionistic λρ-calculus” for implicational intuitionistic logic and some reduction rules for the proof system were given.
2 2 Ju l 2 02 1 Fundamental Constructs in Programming Languages ( Submitted Draft )
  • 2021

References

SHOWING 1-10 OF 30 REFERENCES
Theorem proving support in programming language semantics
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered…
A Constructive Approach to Language Definition
  • P. Mosses
  • Computer Science
    J. Univers. Comput. Sci.
  • 2005
TLDR
The frameworks of Modular SOS and Action Semantics can both be used in conjunction with the proposed approach, and some illustrations are given.
Component-based semantics
TLDR
This work considers two semantic frameworks that do support component-based language description: action semantics, and a modular variant of structural operational semantics (MSOS), and analysis of how the semantics of individual constructs can be described independently in these frameworks is analysed.
Modular structural operational semantics
  • P. Mosses
  • Computer Science
    J. Log. Algebraic Methods Program.
  • 2004
Theorem proving support in programming language semantics
We describe several views of the semantics of a simple programming language as formal documents in the calculus of inductive constructions that can be verified by the Coq proof system. Covered…
Maude MSOS Tool
Implicit Propagation in Structural Operational Semantics
Mechanized Metatheory for the Masses: The PoplMark Challenge
TLDR
An initial set of benchmarks for measuring progress in this area of programming languages are proposed, based on the metatheory of System F<:, a typed lambda-calculus with second-order polymorphism, subtyping, and records.
First-Class Type Classes
TLDR
This work proposes an embedding of type classes into a dependent type theory that is first-class and supports some of the most popular extensions right away, and shows how it can be used to help structured programming and proving by way of examples.
Type classes for mathematics in type theory†
TLDR
This work presents a new set of type classes for mathematics that take full advantage of their unique features to make practical a particularly flexible approach that was formerly thought to be unfeasible, and addresses traditional proof engineering challenges.
...
...