2649 search results - page 311 / 530 » Temporal Theories of Reasoning |
AOSD
2007
ACM
14 years 1 months ago
2007
ACM
We define and study bisimulation for proving contextual equivalence in an aspect extension of the untyped lambda-calculus. To our knowledge, this is the first study of coinductive...
CADE
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
TASE
2009
IEEE
14 years 4 months ago
2009
IEEE
Population protocols are an elegant model recently introduced for distributed algorithms running in large and unreliable networks of tiny mobile agents. Correctness proofs of such...
LICS
2008
IEEE
14 years 3 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...