The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Myla Archer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James Kirby, Myla Archer, Constance L. Heitmeyer
    SCR: A Practical Approach to Building a High Assurance COMSEC System. [Citation Graph (0, 0)][DBLP]
    ACSAC, 1999, pp:109-118 [Conf]
  2. Constance L. Heitmeyer, Myla Archer, Elizabeth I. Leonard, John D. McLean
    Formal specification and verification of data separation in a separation kernel for an embedded system. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2006, pp:346-355 [Conf]
  3. Myla Archer, Elizabeth I. Leonard, Matteo Pradella
    Modeling Security-Enhanced Linux Policy Specifications for Analysis. [Citation Graph (0, 0)][DBLP]
    DISCEX (2), 2003, pp:164-169 [Conf]
  4. Myla Archer, Constance L. Heitmeyer, Elvinia Riccobene
    Using TAME to prove invariants of automata models: Two case studies. [Citation Graph (0, 0)][DBLP]
    FMSP, 2000, pp:25-36 [Conf]
  5. James Kirby Jr., Myla Archer, Constance L. Heitmeyer
    Applying Formal Methods to an Information Security Device: An Experience Report. [Citation Graph (0, 0)][DBLP]
    HASE, 1999, pp:81-88 [Conf]
  6. Myla Archer, Constance L. Heitmeyer
    Verifying Hybrid Systems Modeled as Timed Automata: A Case Study. [Citation Graph (0, 0)][DBLP]
    HART, 1997, pp:171-185 [Conf]
  7. Deborah A. Frincke, Myla Archer, Karl N. Levitt
    CTPLAN: A Planning-Based Approach to Automatically Detecting Flaws in Concurrent Algorithms. [Citation Graph (0, 0)][DBLP]
    KBSE, 1991, pp:151-160 [Conf]
  8. Myla Archer
    Making PVS do what you want. [Citation Graph (0, 0)][DBLP]
    MEMOCODE, 2005, pp:67- [Conf]
  9. Elizabeth I. Leonard, Myla Archer
    Extended abstract: organizing automaton specifications to achieve faithful representation. [Citation Graph (0, 0)][DBLP]
    MEMOCODE, 2005, pp:245-246 [Conf]
  10. Myla Archer, Elizabeth I. Leonard, Matteo Pradella
    Analyzing Security-Enhanced Linux Policy Specifications. [Citation Graph (0, 0)][DBLP]
    POLICY, 2003, pp:158-0 [Conf]
  11. Myla Archer, Constance L. Heitmeyer
    Mechanical verification of timed automata: a case study. [Citation Graph (0, 0)][DBLP]
    IEEE Real Time Technology and Applications Symposium, 1996, pp:192-203 [Conf]
  12. Samuel N. Kamin, Myla Archer
    Partial Implementations of Abstract Data Types: A Dissenting view on Errors. [Citation Graph (0, 0)][DBLP]
    Semantics of Data Types, 1984, pp:317-336 [Conf]
  13. Myla Archer, George Fink, Lie Yang
    Linking Other Theorem Provers to HOL Using PM: Proof Manager. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1992, pp:539-548 [Conf]
  14. Myla Archer, Constance L. Heitmeyer
    Human-Style Theorem Proving Using PVS. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1997, pp:33-48 [Conf]
  15. George Fink, Myla Archer, Lie Yang
    PM: A Proof Manager for HOL and Other Provers. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1991, pp:286-304 [Conf]
  16. Saraswati Kalvala, Myla Archer, Karl N. Levitt
    Implementation and Use of Annotations in HOL. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1992, pp:407-426 [Conf]
  17. William L. Harrison, Myla Archer, Karl N. Levitt
    A HOL Mechanisation of the Axiomatic Semantics of a Simple Distributed Programming Language. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1992, pp:347-356 [Conf]
  18. Jing Pan, Karl N. Levitt, Myla Archer, Saraswati Kalvala
    Towards a Formal Verification of a Floating Point Coprocessor and its Composition with a Central Processing Unit. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 1992, pp:427-447 [Conf]
  19. Cui Zhang, Robert J. Shaw, Ronald A. Olsson, Karl N. Levitt, Myla Archer, Mark Heckman, Gregory D. Benson
    Mechanizing a Programming Logic for the Concurrent Programming Language microSR in HOL. [Citation Graph (0, 0)][DBLP]
    HUG, 1993, pp:29-42 [Conf]
  20. Myla Archer
    TAME: Using PVS strategies for special-purpose theorem proving. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2000, v:29, n:1-4, pp:139-181 [Journal]
  21. Myla Archer, Constance L. Heitmeyer, Elvinia Riccobene
    Proving Invariants of I/O Automata with TAME. [Citation Graph (0, 0)][DBLP]
    Autom. Softw. Eng., 2002, v:9, n:3, pp:201-232 [Journal]
  22. Constance L. Heitmeyer, Myla Archer, Ramesh Bharadwaj, Ralph D. Jeffords
    Tools for constructing requirements specifications: the SCR Toolset at the age of nine. [Citation Graph (0, 0)][DBLP]
    Comput. Syst. Sci. Eng., 2005, v:20, n:1, pp:- [Journal]
  23. Sayan Mitra, Myla Archer
    PVS Strategies for Proving Abstraction Properties of Automata. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:125, n:2, pp:45-65 [Journal]
  24. Myla Archer, Amy Lo, Ronald A. Olsson
    Towards a Transformational Approach to Program Verification. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 1999, v:9, n:2, pp:85-106 [Journal]
  25. Constance L. Heitmeyer, James Kirby, Bruce G. Labaw, Myla Archer, Ramesh Bharadwaj
    Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1998, v:24, n:11, pp:927-948 [Journal]
  26. Myla Archer, Hongping Lim, Nancy A. Lynch, Sayan Mitra, Shinya Umeno
    Specifying and proving properties of timed I/O automata in the TIOA toolkit. [Citation Graph (0, 0)][DBLP]
    MEMOCODE, 2006, pp:129-138 [Conf]
  27. Myla Archer, Thierry Boy de la Tour, César Muñoz
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:174, n:11, pp:1-2 [Journal]
  28. Hongping Lim, Myla Archer
    Translation Templates to Support Strategy Development in PVS. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:174, n:11, pp:59-79 [Journal]

  29. A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition. [Citation Graph (, )][DBLP]


  30. RE Theory Meets Software Practice: Lessons from the Software Development Trenches. [Citation Graph (, )][DBLP]


  31. Can We Build an Automatic Program Verifier? Invariant Proofs and Other Challenges. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002