scientific article; zbMATH DE number 3597848

zbMath0384.68016MaRDI QIDQ4164787

Maurice Nivat, Bruno Courcelle

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Conditional rewriting logic: Deduction, models and concurrency, Confluent complement: an algorithm for the intersection of face ideals, An algebraic semantics approach to the effective resolution of type equations, Testing equivalences for processes, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Unnamed Item, Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable, On the algebra of order, Varieties of chain-complete algebras, Unnamed Item, An algebraic definition for control structures, Adherences of languages, The IO- and OI-hierarchies, Partial abstract types, On rational definitions in complete algebras without rank, Unnamed Item, Conditional rewriting logic as a unified model of concurrency, Unnamed Item, Infinite trees in normal form and recursive equations having a unique solution, A class of functions synthesized from a finite number of examples and a lisp program scheme, Least fixed points revisited, On some classes of interpretations, Recursion induction principle revisited, All solutions of a system of recursion equations in infinite trees and other contraction theories, Implementation of data types by algebraic methods, Fundamental properties of infinite trees, Order completion monads, Axiomatisation des tests, The evaluation of first-order substitution is monadic second-order compatible, A short scientific biography of Maurice Nivat