446 search results - page 59 / 90 » A Theorem Prover for a Computational Logic |
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...
TOPLAS
2008
14 years 9 months ago
2008
WS-SecurityPolicy is a declarative language for configuring web services security mechanisms. We describe a formal semantics for WS-SecurityPolicy and propose a more abstract lang...
IJIS
2011
14 years 1 months ago
2011
In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗ , is introdu...
110
click to vote
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
TCC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...