Sciweavers

458 search results - page 32 / 92
» An Algebraic Approach to Sharing Analysis of Logic Programs
Sort
View
DATE
2007
IEEE
106views Hardware» more  DATE 2007»
14 years 3 months ago
Optimized integration of test compression and sharing for SOC testing
1 The increasing test data volume needed to test core-based System-on-Chip contributes to long test application times (TAT) and huge automatic test equipment (ATE) memory requireme...
Anders Larsson, Erik Larsson, Petru Eles, Zebo Pen...
TCS
2002
13 years 8 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
ACTA
1998
81views more  ACTA 1998»
13 years 8 months ago
Dijkstra-Scholten Predicate Calculus: Concepts and Misconceptions
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
Lex Bijlsma, Rob Nederpelt
DLOG
2010
13 years 6 months ago
Optimizing Algebraic Tableau Reasoning for SHOQ: First Experimental Results
In this paper we outline an algebraic tableau algorithm for the DL SHOQ, which supports more informed reasoning due to the use of semantic partitioning and integer programming. We ...
Jocelyne Faddoul, Volker Haarslev
LOPSTR
2009
Springer
14 years 3 months ago
A Transformational Approach for Proving Properties of the CHR Constraint Store
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe