5 papers:
TACAS-2015-TomascoI0TP #contest #memory management- MU-CSeq 0.3: Sequentialization by Read-Implicit and Coarse-Grained Memory Unwindings — (Competition Contribution) (ET, OI, BF, SLT, GP), pp. 436–438.
- TACAS-2015-TomascoI0TP15a #concurrent #memory management #source code #verification
- Verifying Concurrent Programs by Memory Unwinding (ET, OI, BF, SLT, GP), pp. 551–565.
- TACAS-2014-TomascoI0TP #c #contest #memory management #named #source code
- MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings — (Competition Contribution) (ET, OI, BF, SLT, GP), pp. 402–404.
LOPSTR-2004-BossiPR #imperative #security- Unwinding Conditions for Security in Imperative Languages (AB, CP, SR), pp. 85–100.
VMCAI-2003-BossiFPR #bisimulation #security #verification- Bisimulation and Unwinding for Verifying Possibilistic Security Properties (AB, RF, CP, SR), pp. 223–237.
