1401 search results - page 137 / 281 » Randomness in Interactive Proofs |
SAS
2007
Springer
15 years 4 months ago
2007
Springer
Concurrent programs are difficult to verify because the proof must consider the interactions between the threads. Fine-grained concurrency and heap allocated data structures exacer...
KI
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
CADE
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. The little theories method, in which mathematical reasoning is distributed across a network of theories, is a powerful technique for describing and analyzing complex syst...
LACL
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
CADE
1992
Springer
15 years 2 months ago
1992
Springer
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theor...