The SCEAS System
Navigation Menu

Search the dblp DataBase


Konrad Slind: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jeffrey Joyce, Greg Lomow, Konrad Slind, Brian Unger
    Monitoring Distributed Systems. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Comput. Syst., 1987, v:5, n:2, pp:121-150 [Journal]
  2. Konrad Slind
    Wellfounded Schematic Definitions. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:45-63 [Conf]
  3. Konrad Slind, Michael J. C. Gordon, Richard J. Boulton, Alan Bundy
    System Description: An Interface Between CLAM and HOL. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:134-138 [Conf]
  4. Michael J. C. Gordon, Joe Hurd, Konrad Slind
    Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CHARME, 2003, pp:200-215 [Conf]
  5. Sudhindra Pandav, Konrad Slind, Ganesh Gopalakrishnan
    Counterexample Guided Invariant Discovery for Parameterized Cache Coherence Verification. [Citation Graph (0, 0)][DBLP]
    CHARME, 2005, pp:317-331 [Conf]
  6. Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, Konrad Slind
    Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT. [Citation Graph (0, 0)][DBLP]
    CHARME, 2003, pp:81-95 [Conf]
  7. Richard J. Boulton, Konrad Slind
    Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:629-643 [Conf]
  8. Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, Konrad Slind
    Nemos: A Framework for Axiomatic and Executable Specifications of Memory Consistency Models. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  9. Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens, Konrad Slind, Junxing Zhang
    Functional Correctness Proofs of Encryption Algorithms. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:519-533 [Conf]
  10. Louise A. Dennis, Graham Collins, Michael Norrish, Richard J. Boulton, Konrad Slind, Graham Robinson, Michael J. C. Gordon, Thomas F. Melham
    The PROSPER Toolkit. [Citation Graph (0, 0)][DBLP]
    TACAS, 2000, pp:78-92 [Conf]
  11. Richard J. Boulton, Konrad Slind, Alan Bundy, Michael J. C. Gordon
    An Interface between Clam and HOL. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1998, pp:87-104 [Conf]
  12. John Harrison, Konrad Slind, Rob Arthan
    HOL. [Citation Graph (0, 0)][DBLP]
    The Seventeen Provers of the World, 2006, pp:11-19 [Conf]
  13. Konrad Slind
    Another Look at Nested Recursion. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2000, pp:498-518 [Conf]
  14. Konrad Slind
    Adding New Rules to an LCF-style Logic Implementation. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1992, pp:549-559 [Conf]
  15. Konrad Slind
    AC Unification in HOL90. [Citation Graph (0, 0)][DBLP]
    HUG, 1993, pp:436-449 [Conf]
  16. Konrad Slind
    A Parameterized Proof Manager. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1994, pp:407-423 [Conf]
  17. Konrad Slind
    Function Definition in Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1996, pp:381-397 [Conf]
  18. Konrad Slind
    Derivation and Use of Induction Schemes in Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1997, pp:275-290 [Conf]
  19. Konrad Slind, Joe Hurd
    Applications of Polytypism in Theorem Proving. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2003, pp:103-119 [Conf]
  20. Michael Norrish, Konrad Slind
    Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2005, pp:397-408 [Conf]
  21. Tobias Nipkow, Konrad Slind
    I/Q Automata in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    TYPES, 1994, pp:101-119 [Conf]
  22. Olaf Müller, Konrad Slind
    Treating Partiality in a Logic of Total Functions. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1997, v:40, n:10, pp:640-652 [Journal]
  23. Michael Norrish, Konrad Slind
    A Thread of HOL Development. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2002, v:45, n:1, pp:37-45 [Journal]
  24. Mike Gordon, Juliano Iyoda, Scott Owens, Konrad Slind
    Automatic Formal Synthesis of Hardware from Higher Order Logic. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:145, n:, pp:27-43 [Journal]
  25. Louise A. Dennis, Graham Collins, Michael Norrish, Richard J. Boulton, Konrad Slind, Thomas F. Melham
    The PROSPER toolkit. [Citation Graph (0, 0)][DBLP]
    STTT, 2003, v:4, n:2, pp:189-210 [Journal]
  26. Annette Bunker, Ganesh Gopalakrishnan, Konrad Slind
    Live sequence charts applied to hardware requirements specification and verification. [Citation Graph (0, 0)][DBLP]
    STTT, 2005, v:7, n:4, pp:341-350 [Journal]
  27. Guodong Li, Konrad Slind
    Compilation as Rewriting in Higher Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:19-34 [Conf]
  28. Guodong Li, Scott Owens, Konrad Slind
    Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:205-219 [Conf]
  29. Matt Kaufmann, Konrad Slind
    Proof Pearl: Wellfounded Induction on the Ordinals Up to epsilon 0. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2007, pp:294-301 [Conf]
  30. Konrad Slind, Scott Owens, Juliano Iyoda, Mike Gordon
    Proof producing synthesis of arithmetic and cryptographic hardware. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2007, v:19, n:3, pp:343-362 [Journal]

  31. Extensible Proof-Producing Compilation. [Citation Graph (, )][DBLP]

  32. Machine-Code Verification for Multiple Architectures - An Application of Decompilation into Logic. [Citation Graph (, )][DBLP]

  33. Trusted Source Translation of a Total Function Language. [Citation Graph (, )][DBLP]

  34. A Brief Overview of HOL4. [Citation Graph (, )][DBLP]

Search in 0.018secs, Finished in 0.020secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002