3481 search results - page 354 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
249
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
158
Voted
ESOP
2005
Springer
15 years 10 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...
133
Voted
ICFP
2000
ACM
15 years 9 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
153
click to vote
POPL
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
271
Voted
AI
2011
Springer
14 years 12 months ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...