Formal program synthesis is concerned with deriving programs that are (formally) correct wrt their speciications, and is therefore of crucial importance to formal development of veriiably correct software. Declarative paradigms such as logic programming are particularly suitable for program synthesis, and we have formulated a formal approach to synthesising standard logic programs. Our approach...

Formal verification of PLC programs using model-checking requires to elaborate previously temporal logic formulae that state in a formal way the properties that must be checked. Unfortunately temporal logic is a formalism totally unknown by automation engineers. This explains why PLC programs developers willing to verify the behavior of their programs are unable to use the existing modelcheckin...

We present a formal logic for quantitative reasoning about security properties of network protocols. The system allows us to derive concrete security bounds that can be used to choose key lengths and other security parameters. We provide axioms for reasoning about digital signatures and random nonces, with security properties based on the concrete security of signature schemes and pseudorandom ...

The idea of symbolic biological experiments opens up an exciting new world of challenging applications for formal methods. Pathway Logic is a step towards a vision of symbolic systems biology. In this paper we describe the Pathway Logic approach to the modeling and analysis of signal transduction, and the use of the Pathway Logic Assistant (PLA) tool to browse and query these models. The epider...

Formal Concept Analysis -also called "Galois Lattices"is an algebraic model based on propositional calculus that is used for symbolic knowledge exploration from a formal context. The aim of this paper is to design the theoretical models required for the extension of Formal Concept Analysis to first-order logic so as to improve both the expression power as a knowledge mining tool upon first orde...

This extended abstract discusses various approaches to the constraining of Partially Observable Markov Decision Processes (POMDPs) using social norms and logical assertions in a dynamic logic framework. Whereas the exploitation of synergies among formal logic on the one hand and stochastic approaches and machine learning on the other is gaining significantly increasing interest since several ye...