The goal of this work is to improve the efficiency and effectiveness of the abstraction-refinement framework for CTL over the 3-valued semantics. We start by proposing a symbolic (BDD-based) approach for this framework. Next, we generalize the definition of abstract models in order to provide a monotonic abstraction-refinement framework. To do so, we introduce the notion of hyper-ion-refinement...

The factor refinement principle turns a partial factorization of integers (or polynomials) into a more complete factorization represented by basis elements and exponents, with basis elements that are pairwise coprime. There are lots of applications of this refinement technique such as simplifying systems of polynomial inequations and, more generally, speeding up certain algebraic algorithms by ...

The spectrum of the Laplacian of successive Barycentric subdivisions of a graph converges exponentially fast to a limit which only depends on the clique number of the initial graph and not on the graph itself. Announced in [40]), the proof uses now an explicit linear operator mapping the clique vector of a graph to the clique vector of the Barycentric refinement. The eigenvectors of its transpo...

This paper presents FunFrog, a tool that implements a function summarization approach for software bounded model checking. It uses interpolationbased function summaries as over-approximation of function calls. In every successful verification run, FunFrog generates function summaries of the analyzed program functions and reuses them to reduce the complexity of the successive verification. To pr...

Goal reasoning is a process by which actors deliberate to dynamically select the goals they pursue, often in response to notable events. Building on previous work, we clarify and define the Goal Reasoning Problem, which incorporates a Goal Lifecycle with refinement strategies to transition goals in the lifecycle. We show how the Goal Lifecycle can model online planning, replanning, and plan rep...

In this demo we focus on the engineering of open multi-agent systems as electronic institutions. Electronic institutions are a formalism to define the rules which structure agent interactions, establishing what agents are permitted and forbidden to do. We present a set of tools that support the specification, analysis and execution of institutions, as well as the implementation of agents. Our m...

The creative activity of programming — to be distinguished from coding — is usually taught by examples serving to exhibit certain techniques. It is here considered as a sequence of design decisions concerning the decomposition of tasks into subtasks and of data into data structures. The process of successive refinement of specifications is illustrated by a short but nontrivial example, from whi...