Sciweavers

165 search results - page 7 / 33
» Specification patterns can be formal and still easy
Sort
View
ANCS
2007
ACM
13 years 11 months ago
Optimization of pattern matching algorithm for memory based architecture
Due to the advantages of easy re-configurability and scalability, the memory-based string matching architecture is widely adopted by network intrusion detection systems (NIDS). In...
Cheng-Hung Lin, Yu-Tang Tai, Shih-Chieh Chang
IRI
2005
IEEE
14 years 19 days ago
AnyInformationHiding: a stable design pattern
The AnyInformationHiding design pattern models the concept of information hiding and the interactions between parties associated with it in any application. Information hiding is ...
Mohamed Fayad, Haritha Kilaru
ISSTA
2000
ACM
13 years 11 months ago
Classification schemes to aid in the analysis of real-time systems
This paper presents three sets of classification schemes for processes, properties, and transitions that can be used to assist in the analysis of real-time systems. These classifi...
Paul Z. Kolano, Richard A. Kemmerer
WABI
2001
Springer
142views Bioinformatics» more  WABI 2001»
13 years 11 months ago
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
Juris Viksna, David Gilbert
COMPSAC
2008
IEEE
13 years 8 months ago
Specifying Behavioural Features of Design Patterns in First Order Logic
The formal specification of design patterns is widely recognised as being vital to their effective and correct use in software development. It can clarify the concepts underlying ...
Ian Bayley, Hong Zhu