590 search results - page 30 / 118 » Non-Failure Analysis for Logic Programs |
ICFEM
2004
Springer
14 years 29 days ago
2004
Springer
A formal framework for software development and analysis is presented, which aims at reducing the gap between formal specification and implementation by integrating the two and al...
SIGSOFT
2005
ACM
14 years 8 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
JELIA
2004
Springer
14 years 29 days ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...
LOPSTR
2004
Springer
14 years 29 days 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...
SAS
2004
Springer
14 years 28 days ago
2004
Springer
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....