Sciweavers

335 search results - page 67 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
PLDI
2003
ACM
13 years 10 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
FASE
2009
Springer
13 years 8 months ago
Certification of Smart-Card Applications in Common Criteria
This paper describes the certification of smart-card applications in the framework of Common Criteria. In this framework, a smart-card application is represented by a model of its...
Iman Narasamdya, Michaël Périn
TOPLAS
2008
138views more  TOPLAS 2008»
13 years 4 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
SPEECH
2010
89views more  SPEECH 2010»
12 years 11 months ago
Which words are hard to recognize? Prosodic, lexical, and disfluency factors that increase speech recognition error rates
Despite years of speech recognition research, little is known about which words tend to be misrecognized and why. Previous work has shown that errors increase for infrequent words...
Sharon Goldwater, Daniel Jurafsky, Christopher D. ...
OOPSLA
2005
Springer
13 years 10 months ago
Javari: adding reference immutability to Java
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The speonstraint expressed is that the abstract state of the object to whi...
Matthew S. Tschantz, Michael D. Ernst