Sciweavers

555 search results - page 35 / 111
» Between Symbol and Language-in-use
Sort
View
CCS
2008
ACM
13 years 9 months ago
Computational soundness of observational equivalence
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
Hubert Comon-Lundh, Véronique Cortier
SDL
2001
73views Hardware» more  SDL 2001»
13 years 9 months ago
HyperMSCs with Connectors for Advanced Visual System Modelling and Testing
Experiences with the use of the MSC language for complex system specifications have shown that certain extensions are necessary in order to arrive at sufficiently transparent and m...
Jens Grabowski, Peter Graubmann, Ekkart Rudolph
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman
ENTCS
2010
88views more  ENTCS 2010»
13 years 5 months ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King