Sciweavers

525 search results - page 60 / 105
» Using Checkable Types in Automatic Protocol Analysis
Sort
View
ERSHOV
2009
Springer
14 years 26 days ago
Anti-unification Algorithms and Their Applications in Program Analysis
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
TASLP
2002
156views more  TASLP 2002»
13 years 8 months ago
Musical genre classification of audio signals
Abstract--Musical genres are categorical labels created by humans to characterize pieces of music. A musical genre is characterized by the common characteristics shared by its memb...
George Tzanetakis, Perry R. Cook
SIGSOFT
2005
ACM
14 years 9 months ago
Lightweight object specification with typestates
Previous work has proven typestates to be useful for modeling protocols in object-oriented languages. We build on this work by addressing substitutability of subtypes as well as i...
Kevin Bierhoff, Jonathan Aldrich
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
14 years 5 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
ESORICS
2009
Springer
14 years 9 months ago
Model-Checking DoS Amplification for VoIP Session Initiation
Current techniques for the formal modeling analysis of DoS attacks do not adequately deal with amplification attacks that may target a complex distributed system as a whole rather ...
Carl A. Gunter, José Meseguer, Musab AlTurk...