Despite the many automated techniques that benefit from dynamic invariant detection, to date, none are able to cap-ture and detect dynamic invariants at the interface of a pro-gram and its databases. This paper presents a dynamic invariant detection method for relational databases and for programs that use relational databases and an implemen-tation of the approach that leverages the Daikon dynamic-invariant engine. The method defines a mapping between re-lational database elements and Daikon’s notion of program points and variable observations, thus enabling row-level and column-level invariant detection. The paper also presents the results of two empirical evaluations on four fixed data sets and three subject programs. The first study sho...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
A data-driven rule is a rule that is activated as a result of modifications of data items in a datab...
A formal system for proving properties of programs accessing a database is introduced. Proving that ...
Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant...
AbstractDaikon is an implementation of dynamic detection of likely invariants; that is, the Daikon i...
Dynamic invariant detection is the process of distilling invariants from information about a program...
The use of dynamic invariants to describe software behaviour has gained increasing popularity and va...
Dynamic invariant detection is a software analysis technique that uses traces of function entry and ...
This paper describes three contributions I made to our system which collectively produce the executi...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Abstract. We provide a methodology which integrates dynamic feature generation from relational datab...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
AbstractThis paper shows how to integrate two complementary techniques for manipulating program inva...
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and...
The complexity of modern web applications increases as client-side JavaScript and dynamic DOM progra...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
A data-driven rule is a rule that is activated as a result of modifications of data items in a datab...
A formal system for proving properties of programs accessing a database is introduced. Proving that ...
Daikon is an implementation of dynamic detection of likely invariants; that is, the Daikon invariant...
AbstractDaikon is an implementation of dynamic detection of likely invariants; that is, the Daikon i...
Dynamic invariant detection is the process of distilling invariants from information about a program...
The use of dynamic invariants to describe software behaviour has gained increasing popularity and va...
Dynamic invariant detection is a software analysis technique that uses traces of function entry and ...
This paper describes three contributions I made to our system which collectively produce the executi...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Abstract. We provide a methodology which integrates dynamic feature generation from relational datab...
Abstract—Program invariants are statements or assertions that are widely used in program analysis an...
AbstractThis paper shows how to integrate two complementary techniques for manipulating program inva...
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and...
The complexity of modern web applications increases as client-side JavaScript and dynamic DOM progra...
This paper shows how to integrate two complementary techniques for manip-ulating program invariants:...
A data-driven rule is a rule that is activated as a result of modifications of data items in a datab...
A formal system for proving properties of programs accessing a database is introduced. Proving that ...