Algebraic semantics
From MaRDI portal
Equational classes, universal algebra in model theory (03C05) Free algebras (08B20) Other classes of algebras (08C99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited in
(44)- A Mezei-Wright theorem for categorical algebras
- Fundamental properties of infinite trees
- Axiomatising finite delay operators
- Specification-oriented semantics for communicating processes
- On powerdomains and modality
- The Birkhoff variety theorem for continuous algebras
- An algebraic semantics approach to the effective resolution of type equations
- Conditional rewriting logic as a unified model of concurrency
- A logico-algebraic approach to the model theory of knowledge
- Group axioms for iteration
- A general theory of action languages
- Testing equivalences for processes
- Linda-based applicative and imperative process algebras
- A short scientific biography of Maurice Nivat
- Quantifier elimination for infinite terms
- Toward an infinitary logic of domains: Abramsky logic for transition systems
- Pushdown tree automata, algebraic tree systems, and algebraic tree series
- Equational theories for automata
- Recursive program schemes and context-free monads
- Pushdown tree automata
- Algebraic systems and pushdown automata
- An Action Semantics Based on Two Combinators
- scientific article; zbMATH DE number 3870582 (Why is no real title available?)
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- Graphes canoniques de graphes algébriques
- Iteration Semirings
- scientific article; zbMATH DE number 3817769 (Why is no real title available?)
- scientific article; zbMATH DE number 3896271 (Why is no real title available?)
- Decidable subcases of the equivalence problem for recursive program schemes
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
- Solving Algebraic Equations Using Coalgebra
- scientific article; zbMATH DE number 1522507 (Why is no real title available?)
- Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- scientific article; zbMATH DE number 7136663 (Why is no real title available?)
- Bi-rewriting, a term rewriting technique for monotonic order relations
- Step failures semantics and a complete proof system
- Conditional rewriting logic: Deduction, models and concurrency
- Termination, deadlock and divergence
- A fully abstract denotational model for observational precongruence
- On second-order iterative monads
- A fully abstract denotational model for observational precongruence
- Axiomatizing the equational theory of regular tree languages
- The category-theoretic solution of recursive program schemes
This page was built for publication: Algebraic semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158947)