The Behavior Tree notation has been developed as a method for systematically and traceably capturing user requirements. In this paper we extend the notation with probabilistic beha...
The testing and formal verification of black box software components is a challenging domain. The problem is even harder when specifications of these components are not available...
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Abstract Within a framework of correct code-generation from HOLspecifications, we present a particular instance concerned with the optimized compilation of a lazy language (called...
Simple retrenchment is briefly reviewed in the B language of J.-R. Abrial [1] as a liberalisation of classical refinement, for the formal description of application developments ...