Sciweavers

1143 search results - page 137 / 229
» Abstract Syntax and Logic Programming
Sort
View
CSL
2008
Springer
15 years 4 months ago
Pure Pointer Programs with Iteration
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
Martin Hofmann, Ulrich Schöpp
AGP
1998
IEEE
15 years 6 months ago
The Correctness of Set-Sharing
It is important that practical data flow analysers are backed bly proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic ...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
TPLP
2002
69views more  TPLP 2002»
15 years 2 months ago
Soundness, idempotence and commutativity of set-sharing
It is important that practical data-flow analyzers are backed by reliably proven theoretical Abstract interpretation provides a sound mathematical framework and necessary properti...
Patricia M. Hill, Roberto Bagnara, Enea Zaffanella
125
Voted
ICLP
2009
Springer
15 years 7 months ago
Integration of Abductive Reasoning and Constraint Optimization in SCIFF
Abstract. Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP) share the feature to constrain the set of possible solutions to a program via integrity or CLP co...
Marco Gavanelli, Marco Alberti, Evelina Lamma
ICFP
2010
ACM
15 years 3 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal