3535 search results - page 482 / 707 » Logic Program Specialisation |
145
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
167
Voted
ICFEM
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
152
click to vote
FM
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Program certification techniques formally show that programs satisfy certain safety policies. They rely on the correctness of the safety policy which has to be establish...
145
Voted
KR
1998
Springer
15 years 10 months ago
1998
Springer
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...
145
Voted
GPCE
2008
Springer
15 years 7 months ago
2008
Springer
The influential pure embedding methodology of embedding domainspecific languages (DSLs) as libraries into a general-purpose host language forces the DSL designer to commit to a ...