275 search results - page 30 / 55 » Non-Termination Inference of Logic Programs |
LFCS
1992
Springer
15 years 1 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
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
2007
Springer
15 years 3 months ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
79
Voted
SAS
2010
Springer
14 years 8 months ago
2010
Springer
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...