Sciweavers

3931 search results - page 431 / 787
» Separation logic and abstraction
Sort
View
FORMATS
2010
Springer
15 years 5 months ago
Simulation and Bisimulation for Probabilistic Timed Automata
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
Jeremy Sproston, Angelo Troina
ICTIR
2009
Springer
15 years 4 months ago
Prior Information and the Determination of Event Spaces in Probabilistic Information Retrieval Models
Abstract. A mismatch between differenteventspaceshasbeen used toargue against rank equivalence of classic probabilistic models of information retrieval and language models. We ques...
Corrado Boscarino, Arjen P. de Vries
IANDC
2006
77views more  IANDC 2006»
15 years 7 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
199
Voted
CADE
2008
Springer
16 years 7 months ago
Modularity of Confluence
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
Vincent van Oostrom
ISORC
2009
IEEE
16 years 1 months ago
Marte CCSL to Execute East-ADL Timing Requirements
In the automotive domain, several loosely-coupled Architecture Description Languages (ADLs) compete to proet of abstract modeling and analysis services on top of the implementatio...
Frédéric Mallet, Marie-Agnès ...