The following pages link to Francesco Ranzato (Q453544):
Displaying 50 items.
- (Q224709) (redirect page) (← links)
- Bisimulation and simulation algorithms on probabilistic transition systems by abstract interpretation (Q453545) (← links)
- Generalizing the Paige-Tarjan algorithm by abstract interpretation (Q924726) (← links)
- An efficient simulation algorithm based on abstract interpretation (Q1049401) (← links)
- Weak relative pseudo-complements of closure operators (Q1272226) (← links)
- Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements (Q1275821) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- Pseudocomplements of closure operators on posets (Q1598820) (← links)
- Abstract interpretation of supermodular games (Q1664400) (← links)
- Correction to ``Some properties of complete congruence lattices''. (Q1771913) (← links)
- Abstracting Nash equilibria of supermodular games (Q1791275) (← links)
- Optimal domains for disjunctive abstract interpretation (Q1818325) (← links)
- Closures on CPOs form complete lattices (Q1854300) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
- On the least complete extension of complete subsemilattices (Q1966122) (← links)
- Some properties of complete congruence lattices (Q1966160) (← links)
- Intensional Kleene and Rice theorems for abstract program semantics (Q2105439) (← links)
- Correctness kernels of abstract interpretations (Q2252528) (← links)
- An efficient simulation algorithm on Kripke structures (Q2453984) (← links)
- Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
- (Q2763671) (← links)
- Analyzing Program Analyses (Q2819811) (← links)
- Saving Space in a Time Efficient Simulation Algorithm (Q2895774) (← links)
- Complete Abstractions Everywhere (Q2926636) (← links)
- Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions (Q2946748) (← links)
- Complementing logic program semantics (Q2956725) (← links)
- Probabilistic Bisimulation and Simulation Algorithms by Abstract Interpretation (Q3012928) (← links)
- A Spectrum of Behavioral Relations over LTSs on Probability Distributions (Q3090826) (← links)
- Computing Stuttering Simulations (Q3184698) (← links)
- On Constructivity of Galois Connections (Q3296346) (← links)
- Generalized Strong Preservation by Abstract Interpretation (Q3437262) (← links)
- Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming (Q3578394) (← links)
- Example-Guided Abstraction Simplification (Q3587440) (← links)
- (Q4217930) (← links)
- (Q4411975) (← links)
- (Q4411978) (← links)
- Refining and compressing abstract domains (Q4572005) (← links)
- Complete Abstractions for Checking Language Inclusion (Q5056350) (← links)
- (Q5089296) (← links)
- Making abstract domains condensing (Q5277715) (← links)
- Programming Languages and Systems (Q5308686) (← links)
- A new characterization of complete Heyting and co-Heyting algebras (Q5367064) (← links)
- Making abstract interpretations complete (Q5385340) (← links)
- Tracing compilation by abstract interpretation (Q5408402) (← links)
- A Forward-Backward Abstraction Refinement Algorithm (Q5452721) (← links)
- Programming Languages and Systems (Q5493375) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703755) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5898627) (← links)
- A counterexample to a result concerning closure operators (Q5953293) (← links)
- (Q6134251) (← links)
