9 papers:
- RTA-2012-CreusGG #unification
- One-context Unification with STG-Compressed Terms is in NP (CC, AG, GG), pp. 149–164.
- FoSSaCS-2005-SchaeferV #component #composition #refinement
- Component Refinement and CSC Solving for STG Decomposition (MS, WV), pp. 348–363.
- DATE-2003-SokolovBY #optimisation
- STG Optimisation in the Direct Mapping of Asynchronous Circuits (DS, AVB, AY), pp. 10932–10939.
- PPDP-2003-EncinaP
- Formally deriving an STG machine (AdlE, RP), pp. 102–112.
- TACAS-2002-ClarkeJRZ #generative #named #testing
- STG: A Symbolic Test Generation Tool (DC, TJ, VR, EZ), pp. 470–475.
- IFL-2001-EncinaP #correctness #proving
- Proving the Correctness of the STG Machine (AdlE, RP), pp. 88–104.
- ESEC-FSE-2001-ClarkeJRZ #generative #named #source code #specification
- STG: a tool for generating symbolic test programs and oracles from operational specifications (DC, TJ, VR, EZ), pp. 301–302.
- DAC-1997-SemenovYPPC #independence #synthesis
- Synthesis of Speed-Independent Circuits from STG-Unfolding Segment (ALS, AY, EP, MAP, JC), pp. 16–21.
- IFL-1997-HolyerS
- The Brisk Machine: A Simplified STG Machine (IH, ES), pp. 20–38.