4370 search results - page 681 / 874 » Algebra of Logic Programming |
144
click to vote
TPHOL
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract. Lightweight separation is a novel approach to automatic reasoning about memory updates in pointer programs. It replaces the spatial formulae of separation logic, which co...
125
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
135
Voted
ETFA
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a new approach to modelling and verification of function block applications of the IEC 61499 standard. The approach uses the language of logic programming Prol...
114
click to vote
IFIP
2005
Springer
15 years 9 months ago
2005
Springer
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
118
Voted
CSL
2004
Springer
15 years 9 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...