Sciweavers

369 search results - page 20 / 74
» Symbolic Semantics Revisited
Sort
View
CHARME
1999
Springer
100views Hardware» more  CHARME 1999»
14 years 2 hour ago
Xs are for Trajectory Evaluation, Booleans are for Theorem Proving
Abstract. This paper describes a semantic connection between the symbolic trajectory evaluation model-checking algorithm and relational verification in higher-order logic. We prov...
Mark Aagaard, Thomas F. Melham, John W. O'Leary
SLP
1994
121views more  SLP 1994»
13 years 9 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
SIGIR
2009
ACM
14 years 2 months ago
The ESA retrieval model revisited
Among the retrieval models that have been proposed in the last years, the ESA model of Gabrilovich and Markovitch received much attention. The authors report on a significant imp...
Maik Anderka, Benno Stein
WSPI
2004
13 years 9 months ago
Self-Referencing Languages Revisited
Paradoxes, particularly Tarski's liar paradox, represent an ongoing challenge that have long attracted special interest. There have been numerous attempts to give either a for...
Gábor Rédey, Attila Neumann
ACTA
2005
94views more  ACTA 2005»
13 years 7 months ago
The stuttering principle revisited
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...
Antonín Kucera, Jan Strejcek