References

1. Skipping Simulation Model. Available at http://www.ccs.neu.edu/home/jmitesh/sks.
2. Martín Abadi & Leslie Lamport: The Existence of Refinement Mappings. In: Theoretical Computer Science, 1991. Available at http://dx.doi.org/10.1016/0304-3975(91)90224-P.
3. Krzysztof R Apt & Gordon D Plotkin: Countable nondeterminism and random assignment. Available at http://dx.doi.org/10.1145/6490.6494.
4. Clark W. Barrett, Yi Fang, Benjamin Goldberg, Ying Hu, Amir Pnueli & Lenore D. Zuck: TVOC: A Translation Validator for Optimizing Compilers. In: CAV, 2005. Available at http://dx.doi.org/10.1007/11513988_29.
5. Michael C. Browne, Edmund M. Clarke & Orna Grumberg: Characterizing Finite Kripke Structures in Propositional Temporal Logic. In: Theoretical Computer Science, 1988. Available at http://dx.doi.org/10.1016/0304-3975(88)90098-9.
6. Harsh Raju Chamarthi, Peter C. Dillinger & Panagiotis Manolios: Data Definitions in the ACL2 Sedan. In: ACL2 2014. Available at http://dx.doi.org/10.4204/EPTCS.152.3.
7. Harsh Raju Chamarthi, Peter C. Dillinger, Panagiotis Manolios & Daron Vroon: The ACL2 Sedan Theorem Proving System. In: TACAS 2011. Available at http://dx.doi.org/10.1007/978-3-642-19835-9_27.
8. Rob J. van Glabbeek: The Linear Time-Branching Time Spectrum (Extended Abstract). In: CONCUR 1990. Available at http://dx.doi.org/10.1007/BFb0039066.
9. David S Hardin: Real-time objects on the bare metal: an efficient hardware realization of the Java TM Virtual Machine. In: ISORC, 2001, doi:10.1109/ISORC.2001.922817.
10. Mitesh Jain & Panagiotis Manolios: Skipping Refinement. In: CAV, 2015. Available at http://dx.doi.org/10.1007/978-3-319-21690-4_7.
11. Samuel Larsen & Saman P. Amarasinghe: Exploiting superword level parallelism with multimedia instruction sets. In: PLDI, 2000. Available at http://doi.acm.org/10.1145/349299.349320.
12. P. Manolios: Mechanical verification of reactive systems. University of Texas.
13. Panagiotis Manolios: A Compositional Theory of Refinement for Branching Time. In: CHARME 2003. Available at http://dx.doi.org/10.1007/978-3-540-39724-3_28.
14. Panagiotis Manolios: Correctness of Pipelined Machines. In: FMCAD, 2000. Available at http://dx.doi.org/10.1007/3-540-40922-X_11.
15. Panagiotis Manolios & Sudarshan K. Srinivasan: A computationally effecient method based on commitment refinement maps for verifying pipelined machines. In: MEMOCODE, 2005. Available at http://dx.doi.org/10.1109/MEMCOD.2005.1487914.
16. Sandip Ray & Warren A. Hunt Jr.: Deductive Verification of Pipelined Machines Using First-Order Quantification. In: CAV 2004. Available at http://dx.doi.org/10.1007/978-3-540-27813-9_3.
17. Sandip Ray & Rob Sumners: Specification and Verification of Concurrent Programs Through Refinements. In: Journal of Automated Reasoning. Available at http://dx.doi.org/10.1007/s10817-012-9258-1.
18. Anna Slobodová, Jared Davis, Sol Swords & Warren A. Hunt Jr.: A flexible formal verification framework for industrial scale validation. In: MEMOCODE, 2011. Available at http://dx.doi.org/10.1109/MEMCOD.2011.5970515.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org