scientific article; zbMATH DE number 3799616

Cited in

(30)

Concurrent program schemes and their logics
An automata theoretic decision procedure for the propositional mu- calculus
Axiomatizing fixpoint logics
A methodology for designing proof rules for fair parallel programs
Mathematical modal logic: A view of its evolution
GR(1)*: GR(1) specifications extended with existential guarantees
Non-well-founded deduction for induction and coinduction
Complete proof systems for weighted modal logic
On strictly arithmetical completeness in logics of programs
Contribution of Warsaw logicians to computational logic
Abstraction and abstraction refinement
From Philosophical to Industrial Logics
Bounded semantics
The arity hierarchy in the polyadic -calculus
From Monadic Logic to PSL
A linear translation from CTL^* to the first-order modal -calculus
Matching µ-logic: Foundation of K framework
Alternation-free weighted mu-calculus: decidability and completeness
Elimination of detached regions in dependency graph verification
Efficient Algorithms for Omega-Regular Energy Games
Implementing a CTL model checker with \(\mu \mathcal{G}\), a language for programming graph neural networks
GR(1)*: GR(1) specifications extended with existential guarantees
Computing adequately permissive assumptions for synthesis
The expressive power of implicit specifications
Decidable (ac)counting with Parikh and Muller: adding Presburger arithmetic to monadic second-order logic over tree-interpretable structures
Equivalences among logics of programs
Results on the propositional \(\mu\)-calculus
An abstract interpretation toolkit for CRL
A refinement calculus for specifications in Hennessy-Milner logic with recursion
Proof systems for satisfiability in Hennessy-Milner logic with recursion

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744245)