Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Zaffanella, Enea"'
Abstract Interpretation approximates the semantics of a program by mimicking its concrete fixpoint computation on an abstract domain $\mathbb{A}$. The abstract (post-) fixpoint computation is classically divided into two phases: the ascending phase,
Externí odkaz:
http://arxiv.org/abs/2206.10893
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Becchi, Anna, Zaffanella, Enea
We present an alternative Double Description representation for the domain of NNC (not necessarily topologically closed) polyhedra, together with the corresponding Chernikova-like conversion procedure. The representation differs from the ones adopted
Externí odkaz:
http://arxiv.org/abs/1711.09593
Autor:
Becchi, Anna, Zaffanella, Enea
Publikováno v:
In Information and Computation December 2020 275
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Zaffanella, Enea
For programming languages based on logic, a knowledge of variable sharing is important; for instance, for their automatic parallelization and for many optimisations of the unification procedure, such as occurs-check reduction. Because of its usefulne
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.529166
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking functions are particularly interesting because many terminating loops a
Externí odkaz:
http://arxiv.org/abs/1004.0944
Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification and optimiz
Externí odkaz:
http://arxiv.org/abs/0904.1783
ECLAIR is a Prolog-based prototype system aiming to provide a functionally complete environment for the study, development and evaluation of programming language analysis and implementation tools. In this paper, we sketch the overall structure of the
Externí odkaz:
http://arxiv.org/abs/0711.0345
Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality'' or ``UTVPI integer constraints'') constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint programmi
Externí odkaz:
http://arxiv.org/abs/0705.4618