Title :

Hoare-fol

Author(s) :

Folschette, Maxime [Auteur]
BioComputing

English keyword(s) :

Hoare logic
Dijkstra predicate calculus
Weakest precondition calculus
Biological regulatory networks
Parameter inference

HAL domain(s) :

Sciences du Vivant [q-bio]/Bio-Informatique, Biologie Systémique [q-bio.QM]
Informatique [cs]

English abstract : [en]

This implementation defines grammars and trees to represent properties onnetworks and their dynamical states (such as “a=1 AND b>0 OR ...”) and asimple branching imperative language (increment, decrement, conditional, ...
Show more >This implementation defines grammars and trees to represent properties onnetworks and their dynamical states (such as “a=1 AND b>0 OR ...”) and asimple branching imperative language (increment, decrement, conditional, loopand quantifiers) with the aim of computing the weakest precondition from givenpostcondition 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.003Show less >

Language :

Anglais

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL