Hoare-fol

Maxime Folschette (1)

1 BioComputing

This implementation defines grammars and trees to represent properties on networks and their dynamical states (such as “a=1 AND b>0 OR ...”) and a simple branching imperative language (increment, decrement, conditional, loop and quantifiers) with the aim of computing the weakest precondition from given postcondition and path program, on a given network. This weakest precondition can also be translated to Answer Set Programming (ASP) in order to be solved by Clingo 5. This is an application of the theoretical work developed in: G. Bernot, J.-P. Comet, Z. Khalis, A. Richard, O. Roux, A genetically modified Hoare logic, Theoretical Computer Science, 2018. ISSN: 0304-3975 DOI: https://doi.org/10.1016/j.tcs.2018.02.003

Mots clés: Hoare logic; Dijkstra predicate calculus; Weakest precondition calculus; Biological regulatory networks; Parameter inference

Domaines: Bio-Informatique, Biologie Systémique [q-bio.QM]; Informatique [cs]

Maxime Folschette. Hoare-fol. 2019, ⟨swh:1:dir:f26f25a22a241279640bebda3cb892ba82189764;origin=https://hal.archives-ouvertes.fr/hal-04433929;visit=swh:1:snp:b1630075fff0730287405f694ebe57330d73516c;anchor=swh:1:rel:4ce31dd9d653030b7ac2f4c6def80140aaafb31f;path=/⟩. ⟨hal-04433929⟩