203 search results - page 37 / 41 » Proof Reflection in Coq |
ACTA
2010
13 years 7 months ago
2010
Abstract This paper presents a general technique for obtaining new results pertaining to the non-finite axiomatizability of behavioral semantics over process algebras from old ones...
CCCG
2006
13 years 9 months ago
2006
Every simple planar polygon can undergo only a finite number of pocket flips before becoming convex. Since Erdos posed this as an open problem in 1935, several independent purport...
IJNSEC
2008
13 years 7 months ago
2008
One approach to protect distributed systems implemented with mobile code is through program obfuscation. Disguising program intent is a form of information hiding that facilitates...
JUCS
2006
13 years 7 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
APAL
2010
13 years 7 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...