158 search results - page 8 / 32 » A Framework for Assertion-Based Debugging in Constraint Logi... |
132
click to vote
ICFP
2003
ACM
16 years 2 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
131
click to vote
AGP
1995
IEEE
15 years 6 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
117
click to vote
SAS
2004
Springer
15 years 8 months ago
2004
Springer
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
146
click to vote
TAP
2010
Springer
15 years 24 days ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...