Sciweavers

232 search results - page 40 / 47
» Implementing logical connectives in constraint programming
Sort
View
AGP
1999
IEEE
13 years 11 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
CORR
2010
Springer
210views Education» more  CORR 2010»
13 years 7 months ago
Test Case Generation for Object-Oriented Imperative Languages in CLP
Testing is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to ...
Miguel Gómez-Zamalloa, Elvira Albert, Germ&...
NMR
2004
Springer
14 years 25 days ago
Frame consistency: computing with causal explanations
This paper presents a computational model for reasoning with causal explanations of observations within the framework of Abductive Event Calculus (AEC). The model is based on abdu...
Andrea Bracciali, Antonis C. Kakas
CADE
2005
Springer
14 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
SOCO
2009
Springer
14 years 2 months ago
Specifying and Composing Non-functional Requirements in Model-Based Development
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
Ethan K. Jackson, Dirk Seifert, Markus Dahlweid, T...