scientific article
From MaRDI portal
Publication:3675498
zbMath0562.68004MaRDI QIDQ3675498
Francois Lavandier, Bruno Courcelle
Publication date: 1984
Full work available at URL: https://eudml.org/doc/92206
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proofs by induction in equational theories with constructors
- Fundamental properties of infinite trees
- Algebraic semantics
- Attribute grammars and recursive program schemes. I. II
- A system which automatically improves programs
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- Proving and applying program transformations expressed with second-order patterns
- Program schemes, recursion schemes, and formal languages
- Characterization of flowchartable recursions
- Varieties of ”If-Then-Else“
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- Infinite trees in normal form and recursive equations having a unique solution
- Operational and Semantic Equivalence Between Recursive Programs
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Attribute Grammars and Mathematical Semantics
- The denotational semantics of programming languages
- The Theoretical Aspects of the Optimal Fixedpoint
- Initial Algebra Semantics and Continuous Algebras
- Tree-Manipulating Systems and Church-Rosser Theorems
This page was built for publication:
