13 citations · 15 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2021★ 2 cited
A Simplicial Model for : Epistemic Logic with Agents that May Die
Éric Goubault, Jérémy Ledent, Sergio Rajsbaum
The standard semantics of multi-agent epistemic logic S5 is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive. This one dimensional struc…
cs.LO2008★ 13 cited
Perturbed affine arithmetic for invariant computation in numerical program analysis
Eric Goubault, Sylvie Putot
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at…