Sciweavers

460 search results - page 72 / 92
» Revised Stable Models - A Semantics for Logic Programs
Sort
View
IEE
2008
115views more  IEE 2008»
13 years 7 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller
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
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