Results 11  20
of
33
A MasterSlave Architecture to Integrate Sets and Finite Domains in Java
"... Abstract. This paper summarizes the lessons learned from the integration of two Java constraint solvers: a set solver (namely JSetL) and a finite domains solver (namely JFD). The most relevant outcome of this experience is the definition of a generic masterslave architecture that can be used to sup ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. This paper summarizes the lessons learned from the integration of two Java constraint solvers: a set solver (namely JSetL) and a finite domains solver (namely JFD). The most relevant outcome of this experience is the definition of a generic masterslave architecture that can be used to support the cooperation of different solvers. Each slave is responsible for managing constraints of a particular sort and the master, which is also a solver, is in charge of distributing tasks according to a static, apriori policy. This paper first presents this generic architecture in an abstract form; then, its concrete instantiation to the selected case study, i.e., the integration of JSetL and JFD, is also described. This case study was selected because it fully demonstrates the possibilities of this architecture as: (i) the poor performances of JSetL on nonset variables are overwhelmed by the cooperation with JFD; and (ii) the expressive power of JSetL is fully preserved and the integration with JFD demands no restrictions. 1
Multiset Rewriting By Multiset Constraint Solving
 ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY
, 2001
"... Termlike theories of multisets have been recently studied from an axiomatic point of view and constraint solving algorithms have been developed. In this paper ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Termlike theories of multisets have been recently studied from an axiomatic point of view and constraint solving algorithms have been developed. In this paper
JULIA: A Generic Static Analyser for the Java Bytecode
 Part XXX
, 1982
"... We describe our software tool JULIA for the static analysis of full sequential Java bytecode. This tool is generic in the sense that no specific abstract domain (analysis) is embedded in JULIA. Instead, abstract domains are provided as external classes that specialise the behaviour of JULIA. Static ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe our software tool JULIA for the static analysis of full sequential Java bytecode. This tool is generic in the sense that no specific abstract domain (analysis) is embedded in JULIA. Instead, abstract domains are provided as external classes that specialise the behaviour of JULIA. Static analysis is performed through a denotational fixpoint calculation, focused on some program points called watchpoints. These points specify where the result of the analysis is useful, and can be automatically placed by the abstract domain or manually provided by the user. JULIA can be instructed to include a given set of library Java classes in the analysis, in order to improve its precision. Moreover, it gives abstract domains the opportunity to approximate control and dataflow arising from exceptions and subroutines.
P.: Static Type Inference for the Q language using Constraint Logic Programming
 In: 28th International Conference on Logic Programming (ICLP 2012). Leibniz International Proceedings in Informatics (LIPIcs
, 2012
"... We describe an application of Prolog: a type inference tool for the Q functional language. Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial applications. Q is a dynamically typed language, much like Prolog. Extending Q with ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We describe an application of Prolog: a type inference tool for the Q functional language. Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial applications. Q is a dynamically typed language, much like Prolog. Extending Q with static typing improves both the readability of programs and programmer productivity, as type errors are discovered by the tool at compile time, rather than through debugging the program execution. We map the task of type inference onto a constraint satisfaction problem and use constraint logic programming, in particular the Constraint Handling Rules extension of Prolog. We determine the possible type values for each program expression and detect inconsistencies. As most builtin function names of Q are overloaded, i.e. their meaning depends on the argument types, a quite complex system of constraints had to be implemented.
G.: Generalizing finite domain constraint solving
, 2008
"... Abstract. This paper summarizes a constraint solving technique that can be used to reason effectively in the scope of a constraint language that supersedes common finite domain languages available in the literature. The first part of this paper motivates the presented work and introduces the constra ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. This paper summarizes a constraint solving technique that can be used to reason effectively in the scope of a constraint language that supersedes common finite domain languages available in the literature. The first part of this paper motivates the presented work and introduces the constraint language, namely Hereditarily Finite Sets (HFS) language. Then, the proposed constraint solver is detailed in terms of a set of rewrite rules which exploit finite domain reasoning within the HFS language. The presented approach achieves good efficiency without loosing the desired correctness and completeness properties that other solvers for HFS provide. 1
Abstract
, 2008
"... The goal of this paper is to provide a uniform overview of the unification problem in algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and it can find important applications in various research areas—e.g., deductive databases, theorem pr ..."
Abstract
 Add to MetaCart
(Show Context)
The goal of this paper is to provide a uniform overview of the unification problem in algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and it can find important applications in various research areas—e.g., deductive databases, theorem proving, static analysis, rapid software prototyping. The problem has been explored in depth, but the various solutions proposed are spread across a large literature, and some of the approaches have been ignored and/or rediscovered by different researchers. In this paper we provide a uniform presentation of unification of sets, starting with the simpler instances of the problem—e.g., matching of completely ground terms—and proceeding to progressively more complex problems—e.g., unification between general ACI terms. The algorithms presented are partly drawn from the literature—and properly revisited and analyzed—and partly novel proposals. In particular we present a new goaldriven algorithm for general ACI unification and a new algorithm (with a simple termination proof) for general (Ab)(Cℓ) unification. However, the major contribution of this work is to provide the first uniform presentation of the problem, covering all its different
Multiset Constraints and P Systems
"... Multisets are the fundamental data structure of P systems. ..."
Decidability Results for Sets with Atoms ∗
"... Formal Set Theory is traditionally concerned with pure sets; consequently, the satisfiability problem for fragments of set theory was most often addressed (and in many cases positively solved) in the pure framework. In practical applications, however, it is common to assume the existence of a number ..."
Abstract
 Add to MetaCart
(Show Context)
Formal Set Theory is traditionally concerned with pure sets; consequently, the satisfiability problem for fragments of set theory was most often addressed (and in many cases positively solved) in the pure framework. In practical applications, however, it is common to assume the existence of a number of primitive objects (sometimes called atoms) that can be members of sets but behave differently from them. If these entities are assumed to be devoid of members, the standard extensionality axiom must be revised; then decidability results can sometimes be achieved via reduction to the pure case and sometimes can be based on direct goaldriven algorithms. An alternative approach to modeling atoms, that allows one to retain the original formulation of extensionality, was proposed by Quine: atoms are selfsingletons. In this paper we adopt this approach in coping with the satisfiability problem: we show the decidability of this problem relativized to ∃ ∗ ∀sentences, and develop a goaldriven unification algorithm.
A Constraint Handling Rules Implementation for KnownArcConsistency in Interactive Constraint Satisfaction Problems
, 2004
"... In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of com ..."
Abstract
 Add to MetaCart
In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of computation time, or even obsolescence of the acquired data at the time of use.