330 search results - page 59 / 66 » On Modular Termination Proofs of General Logic Programs |
108
click to vote
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
70
Voted
LDTA
2010
14 years 9 months ago
2010
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
PEPM
2010
ACM
15 years 6 months ago
2010
ACM
PET is a prototype Partial Evaluation-based Test case generation tool for a subset of Java bytecode programs. It performs white-box test generation by means of two consecutive Par...
88
Voted
SIGSOFT
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...