Sciweavers

756 search results - page 143 / 152
» Can Abstract State Machines Be Useful in Language Theory
Sort
View
HT
2004
ACM
14 years 1 months ago
Automatic generation of hypertext system repositories: a model driven approach
In this paper, we present a model-driven methodology and toolset for automatic generation of hypertext system repositories. Our code generator, called Bamboo, is based on a Contai...
E. James Whitehead Jr., Guozheng Ge, Kai Pan
MBEES
2008
13 years 9 months ago
Composition of Model-based Test Coverage Criteria
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
Mario Friske, Bernd-Holger Schlingloff, Stephan We...
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 11 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
POPL
1995
ACM
13 years 11 months ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
CGO
2007
IEEE
14 years 2 months ago
Run-Time Support for Optimizations Based on Escape Analysis
The JavaTM programming language does not allow the programmer to influence memory management. An object is usually allocated on the heap and deallocated by the garbage collector ...
Thomas Kotzmann, Hanspeter Mössenböck