Sciweavers

1750 search results - page 160 / 350
» Formal multiple-bernoulli models for language modeling
Sort
View
CCS
2005
ACM
15 years 11 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
ICALP
2010
Springer
15 years 11 months ago
Concurrent Knowledge Extraction in the Public-Key Model
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
Andrew C. Yao, Moti Yung, Yunlei Zhao
TIC
1998
Springer
127views System Software» more  TIC 1998»
15 years 10 months ago
Stack-Based Typed Assembly Language
In previous work, we presented a Typed Assembly Language (TAL). TAL is sufficiently expressive to serve as a target language for compilers of high-level languages such as ML. More...
J. Gregory Morrisett, Karl Crary, Neal Glew, David...
FM
2009
Springer
106views Formal Methods» more  FM 2009»
16 years 23 days ago
Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...
Rik Eshuis
AGTIVE
2007
Springer
16 years 12 days ago
Programmed Graph Rewriting with DEVS
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...
Eugene Syriani, Hans Vangheluwe