Sciweavers

2291 search results - page 424 / 459
» Logic Programming and Model Checking
Sort
View
CP
2007
Springer
14 years 1 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
DATE
2006
IEEE
108views Hardware» more  DATE 2006»
14 years 1 months ago
Scheduling under resource constraints using dis-equations
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...
Hadda Cherroun, Alain Darte, Paul Feautrier
FASE
2005
Springer
14 years 1 months ago
Improving the Build Architecture of Legacy C/C++ Software Systems
Abstract. The build architecture of legacy C/C++ software systems, groups program files in directories to represent logical components. The interfaces of these components are loos...
Homayoun Dayani-Fard, Yijun Yu, John Mylopoulos, P...
DEXA
2004
Springer
180views Database» more  DEXA 2004»
14 years 29 days ago
Algebra-to-SQL Query Translation for Spatio-Temporal Databases
Although many spatio-temporal conceptual models has been proposed in the last years, users must express their queries on the underlying physical data structures. In the context of ...
Mohammed Minout, Esteban Zimányi
IFIP
2004
Springer
14 years 28 days ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré