Sciweavers

237 search results - page 21 / 48
» Modular Monad Transformers
Sort
View
JAPLL
2010
131views more  JAPLL 2010»
13 years 6 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Streaming Tree Transducers
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
Rajeev Alur, Loris D'Antoni
EUROMICRO
2006
IEEE
14 years 1 months ago
A Modeling Paradigm for Integrated Modular Avionics Design
This paper presents the modeling paradigm for Integrated Modular Avionics Design MIMAD V0, which is an extensible component-oriented framework that enables high level models of sy...
Abdoulaye Gamatié, Christian Brunette, Roma...
ARITH
2005
IEEE
14 years 1 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff
LOPSTR
2001
Springer
14 years 3 days ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle