Pages that link to "Item:Q1260047"
From MaRDI portal
The following pages link to Constructive versions of Tarski's fixed point theorems (Q1260047):
Displaying 50 items.
- Coinductive predicates and final sequences in a fibration (Q265811) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Control of \((max, +)\)-linear systems minimizing delays (Q373011) (← links)
- An abstract interpretation framework for genotype elimination algorithms (Q428908) (← links)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- The use of two relations in \( L\)-fuzzy contexts (Q528724) (← links)
- Fuzzy logic programming reduced to reasoning with attribute implications (Q529051) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- The two variable per inequality abstract domain (Q656848) (← links)
- An array content static analysis based on non-contiguous partitions (Q681352) (← links)
- Transfinite sequences in the programmed iteration method (Q721523) (← links)
- Closures and fairness in the semantics of programming logic (Q799098) (← links)
- An NSF proposal (Q815007) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- An integer static analysis for better extrapolation in Uppaal (Q832038) (← links)
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Weakly-relational shapes for numeric abstractions: Improved algorithms and proofs of correctness (Q845242) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- Deriving escape analysis by abstract interpretation (Q857916) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Properties of data flow frameworks: A unified model (Q910237) (← links)
- The complexity of Tarski's fixed point theorem (Q935168) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Property persistence in the situation calculus (Q991025) (← links)
- Bi-inductive structural semantics (Q1012127) (← links)
- Fixed point theorems and semantics: A folk tale (Q1166268) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- Construction of the \(L\)-fuzzy concept lattice (Q1296855) (← links)
- Frameworks for abstract interpretation (Q1323307) (← links)
- Correctness of fixpoint transformations (Q1329743) (← links)
- Property preserving abstractions for the verification of concurrent systems (Q1346649) (← links)
- Concept lattices defined from implication operators (Q1582765) (← links)
- Down and up operators associated to fuzzy relations and t-norms: A definition of fuzzy semi-ideals (Q1595209) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Parsing as abstract interpretation of grammar semantics (Q1853600) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- TASS: the toolkit for accurate scientific software (Q1949767) (← links)
- Thompson aggregators, Scott continuous koopmans operators, and least fixed point theory (Q2236202) (← links)
- Computing difference abstractions of linear equation systems (Q2238208) (← links)
- Viable set computation for hybrid systems (Q2252963) (← links)
- The fixed-point theory of strictly causal functions (Q2257306) (← links)
- A proof of Tarski's fixed point theorem by application of Galois connections (Q2352455) (← links)
- Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
- A divide-and-conquer approach for analysing overlaid data structures (Q2441710) (← links)
- Existence and uniqueness of fixed point in partially ordered sets and applications to ordinary differential equations (Q2481789) (← links)
