Title :

The Hoare-fol Tool

Author(s) :

Folschette, Maxime [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]

Institution :

Univ. Lille, CNRS, Centrale Lille, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France

Publication date :

2019-12-17

HAL domain(s) :

Informatique [cs]/Modélisation et simulation
Informatique [cs]/Bio-informatique [q-bio.QM]

English abstract : [en]

This document presents the tool named "Application of Hoare Logic and Dijkstra's Weakest Proposition Calculus to Biological Regulatory Networks Using Path Programs with Branching First-Order Logic Operators" or Hoare-fol ...
Show more >This document presents the tool named "Application of Hoare Logic and Dijkstra's Weakest Proposition Calculus to Biological Regulatory Networks Using Path Programs with Branching First-Order Logic Operators" or Hoare-fol for short. This tool consists in an implementation of the theoretical work developed in [Bernot et al., 2019] and contains the following features: (1) computation of the weakest precondition of a Hoare triple, (2) simplification of this weakest precondition using De Morgan laws and partial knowledge on the initial state, and (3) translation into Answer Set Programming to allow a solving of all compatible solutions.Show less >

Language :

Anglais

Collections :

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

Source :

Harvested from HAL