Large language models (LLMs) have exploded a new heatwave of AI for their ability to
engage end-users in human-level conversations with detailed and articulate answers across …

To become practical for assurance, automated formal methods must be made more
scalable, automatic, and cost-effective. Such an increase in scope, scale, automation, and …

In this paper, we propose a method for the automatic construction of an abstract state graph
of an arbitrary system using the Pvs theorem prover. Given a parallel composition of …

This is a systematic and comprehensive introduction both to compositional proof methods for
the state-based verification of concurrent programs, such as the assumption-commitment …

The paper documents an application of the finite state model checker SPIN to formally
analyze a multithreaded plan execution module. The plan execution module is one …

The authors present a compositional method for the verification of component-based
systems described in a subset of the behaviour-interaction-priority language encompassing …

We present a model-checker for boolean programs with (possibly recursive) procedures and
the temporal logic LTL. The checker is guaranteed to terminate even for (usually faulty) …

As a result of a radial velocity follow-up of OGLE planetary transit candidates in Carina, we
report the discovery of two new transiting planets with very short orbital periods: OGLE-TR …

Automated deduction uses computation to perform symbolic logical reasoning. It has been a
core technology for program verification from the very beginning. Satisfiability solvers for …

Finite-state model-checkers such as Smv [13] and Spin [11] do not allow to deal with
important aspects that appear in modelling and analysing complex systems, eg …