The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ursula Martin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ursula Martin, Tobias Nipkow
    Unification in Boolean Rings. [Citation Graph (1, 0)][DBLP]
    J. Autom. Reasoning, 1988, v:4, n:4, pp:381-396 [Journal]
  2. A. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
    VSDITLU: a verifiable symbolic definite integral table look-up. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:112-126 [Conf]
  3. Simon Colton, Volker Sorge, Ursula Martin
    Workshop: The Role of Automated Deduction in Mathematics. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:517- [Conf]
  4. Steve Linton, Ursula Martin, Péter Pröhle, Duncan Shand
    Algebra and Automated Deduction. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:448-462 [Conf]
  5. Ursula Martin
    Termination, Geometry and Invariants. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:432-434 [Conf]
  6. Ursula Martin
    Theorem Proving with Group Presentations: Examples and Questions. [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:358-372 [Conf]
  7. Ursula Martin, Tobias Nipkow
    Unification in Boolean Rings. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:506-513 [Conf]
  8. Ursula Martin, Tobias Nipkow
    Ordered Rewriting and Confluence. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:366-380 [Conf]
  9. Ursula Martin, Erik A. Mathiesen, Paulo Oliva
    Hoare Logic in the Abstract. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:501-515 [Conf]
  10. Martin Dunstan, Tom Kelsey, Ursula Martin, Steve Linton
    Formal Methods for Extensions to CAS. [Citation Graph (0, 0)][DBLP]
    World Congress on Formal Methods, 1999, pp:1758-1777 [Conf]
  11. Ursula Martin, M. Thomas
    Verification Techniques for LOTOS. [Citation Graph (0, 0)][DBLP]
    FME, 1994, pp:83-92 [Conf]
  12. Richard J. Boulton, Ruth Hardy, Ursula Martin
    A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems. [Citation Graph (0, 0)][DBLP]
    HSCC, 2003, pp:113-125 [Conf]
  13. Richard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom Kelsey, Ursula Martin
    Design Verification for Control Engineering. [Citation Graph (0, 0)][DBLP]
    IFM, 2004, pp:21-35 [Conf]
  14. A. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
    Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:253-260 [Conf]
  15. Martin Dunstan, Tom Kelsey, Steve Linton, Ursula Martin
    Lightweight Formal Methods for Computer Algebra Systems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:80-87 [Conf]
  16. Ursula Martin, Elizabeth Scott
    The order types of termination orderings on monadic terms, strings and multisets [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:356-363 [Conf]
  17. Ursula Martin
    How to Choose Weights in the Knuth Bendix Ordering. [Citation Graph (0, 0)][DBLP]
    RTA, 1987, pp:42-53 [Conf]
  18. Ursula Martin
    Linear Interpretations by Counting Patterns. [Citation Graph (0, 0)][DBLP]
    RTA, 1993, pp:421-433 [Conf]
  19. Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin, Sam Owre
    Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2001, pp:27-42 [Conf]
  20. Nick Cropper, Ursula Martin
    The Classification of Polynomial Orderings on Monadic Terms. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2001, v:12, n:3, pp:197-226 [Journal]
  21. Jeremy Dick, John Kalmus, Ursula Martin
    Automating the Knuth Bendix Ordering. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1990, v:28, n:2, pp:95-119 [Journal]
  22. Ursula Martin
    On the Diversity of Orderings on Strings. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:24, n:1/2, pp:25-46 [Journal]
  23. Ursula Martin
    Extension Functions for Multiset Orderings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:181-186 [Journal]
  24. Ursula Martin
    A Note on Division Orderings on Strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:5, pp:237-240 [Journal]
  25. Hanne Gottliebsen, Tom Kelsey, Ursula Martin
    Hidden verification for computational mathematics. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:39, n:5, pp:539-567 [Journal]
  26. Ursula Martin, M. Lai
    Some Experiments with a Completion Theorem Prover. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1992, v:13, n:1, pp:81-100 [Journal]
  27. Ursula Martin, Tobias Nipkow
    Boolean Unification - The Story So Far. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:3/4, pp:275-293 [Journal]
  28. Ursula Martin, Duncan Shand
    Invariants, Patterns and Weights for Ordering Terms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:29, n:6, pp:921-957 [Journal]
  29. Ursula Martin, Elizabeth Scott
    The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:2, pp:624-635 [Journal]
  30. Ursula Martin
    A Geometrical Approach to Multiset Orderings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:1, pp:17-54 [Journal]

  31. A General Framework for Sound and Complete Floyd-Hoare Logics [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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