1143 search results - page 89 / 229 » Abstract Syntax and Logic Programming |
118
click to vote
POPL
2010
ACM
15 years 12 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
122
Voted
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
119
click to vote
ESOP
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...
115
click to vote
CC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We discuss the challenges faced by bytecode analyzers designed for code verification compared to similar analyzers for source code. While a bytecode-level analysis brings...
107
click to vote
TLDI
2009
ACM
15 years 11 months ago
2009
ACM
Object-oriented programs are notable for making use of both rder abstractions and mutable, aliased state. Either feature alone is challenging for formal verification, and the com...