Sciweavers

1101 search results - page 97 / 221
» Forcing in proof theory
Sort
View
ESOP
2007
Springer
15 years 6 months ago
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
Ichiro Hasuo, Yoshinobu Kawabe
116
Voted
ISOLA
2007
Springer
15 years 6 months ago
Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: ...
Joris Rehm, Dominique Cansell
104
Voted
TPHOL
2002
IEEE
15 years 5 months ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
99
Voted
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
15 years 5 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
BIRTHDAY
1997
Springer
15 years 4 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler