641 search results - page 50 / 129 » Embedding Finite Sets in a Logic Programming Language |
108
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...
147
Voted
EUROCAST
2007
Springer
15 years 7 months ago
2007
Springer
In this paper we introduce an extension of Equilibrium Logic (a logical characterisation of the Answer Set Semantics for logic programs) consisting in the inclusion of modal tempor...
134
Voted
CONCUR
2004
Springer
15 years 9 months ago
2004
Springer
We present a trace semantics for a language of parallel programs which share access to mutable data. We introduce a resource-sensitive logic for partial correctness, based on a re...
167
Voted
POPL
2010
ACM
16 years 28 days ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
128
click to vote
POPL
1995
ACM
15 years 7 months ago
1995
ACM
d Abstract) We extend the model of [VRV94] to express strong time-outs (and pre-emption): if an event A does not happen through time t, cause event B to happen at time t. Such con...