On the theory of patching

Pap, Zoltán; Csopaki, Gyula; Dibuz, Sarolta

doi:10.1109/sefm.2005.31

Cited by 3 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A consistent approach for representing changes to FSM systems has been proposed in [12]. Atomic changes to a finite state machine M are represented by the means of edit operators ω M : T → T .…”

Section: Representing Changes To Fsmsmentioning

confidence: 99%

“…An output change operator is ω o (s j , i, o x , s k ) = (s j , i, o y , s k ), where λ(s j , i) = o x = o y = λ (s j , i). It has been shown in [12], that with some assumptions the set of deterministic finite state machines with a given number of states is closed under the edit operations defined above. Furthermore, for any two deterministic FSMs M 1 and M 2 there is always a sequence of edit operations changing M 1 to M 2 , i.e., to a machine isomorphic to M 2 .…”

Section: Representing Changes To Fsmsmentioning

confidence: 99%

See 1 more Smart Citation

A Bounded Incremental Test Generation Algorithm for Finite State Machines

Pap

Subramaniam

Kovács

et al. 2007

Testing of Software and Communicating Systems

View full text Add to dashboard Cite

We propose a bounded incremental algorithm to generate test cases for deterministic finite state machine models. Our approach, in contrast to the traditional view, is based on the observation that system specifications are in most cases modified incrementally in practice as requirements evolve. We utilize an existing test set available for a previous version of the system to efficiently generate tests for the current -modified -system.We use a widely accepted framework to evaluate the complexity of the proposed incremental algorithm, and show that it is a function of the size of the change in the specification rather than the size of the specification itself. Thus, the method is very efficient in the case of small changes, and never performs worse than the relevant traditional algorithm -the HIS-method. We also demonstrate our algorithm through an example.

show abstract

Section: Representing Changes To Fsmsmentioning

confidence: 99%

Section: Representing Changes To Fsmsmentioning

confidence: 99%

A Bounded Incremental Test Generation Algorithm for Finite State Machines

Pap

Subramaniam

Kovács

et al. 2007

Testing of Software and Communicating Systems

View full text Add to dashboard Cite

show abstract

Analyzing the Impact of Protocol Changes on Tests

Subramaniam

Pap

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Protocols governing communication among system components evolve during design and maintenance and need to be re-tested. For faster testing turnaround time, it is important that the consistency of the testing infrastructure with the protocol be preserved across changes. In this paper, we propose a state exploration based approach to identify the impacts of protocol changes on a given set of protocol tests. Protocols are modeled as a network of communicating finite state machines exchanging messages over bounded queues. Each machine denotes the behavior of an individual protocol component (controller). A protocol test is modeled as a sequence of inputs from the environment to the protocol controllers in an execution starting from a stable protocol state. A notion of consistency of a test relative to a protocol is introduced. Conditions under which a protocol change requires changing a test to preserve the consistency of the test are identified. Changes consisting of multiple atomic updates are analyzed to remove redundancies and their impact on tests is studied. A by-product of the proposed approach is a classification of tests based on how they are impacted by protocol changes, which can help users in regression test selection.

show abstract

Maximizing an Organization's Information Security Posture by Distributedly Assessing and Remedying System Vulnerabilities

Nunez

2008

2008 IEEE International Conference on Networking, Sensing and Control

View full text Add to dashboard Cite

Updating systems for security vulnerabilities has become a cumbersome yet necessary evil in today's environment of zero-day exploits and ever-changing threat matrix. The current state of affairs for the vulnerability and threat management functions are in dire need of a solution that can rapidly assess systems for vulnerabilities and fix them expeditiously. This will guarantee the effective reconnaissance of critical vulnerabilities in a more concise and cohesive fashion throughout all industries affected by the inherent risk in systems and applications, This will also help defend against super-fast worms and other malicious mobile code that can blaze through an organization's network leaving a path of compromised systems and reduced availability. The top-down centralized model for vulnerability assessment and remediation has proven inefficient and riddled with multiple vulnerabilities itself; the irony is befuddling. In this paper, we propose a framework to enhance an organization's information security posture by distributedly assessing and remedying system vulnerabilities. By creating and utilizing the proposed framework, we can ensure more vigilance, a progressive and reactive implementation of a patch-management and worm defense strategy, and increased efficiency in the distribution of updates. Malicious mobile code, specifically worms, are very efficient in their distribution, this is because they are able to infect other systems in a peer-to-peer distributed fashion. By utilizing a similar approach to vulnerability assessment and patch management we can ensure a higher coverage and redundancy for all systems within and organization. The framework proposed in this paper is timely since most peer-topeer distribution models focus more on content delivery and resource re-allocation.

show abstract

On the theory of patching

Cited by 3 publications

References 20 publications

A Bounded Incremental Test Generation Algorithm for Finite State Machines

A Bounded Incremental Test Generation Algorithm for Finite State Machines

Analyzing the Impact of Protocol Changes on Tests

Maximizing an Organization's Information Security Posture by Distributedly Assessing and Remedying System Vulnerabilities

Contact Info

Product

Resources

About