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 …

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 …

Requirements interaction management (RIM) is the set of activities directed toward the
discovery, management, and disposition of critical relationships among sets of requirements …

Explicitly stated program invariants can help programmers by identifying program properties
that must be preserved when modifying code. In practice, however, these invariants are …

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 …

Programs usually follow many implicit programming rules, most of which are too tedious to
be documented by programmers. When these rules are violated by programmers who are …

Formal specifications have been a focus of software engineering research for many years
and have been applied in a wide variety of settings. Their industrial use is still limited but has …

We present a new technique for the generation of non-linear (algebraic) invariants of a
program. Our technique uses the theory of ideals over polynomial rings to reduce the non …

Software verification is an important and difficult problem. Many static checking techniques
for software require annotations from the programmer in the form of method specifications …

Deductive verification of progress properties relies on finding ranking functions to prove
termination of program cycles. We present an algorithm to synthesize linear ranking …