Coqoon - An IDE for Interactive Proof Development in Coq
International audience
1,553 papers · page 35 of 78
International audience
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
We provide a new algorithm to determine stuttering equivalence with time complexity $$Om \log n$$, where n is the number of states and m is the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimulation in $$Om\log | Act |+\lo…
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
Abstract elided by the publisher.
We consider controller synthesis for stochastic and partially unknown environments in which safety is essential. Specifically, we abstract the problem as a Markov decision process in which the expected performance is measured using a cost function that is unknown prior to run-tim…
Abstract elided by the publisher.
Computing transitive closures of integer relations is the key to finding precise invariants of integer programs. In this paper, we study difference bounds and octagonal relations and prove that their transitive closure is a PTIME-computable formula in the existential fragment of …
Abstract elided by the publisher.
Abstract elided by the publisher.
Subtyping is a crucial ingredient of session type theory and its applications, notably to programming language implementations. In this paper, we study effective ways to check whether a session type is a subtype of another by applying a characteristic formulae approach to the pro…
Abstract elided by the publisher.
Abstract elided by the publisher.
We develop abstract learning frameworks for synthesis that embody the principles of the CEGIS counterexample-guided inductive synthesis algorithms in current literature. Our framework is based on iterative learning from a hypothesis space that captures synthesized objects, using …