Search-based inference of polynomial metamorphic relations

J Zhang, J Chen, D Hao, Y Xiong, B Xie… - Proceedings of the 29th …, 2014 - dl.acm.org
Metamorphic testing (MT) is an effective methodology for testing those so-called``non-
testable''programs (eg, scientific programs), where it is sometimes very difficult for testers to …

Data-driven inference of representation invariants

A Miltner, S Padhi, T Millstein, D Walker - Proceedings of the 41st ACM …, 2020 - dl.acm.org
A representation invariant is a property that holds of all values of abstract type produced by a
module. Representation invariants play important roles in software engineering and …

Feedback-driven dynamic invariant discovery

L Zhang, G Yang, N Rungta, S Person… - Proceedings of the 2014 …, 2014 - dl.acm.org
Program invariants can help software developers identify program properties that must be
preserved as the software evolves, however, formulating correct invariants can be …

A context-awareness framework for intelligent networked embedded systems

A Badii, M Crouch, C Lallah - 2010 Third International …, 2010 - ieeexplore.ieee.org
This paper describes the Context Awareness Framework developed for the HYDRA
Middleware Project. The HYDRA project aims to develop middleware to support intelligent …

Assertion-based repair of complex data structures

B Elkarablieh, I Garcia, YL Suen… - Proceedings of the 22nd …, 2007 - dl.acm.org
Programmers have long used assertions to characterize properties of code. An assertion
violation signals a corruption in the programstate. At such a state, it is standard to terminate …

A HAT Trick: Automatically Verifying Representation Invariants Using Symbolic Finite Automata

Z Zhou, Q Ye, B Delaware, S Jagannathan - Proceedings of the ACM on …, 2024 - dl.acm.org
Functional programs typically interact with stateful libraries that hide state behind typed
abstractions. One particularly important class of applications are data structure …

Starc: static analysis for efficient repair of complex data

B Elkarablieh, S Khurshid, D Vu… - Proceedings of the 22nd …, 2007 - dl.acm.org
Data structure corruptions are insidious bugs that reduce the reliability of software systems.
Constraint-based datastructure repair promises to help programs recover from potentially …

Efficient synthesis of method call sequences for test generation and bounded verification

Y Zhang, R Zhu, Y Xiong, T Xie - Proceedings of the 37th IEEE/ACM …, 2022 - dl.acm.org
Modern programs are usually heap-based, where the programs manipulate heap-based
data structures to perform computations. In software engineering tasks such as test …

Universal symbolic execution and its application to likely data structure invariant generation

Y Kannan, K Sen - Proceedings of the 2008 international symposium on …, 2008 - dl.acm.org
Local data structure invariants are asserted over a bounded fragment of a data structure
around a distinguished node M of the data structure. An example of such an invariant for a …

DETERMIN: Inferring likely deterministic specifications of multithreaded programs

J Burnim, K Sen - Proceedings of the 32nd ACM/IEEE International …, 2010 - dl.acm.org
The trend towards multicore processors and graphic processing units is increasing the need
for software that can take advantage of parallelism. Writing correct parallel programs using …