293 search results - page 32 / 59 » A Logic for Variable Aliasing in Logic Programs |
PEPM
2009
ACM
15 years 6 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
ENTCS
2002
14 years 9 months ago
2002
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
FM
2009
Springer
15 years 4 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
98
Voted
PLPV
2009
ACM
15 years 6 months ago
2009
ACM
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
AGP
1999
IEEE
15 years 1 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...