NuITP is an inductive equational theorem prover that combines advanced symbolic
techniques such as narrowing, equality predicates, variant unification, variant satisfiability …

Reachability logic has been applied to K rewrite-rule-based language definitions as a
language-generic logic of programs. To be able to verify not just code but also distributed …

An inductive inference system for proving validity of formulas in the initial algebra TE of an
order-sorted equational theory E is presented. It has 21 inference rules. Only 9 of them …

Reachability logic has been applied to 𝕂 rewrite-rule-based language definitions as a
language-generic logic of programs to verify a wide range of sophisticated programs in …

CafeOBJ is a language for writing formal specifications of software and hardware systems. It
implements equational logic by rewriting and has been used to verify properties of systems …

Transition systems provide a natural way to specify and reason about the behaviour of
discrete systems, and in particular about the computations that they may perform. This paper …

Hybrid systems combine both continuous and discrete behaviors, which occur frequently in
safety-critical applications in various domains including Internet-of-Things (IoT) and Cyber …

Critical flaws continue to exist at the level of domain, requirement, and/or design
specification, and specification verification (ie, to check whether a specification has …

Because processes run concurrently in multitask systems, the size of the state space grows
exponentially. Therefore, it is not straightforward to formally verify that such systems enjoy …

Fischer's protocol is a well-known real-time mutual exclusion protocol for multiple processes.
The mutual exclusiveness is guaranteed by treating time aspects of transitions. In such a …