AbstractWhen 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
This paper presents a nine-rule language-independent proof system that takes an operational semanti...
AbstractThe paper proposes an axiomatic approach to specification languages, and introduces notions ...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
Abstract interpretation is a technique for developing static analyses. Yet, proving abstract interpr...
Machine-checked proofs of properties of programming languages have gained in importance significantl...
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
Machine-checked proofs of properties of programming languages have gained in importance significantl...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
Structural Operational Semantics (SOS) is a well known standard for specifying language semantics in...
Abstract. This paper presents a nine-rule language-independent proof system that takes an operationa...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
Compositionality of denotational semantics is an important concern in programming semantics. Mathema...
New, simple, proofs of soundness (every representable function lies in a given complexity class) for...
Type systems for programming languages shall detect type errors in programs before runtime. To ensur...
This paper presents a nine-rule language-independent proof system that takes an operational semanti...
AbstractThe paper proposes an axiomatic approach to specification languages, and introduces notions ...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
Abstract interpretation is a technique for developing static analyses. Yet, proving abstract interpr...
Machine-checked proofs of properties of programming languages have gained in importance significantl...
Type systems for static programming languages are supposed to ensure the absence of type errors in c...
Machine-checked proofs of properties of programming languages have gained in importance significantl...
In the field of structural operational semantics (SOS), there have been several proposals both for s...
Structural Operational Semantics (SOS) is a well known standard for specifying language semantics in...
Abstract. This paper presents a nine-rule language-independent proof system that takes an operationa...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
Compositionality of denotational semantics is an important concern in programming semantics. Mathema...
New, simple, proofs of soundness (every representable function lies in a given complexity class) for...
Type systems for programming languages shall detect type errors in programs before runtime. To ensur...
This paper presents a nine-rule language-independent proof system that takes an operational semanti...
AbstractThe paper proposes an axiomatic approach to specification languages, and introduces notions ...
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a progr...
DOI
Add to ORKG