System goals are the statements that, in the context of software requirements specification,
capture how the software should behave. Many times, the understanding of stakeholders on …

The boundary conditions (BCs) have shown great potential in requirements engineering
because a BC captures the particular combination of circumstances, ie, divergence, in which …

In this paper, we consider the minimal unsatisfiable core (MUC) problem for linear temporal
logic over finite traces (LTL), which nowadays is a popular formal-specification language for …

Linear temporal logic (LTL) satisfiability checking is a fundamental and hard (PSPACE-
complete) problem. In this paper, we explore checking LTL satisfiability via end-to-end …

Linear temporal logic over finite traces (LTLf) satisfiability checking is a fundamental and
hard (PSPACE-complete) problem in the artificial intelligence community. We explore …

The reactive synthesis problem consists of automatically producing correct-by-construction
operational models of systems from high-level formal specifications of their behaviours …

Linear temporal logic (LTL) satisfiability checking has a high complexity, ie, PSPACE-
complete. Recently, neural networks have been shown to be promising in approximately …

As a new form of service model, crossover services aim to aggregate service resources
across multiple domains to meet the complex needs of users and provide value-added …

Detecting conflicting requirements early in the software development lifecycle is crucial to
mitigating risks of system failures and enhancing overall reliability. While Large Language …

LTL solvers check the satisfiability of Linear-time Temporal Logic (LTL) formulas and are
widely used for verifying and testing critical software systems. Thus, potential bugs in the …