MVC-based content management on the cloud

Cloud computing describes a new distributed computing paradigm for IT data and services that involves over-the-Internet provision of dynamically scalable and often virtualized resources. While cost reduction and flexibility in storage, services, and maintenance are important considerations when deciding on whether or how to migrate data and applications to the cloud, large organizations like the Department of Defense need to consider the organization and structure of data on the cloud and the operations on such data in order to reap the full benefit of cloud computing. This report describes a cloud adaptation of Model View Controller (MVC) software engineering architectural pattern and its effect on content management in the cloud. We propose an architecture that separates the model, view, and controller aspects of a document thereby allowing greater flexibility, portability, and interoperability for document objects.N6133904WX00137Approved for public release; distribution is unlimited

On-line Monitoring of Metric Temporal Logic with Time- Series Constraints Using Alternating Finite Automata

In this paper we describe a technique for monitoring and checking temporal logic assertions augmented with real-time and time-series constraints, or Metric Temporal Logic Series (MTLS). The method is based on Remote Execution and Monitoring (REM) of temporal logic assertions. We describe the syntax and semantics of MTLS and a monitoring technique based on alternating finite automata that is efficient for a large set of frequently used formulae and is also an on-line technique. We investigate the run-time data-structure size for several interesting assertions taken from the Kansas State specification patterns

UML-based specification, validation, and log-file based verification of the Orion Pad Abort Software

This paper described the first end to end application of a novel light weight formal specification, validation, and verification technique. The technique is novel is two aspects. First, it uses an intuitive, familiar, and diagrammatic notation for formal specification, a notation that being Turing equivalent and supports the capture of real-life requirements. Second, the technique includes a computer aided approach for validating the correctness of requirements early in the development process, allowing sufficient time for the correction of ambiguous and underspecified requirements. In the verification phase the technique is based on off-line verification using log-files. This approach scales well and is applicable to almost every mission critical system, including real-time systems. The paper describes the application of this technique towards the specification, validation, and verification of the Pad Abort subsystem of NASA's Orion mission.Approved for public release; distribution is unlimited

Test-time, Run-time, and Simulation-time Temporal Assertions in RSPCreation and Validation of Embedded Assertion Statecharts

Proceedings of the 16th International Workshop on Rapid System Prototyping (RSP’05)For cost-effective prototyping, system designers should have a clear understanding of the intended use of the prototype under development. This paper describes a classification of formal specification (temporal) assertions used during system prototyping. The classification introduces two new classes of assertions in addition to the well-known class of test-time assertions: (i) assertions used only during simulation, and (ii) deployable assertions integrated with run-time control flow. Separating the formal specification into three distinct classes allows system designers to de- velop more effective prototypes to evaluate the different system behaviors and constraints. A prototype of a naval torpedo system is used to illustrate the concept.The research reported in this article was funded in part by a grant from the U.S. Missile Defense Agency

Formal Verification of Cyberphysical Systems

17 USC 105 interim-entered record; under review.Computer hosts a virtual roundtable with seven experts to discuss the formal specification and verification of cyberphysical systems.http://hdl.handle.net/10945/6944

Research on Deception in Defense of Information Systems

This paper appeared in the Command and Control Research and Technology Symposium, San Diego, CA, June 2004.Our research group has been broadly studying the use of deliberate deception by software to foil attacks on information systems. This can provide a second line of defense when access controls have been breached or against insider attacks. The thousands of new attacks being discovered every year that subvert access controls say that such a second line of defense is desperately needed. We have developed a number of demonstration systems, including a fake directory system intended to waste the time of spies, a Web information resource that delays suspicious requests, a modified file-download utility that pretends to succumb to a buffer overflow, and a tool for systematically modifying an operating system to insert deceptive responses. We are also developing an associated theory of deception that can be used to analyze and create offensive and defensive deceptions, with especial attention to reasoning about time using temporal logic. We conclude with some discussion of the legal implications of deception by computers.Approved for public release; distribution is unlimited

State Estimation of Non-monotonic, Partially Non-deterministic Software with Sparse Probing using an Unscented Kalman Filter combined with Logic Reasoning

This report describes a technique for assessing the state of a general-purpose system using partial probing. The technique utilizes an Unscented Kalman Filter (UKF) combined with in-process and post-process reasoning. While Kalman Filters (KF) Extended Kalman Filres (EKF), and UKF are typically applied to state-space systems, where an underlying theory provides the a-priori knowledge, this report suggests the application of UKF to monitor general-purpose software systems that do not have an underlying first-principles theory. The suggested technique uses a reasoning component compute the a-priori evaluation. An important aspect differentiating state-space systems from general-purpose software is that the latter is often concurrent, with a plurality or concurrently executing threads, processes, or devices. As a result, relative execution time of these components (and the derivative state space) is for all intents and purposes non-deterministic. In addition, the suggested technique enables monitoring with probing that is sparse in time and space namely, probing that occurs only one in n cycles or probing that only probes a subset of the software-systems state-spaceApproved for public release; distribution is unlimited

Reverse engineering concurrent UML state machines using black box testing and genetic programming

The article of record as published may be found at http://link.springer.com/article/10.1007/s11334-017-0299-9This paper presents a technique for reverse engineering, a software system generated from a concurrent unified modeling language state machine implementation. In its first step, a primitive sequential finite-state machine (FSM) is deduced from a sequence of outputs emitted from black box tests applied to the systems’ input interface. Next, we provide an algorithmic technique for decomposing the sequential primitive FSM into a set of concurrent (orthogonal) primitive FSMs. Lastly,we showa genetic programming machine learning technique for discovering local variables, actions performed on local and non-binary output variables, and two types of intra-FSM loops, called counting-loops and while-loops