1. Susanne Graf & Hassen Saïdi (1997): Construction of Abstract State Graphs with PVS. In: Computer Aided Verification, 9th International Conference, CAV '97, Haifa, Israel, June 22-25, 1997, Proceedings, pp. 72–83, doi:10.1007/3-540-63166-6_10.
  2. David A. Greve, Matt Kaufmann, Panagiotis Manolios, J. Strother Moore, Sandip Ray, José-Luis Ruiz-Reina, Rob Sumners, Daron Vroon & Matthew Wilding (2008): Efficient execution in an automated reasoning environment. J. Funct. Program. 18(1), pp. 15–46, doi:10.1017/S0956796807006338.
  3. Mitesh Jain & Panagiotis Manolios (2015): Proving Skipping Refinement with ACL2s. In: Proceedings Thirteenth International Workshop on the ACL2 Theorem Prover and Its Applications, Austin, Texas, USA, 1-2 October 2015., pp. 111–127, doi:10.4204/EPTCS.192.9.
  4. Matt Kaufmann, Panagiotis Manolios & J Strother Moore (2000): Computer-Aided Reasoning: An Approach. Kluwer Academic, doi:10.1007/978-1-4757-3188-0.
  5. Matt Kaufmann & Rob Sumners (2002): Efficient rewriting of data structures in ACL2. In: Kaufmann M. Moore J.S. Borrione, D.: Proceedings of 3rd International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2 2002).
  6. Marcel Kyas & Jozef Hooman (2006): Compositional Verification of Timed Components using PVS. In: Software Engineering 2006, Fachtagung des GI-Fachbereichs Softwaretechnik, 28.-31.3.2006 in Leipzig, pp. 143–154.
  7. Leslie Lamport (1974): A New Solution of Dijkstra's Concurrent Programming Problem. Commun. ACM 17(8), pp. 453–455, doi:10.1145/361082.361093.
  8. Panagiotis Manolios, Kedar S. Namjoshi & Robert Summers (1999): Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation. In: Computer Aided Verification, 11th International Conference, CAV '99, Trento, Italy, July 6-10, 1999, Proceedings, pp. 369–379, doi:10.1007/3-540-48683-6_32.
  9. Sandip Ray & Rob Sumners (2011): A theorem proving approach for verification of reactive concurrent programs. In: Chaudhury S. Farzan A. Gopalakrishnen G. Seigel S. Burckhardt, S.: 4th International Workshop on Exploiting Concurrency Efficiently and Correctly (EC2 2011).
  10. Sandip Ray & Rob Sumners (2013): Specification and Verification of Concurrent Programs Through Refinements. J. Autom. Reasoning 51(3), pp. 241–280, doi:10.1007/s10817-012-9258-1.

Comments and questions to:
For website issues: