Sciweavers

6554 search results - page 114 / 1311
» Constraint Logic Programming
Sort
View
AGP
1999
IEEE
15 years 10 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»
15 years 6 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&...
POPL
2007
ACM
16 years 6 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
LPNMR
2009
Springer
15 years 11 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
CLIMA
2004
15 years 7 months ago
Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs
Abstract. Multidimensional dynamic logic programs (MDLPs) are suitable to represent knowledge dynamic in time, or more generally, information coming from various sources, partially...
Martin Homola