Sciweavers

530 search results - page 72 / 106
» The Valid Model Semantics for Logic Programs
Sort
View
TPHOL
2009
IEEE
14 years 2 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
POPL
1995
ACM
13 years 11 months ago
Default Timed Concurrent Constraint Programming
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...
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
POPL
2011
ACM
12 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
SEMWEB
2001
Springer
14 years 4 days ago
Utilizing Host-Formalisms to Extend RDF-Semantics
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...
Wolfram Conen, Reinhold Klapsing
ENTCS
2006
146views more  ENTCS 2006»
13 years 7 months ago
Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...
Iliano Cervesato, Andre Scedrov