Trace specifications: methodology and models

Hoffman, Daniel; Snodgrass, Richard T.

doi:10.1109/32.6168

Cited by 44 publications

(10 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even though this specification model was developed independently (Boudriga, Mili, Zalila, & Mili, 1992), it bears much resemblance to Parnas' trace specifications (Bartussek & Parnas, 1978;Hoffman & Snodgrass, 1988) and their extensions (Jacob, 2010).…”

Section: Axiomatic Specificationsmentioning

confidence: 96%

Putting engineering into software engineering: Upholding software engineering principles in the classroom

Tchier

Rabai²,

Mili

2015

Computers in Human Behavior

View full text Add to dashboard Cite

Section: Axiomatic Specificationsmentioning

confidence: 96%

Putting engineering into software engineering: Upholding software engineering principles in the classroom

Tchier

Rabai²,

Mili

2015

Computers in Human Behavior

View full text Add to dashboard Cite

“…Traces of various kinds have been widely used for specifying the behaviors of different types of systems ranging from ADTs [16,17] to processes in a distributed system [15,28]. In each case, elements in the traces are used to record information about important events in the system; the ordering of the elements in the trace represents the order in which the corresponding events took place.…”

Section: Specification and Verificationmentioning

confidence: 99%

“…This situation is pictorially represented in 2 and further discussed later in this section. Making suitable restrictions on the behavior of potential advice via the use of language constructs, minimizing the join point model, providing behavioral constraining assertions by adapting a rely/guarantee [39,18] methodology, which is the focus of our previous work [19,35], and using predicates and/or functions on specifications themselves as in [16], which is a focus of our future work, may help alleviate several of these obstacles.…”

Section: Introductionmentioning

confidence: 99%

Enforcing behavioral constraints in evolving aspect-oriented programs

Khatchadourian

Dovland

Soundarajan

2008

Proceedings of the 7th Workshop on Foundations of Aspect-Oriented Languages

View full text Add to dashboard Cite

Reasoning, specification, and verification of Aspect-Oriented (AO) programs presents unique challenges especially as such programs evolve over time. Components, base-code and aspects alike, may be easily added, removed, interchanged, or presently unavailable at unpredictable frequencies. Consequently, modular reasoning of such programs is highly attractive as it enables tractable evolution, otherwise necessitating that the entire program be reexamined each time a component is changed. It is well known, however, that modular reasoning about AO programs is difficult. In this paper, we present our ongoing work in constructing a relyguarantee style reasoning system for the Aspect-Oriented Programming (AOP) paradigm, adopting a trace-based approach to deal with the plug-n-play nature inherent to these programs, thus easing AOP evolution.

show abstract

“…For this purpose, our system uses a context-free grammar extended by attributes, known as attribute grammar [2]. This decision followed an in-depth review of several grammars and languages, including graph grammars [6], state transition graphs based on NLC [41], trace languages [21], and the aforementioned attribute grammars.…”

Section: Formal Definitionmentioning

confidence: 99%

SEQUIN: a grammar inference framework for analyzing malicious system behavior

Luh

Schramm

Wagner

et al. 2018

J Comput Virol Hack Tech

View full text Add to dashboard Cite

Targeted attacks on IT systems are a rising threat to the confidentiality of sensitive data and the availability of critical systems. The emergence of Advanced Persistent Threats (APTs) made it paramount to fully understand the particulars of such attacks in order to improve or devise effective defense mechanisms. Grammar inference paired with visual analytics (VA) techniques offers a powerful foundation for the automated extraction of behavioral patterns from sequential event traces. To facilitate the interpretation and analysis of APTs, we present SEQUIN, a grammar inference system based on the Sequitur compression algorithm that constructs a context-free grammar (CFG) from string-based input data. In addition to recursive rule extraction, we expanded the procedure through automated assessment routines capable of dealing with multiple input sources and types. This automated assessment enables the accurate identification of interesting frequent or anomalous patterns in sequential corpora of arbitrary quantity and origin. On the formal side, we extended the CFG with attributes that help describe the extracted (malicious) actions. Discovery-focused pattern visualization of the output is provided by our dedicated KAMAS VA prototype.

show abstract

Trace specifications: methodology and models

Cited by 44 publications

References 16 publications

Putting engineering into software engineering: Upholding software engineering principles in the classroom

Putting engineering into software engineering: Upholding software engineering principles in the classroom

Enforcing behavioral constraints in evolving aspect-oriented programs

SEQUIN: a grammar inference framework for analyzing malicious system behavior

Contact Info

Product

Resources

About