Sciweavers

3228 search results - page 14 / 646
» Computationally Sound Proofs
Sort
View
CONCUR
2004
Springer
14 years 26 days ago
Modular Construction of Modal Logics
We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavi...
Corina Cîrstea, Dirk Pattinson
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
14 years 4 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
AISC
1998
Springer
13 years 11 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
FSTTCS
2007
Springer
14 years 1 months ago
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...
Michael Backes, Markus Dürmuth, Ralf Küs...