American Heterosexual Young Adults’ Reasoning about their Expectations for Future Household Labor Participation

Despite being egalitarian, heterosexual young adults, especially women, predict a gendered division in their future household. The present study investigated 178 American heterosexual young adults’ (M = 20.56, 88.20% European American, 51% ciswomen) ideal and expected future household labor participation, their social attitudes and their justifications for their expectations. Participants were on average egalitarian in their attitudes and reasoning. Across the sample, gender norm reasoning was positively associated with expecting an unequal division, while equality reasoning was associated with expecting an equal division. A final model in which reasoning and attitudes were both included found that only being male and employing equality justifications was positively predictive of expecting an egalitarian division. The present study highlights the value of going beyond social attitudes and turning to investigating young adults’ underlying reasoning for understanding why gender (in)equality is expected and potentially perpetuated despite egalitarian ideals.

Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing

The theory of arrays has a central place in software verification due to its ability to model memory or data structures. Yet, this theory is known to be hard to solve in both theory and practice, especially in the case of very long formulas coming from unrolling-based verification methods. Standard simplification techniques à la read-over-write suffer from two main drawbacks: they do not scale on very long sequences of stores and they miss many simplification opportunities because of a crude syntactic (dis-)equality reasoning. We propose a new approach to array formula simplification based on a new dedicated data structure together with original simplifications and low-cost reasoning. The technique is efficient, scalable and it yields significant simplification. The impact on formula resolution is always positive, and it can be dramatic on some specific classes of problems of interest, e.g. very long formula or binary-level symbolic execution. While currently implemented as a preprocessing, the approach would benefit from a deeper integration in an array solver.