1461 search results - page 125 / 293 » Analysis of Constraint Logic Programs |
LOPSTR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
CAV
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
ICTAI
2008
IEEE
15 years 4 months ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
SAS
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
115
click to vote
TRIER
2002
14 years 9 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...