The paper discusses the role of interpretations, understood as multifunctions that preserve and reflect logical consequence, as refinement witnesses in the general setting of pi-institutions. This leads to a smooth generalization of the refinement-by-interpretation approach, recently introduced by the authors in more specific contexts. As a second, yet related contribution a basis is provided to build up a refinement calculus of structured specifications in and across arbitrary pi-institutions
Session types capture precise protocol structure in concurrent programming, but do not specify prop-...
Building on the work of Goguen and Burstall on institutions and on Tarski's notion of deductive syst...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
The paper discusses the role of interpretations, understood as multifunctions that preserve and refl...
AbstractRefinement by interpretation replaces signature morphisms by logic interpretations as a mean...
Refinement by interpretation replaces signature morphisms by logic interpretations as a means to tra...
Refinement by interpretation replaces signature morphisms by logic interpretations as a means to tra...
Traditional notions of refinement of algebraic specifica-tions, based on signature morphisms, are of...
Abstract. This article shows a correspondence between abstract inter-pretation of imperative program...
International audienceAbstract interpretation is a theory of abstraction and constructive approximat...
. My colleagues and I developed an approach to proving correctness of architectural refinement hiera...
AbstractIn the algebraic specification of software systems, it is desirable to have freedom in the i...
AbstractOnce you have proved your refinement correct, that is not the end. Real products, and their ...
Once you have proved your refinement correct, that is not the end. Real products, and their accompan...
AbstractWe study proof systems for reasoning about logical consequences and refinement of structured...
Session types capture precise protocol structure in concurrent programming, but do not specify prop-...
Building on the work of Goguen and Burstall on institutions and on Tarski's notion of deductive syst...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...
The paper discusses the role of interpretations, understood as multifunctions that preserve and refl...
AbstractRefinement by interpretation replaces signature morphisms by logic interpretations as a mean...
Refinement by interpretation replaces signature morphisms by logic interpretations as a means to tra...
Refinement by interpretation replaces signature morphisms by logic interpretations as a means to tra...
Traditional notions of refinement of algebraic specifica-tions, based on signature morphisms, are of...
Abstract. This article shows a correspondence between abstract inter-pretation of imperative program...
International audienceAbstract interpretation is a theory of abstraction and constructive approximat...
. My colleagues and I developed an approach to proving correctness of architectural refinement hiera...
AbstractIn the algebraic specification of software systems, it is desirable to have freedom in the i...
AbstractOnce you have proved your refinement correct, that is not the end. Real products, and their ...
Once you have proved your refinement correct, that is not the end. Real products, and their accompan...
AbstractWe study proof systems for reasoning about logical consequences and refinement of structured...
Session types capture precise protocol structure in concurrent programming, but do not specify prop-...
Building on the work of Goguen and Burstall on institutions and on Tarski's notion of deductive syst...
The refinement calculus provides a framework for the stepwise development of imperative programs fro...