1445 search results - page 148 / 289 » Abstract Interpretation of Logic Programs |
102
click to vote
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
70
Voted
CSL
2004
Springer
15 years 3 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
102
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
VMCAI
2010
Springer
15 years 5 months ago
2010
Springer
This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For inst...
81
Voted
UM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. A promising approach towards evaluating adaptive systems is to decompose the adaptation process and evaluate the system in a “piece-wise” manner. This paper presents ...