Sciweavers

91 search results - page 11 / 19
» The Complete Proof Theory of Hybrid Systems
Sort
View
ENTCS
2010
92views more  ENTCS 2010»
15 years 6 days ago
Two Ways to Common Knowledge
It is not clear what a system for evidence-based common knowledge should look like if common knowledge is treated as a greatest fixed point. This paper is a preliminary step towar...
Samuel Bucheli, Roman Kuznets, Thomas Studer
CADE
2002
Springer
16 years 13 days ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
ENTCS
2006
103views more  ENTCS 2006»
15 years 4 days ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
102
Voted
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
15 years 3 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing
109
Voted
POPL
2010
ACM
15 years 9 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins