Sciweavers

1894 search results - page 119 / 379
» A TLA Proof System
Sort
View
130
Voted
SLOGICA
1998
128views more  SLOGICA 1998»
15 years 22 days ago
Encoding Modal Logics in Logical Frameworks
We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deductionstyle proof systems for ...
Arnon Avron, Furio Honsell, Marino Miculan, Cristi...
IANDC
2010
102views more  IANDC 2010»
14 years 11 months ago
Presenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of th...
Alexander Kurz, Daniela Petrisan
121
Voted
EUROCRYPT
2007
Springer
15 years 7 months ago
Zero Knowledge and Soundness Are Symmetric
We give a complexity-theoretic characterization of the class of problems in NP having zero-knowledge argument systems. This characterization is symmetric in its treatment of the ze...
Shien Jin Ong, Salil P. Vadhan
ESOP
2007
Springer
15 years 5 months ago
A Certified Lightweight Non-interference Java Bytecode Verifier
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
Gilles Barthe, David Pichardie, Tamara Rezk
JCT
2007
79views more  JCT 2007»
15 years 1 months ago
Generalization of Stanley's monster reciprocity theorem
By studying the reciprocity property of linear Diophantine systems in light of Malcev-Neumann series, we present in this paper a new approach to and a generalization of Stanley’s...
Guoce Xin