dblp.uni-trier.dewww.uni-trier.de

Ursula Martin Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
33EEDenise W. Gürer, Jennifer Light, Christina Björkman, Rhian Davies, Mark S. Hancock, Anne Condon, Annemieke Craig, Vashti Galpin, Ursula Martin, Margit Pohl, Sylvia Wiltner, M. Suriya, Ellen Spertus, Joanne McGrath Cohoon, Gloria Childress Townsend, Paula Gabbert: Women in Computing. Wiley Encyclopedia of Computer Science and Engineering 2008
32EERob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva: A General Framework for Sound and Complete Floyd-Hoare Logics CoRR abs/0807.1016: (2008)
2006
31EEUrsula Martin, Erik A. Mathiesen, Paulo Oliva: Hoare Logic in the Abstract. CSL 2006: 501-515
2005
30EEHanne Gottliebsen, Tom Kelsey, Ursula Martin: Hidden verification for computational mathematics. J. Symb. Comput. 39(5): 539-567 (2005)
2004
29EERichard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom Kelsey, Ursula Martin: Design Verification for Control Engineering. IFM 2004: 21-35
2003
28EERichard J. Boulton, Ruth Hardy, Ursula Martin: A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems. HSCC 2003: 113-125
2001
27EEAndrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin, Sam Owre: Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS. TPHOLs 2001: 27-42
26EENick Cropper, Ursula Martin: The Classification of Polynomial Orderings on Monadic Terms. Appl. Algebra Eng. Commun. Comput. 12(3): 197-226 (2001)
2000
25EESimon Colton, Volker Sorge, Ursula Martin: Workshop: The Role of Automated Deduction in Mathematics. CADE 2000: 517
24 Ursula Martin, Duncan Shand: Invariants, Patterns and Weights for Ordering Terms. J. Symb. Comput. 29(6): 921-957 (2000)
1999
23EEA. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin: VSDITLU: a verifiable symbolic definite integral table look-up. CADE 1999: 112-126
22EEA. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin: Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study. ISSAC 1999: 253-260
21EEMartin Dunstan, Tom Kelsey, Ursula Martin, Steve Linton: Formal Methods for Extensions to CAS. World Congress on Formal Methods 1999: 1758-1777
1998
20EEMartin Dunstan, Tom Kelsey, Steve Linton, Ursula Martin: Lightweight Formal Methods for Computer Algebra Systems. ISSAC 1998: 80-87
1997
19 Ursula Martin, Elizabeth Scott: The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets. J. Symb. Log. 62(2): 624-635 (1997)
1996
18EEUrsula Martin: Theorem Proving with Group Presentations: Examples and Questions. CADE 1996: 358-372
17EESteve Linton, Ursula Martin, Péter Pröhle, Duncan Shand: Algebra and Automated Deduction. CADE 1996: 448-462
1995
16 Ursula Martin: On the Diversity of Orderings on Strings. Fundam. Inform. 24(1/2): 25-46 (1995)
1994
15EEUrsula Martin: Termination, Geometry and Invariants. CADE 1994: 432-434
14EEUrsula Martin, M. Thomas: Verification Techniques for LOTOS. FME 1994: 83-92
1993
13 Ursula Martin, Jeannette M. Wing: First International Workshop on Larch, Proceedings of the first First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992 Springer 1993
12 Ursula Martin, Elizabeth Scott: The order types of termination orderings on monadic terms, strings and multisets LICS 1993: 356-363
11EEUrsula Martin: Linear Interpretations by Counting Patterns. RTA 1993: 421-433
1992
10 Ursula Martin, M. Lai: Some Experiments with a Completion Theorem Prover. J. Symb. Comput. 13(1): 81-100 (1992)
1990
9EEUrsula Martin, Tobias Nipkow: Ordered Rewriting and Confluence. CADE 1990: 366-380
8 Jeremy Dick, John Kalmus, Ursula Martin: Automating the Knuth Bendix Ordering. Acta Inf. 28(2): 95-119 (1990)
7 Ursula Martin: A Note on Division Orderings on Strings. Inf. Process. Lett. 36(5): 237-240 (1990)
1989
6 Ursula Martin, Tobias Nipkow: Boolean Unification - The Story So Far. J. Symb. Comput. 7(3/4): 275-293 (1989)
5 Ursula Martin: A Geometrical Approach to Multiset Orderings. Theor. Comput. Sci. 67(1): 17-54 (1989)
1988
4 Ursula Martin, Tobias Nipkow: Unification in Boolean Rings. J. Autom. Reasoning 4(4): 381-396 (1988)
1987
3EEUrsula Martin: How to Choose Weights in the Knuth Bendix Ordering. RTA 1987: 42-53
2 Ursula Martin: Extension Functions for Multiset Orderings. Inf. Process. Lett. 26(4): 181-186 (1987)
1986
1EEUrsula Martin, Tobias Nipkow: Unification in Boolean Rings. CADE 1986: 506-513

Coauthor Index

1A. A. Adams [22] [23]
2Andrew Adams [27]
3Rob Arthan [32]
4Christina Björkman [33]
5Richard J. Boulton [28] [29]
6Joanne McGrath Cohoon [33]
7Simon Colton [25]
8Anne Condon [33]
9Annemieke Craig [33]
10Nick Cropper [26]
11Rhian Davies [33]
12Jeremy Dick [8]
13Martin Dunstan [20] [21] [27]
14Paula Gabbert [33]
15Vashti Galpin (Vashti C. Galpin) [33]
16Hanne Gottliebsen [22] [23] [27] [29] [30]
17Denise W. Gürer [33]
18Mark S. Hancock [33]
19Ruth Hardy [28] [29]
20John Kalmus [8]
21Tom Kelsey [20] [21] [27] [29] [30]
22M. Lai [10]
23Jennifer Light [33]
24Steve Linton [17] [20] [21] [22] [23]
25Erik A. Mathiesen [31] [32]
26Tobias Nipkow [1] [4] [6] [9]
27Paulo Oliva [31] [32]
28Sam Owre [27]
29Margit Pohl [33]
30Péter Pröhle [17]
31Elizabeth Scott [12] [19]
32Duncan Shand [17] [24]
33Volker Sorge [25]
34Ellen Spertus [33]
35M. Suriya [33]
36M. Thomas [14]
37Gloria Childress Townsend [33]
38Sylvia Wiltner [33]
39Jeannette M. Wing [13]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)