Ursula Martin

2008
33	EE	Denise 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
32	EE	Rob Arthan, Ursula Martin, Erik A. Mathiesen, Paulo Oliva: A General Framework for Sound and Complete Floyd-Hoare Logics CoRR abs/0807.1016: (2008)
2006
31	EE	Ursula Martin, Erik A. Mathiesen, Paulo Oliva: Hoare Logic in the Abstract. CSL 2006: 501-515
2005
30	EE	Hanne Gottliebsen, Tom Kelsey, Ursula Martin: Hidden verification for computational mathematics. J. Symb. Comput. 39(5): 539-567 (2005)
2004
29	EE	Richard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom Kelsey, Ursula Martin: Design Verification for Control Engineering. IFM 2004: 21-35
2003
28	EE	Richard J. Boulton, Ruth Hardy, Ursula Martin: A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems. HSCC 2003: 113-125
2001
27	EE	Andrew 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
26	EE	Nick Cropper, Ursula Martin: The Classification of Polynomial Orderings on Monadic Terms. Appl. Algebra Eng. Commun. Comput. 12(3): 197-226 (2001)
2000
25		Simon 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
23	EE	A. A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin: VSDITLU: a verifiable symbolic definite integral table look-up. CADE 1999: 112-126
22	EE	A. 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
21	EE	Martin Dunstan, Tom Kelsey, Ursula Martin, Steve Linton: Formal Methods for Extensions to CAS. World Congress on Formal Methods 1999: 1758-1777
1998
20	EE	Martin 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
18		Ursula Martin: Theorem Proving with Group Presentations: Examples and Questions. CADE 1996: 358-372
17		Steve 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
15		Ursula Martin: Termination, Geometry and Invariants. CADE 1994: 432-434
14		Ursula 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
11		Ursula 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
9		Ursula 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
3		Ursula 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
1		Ursula Martin, Tobias Nipkow: Unification in Boolean Rings. CADE 1986: 506-513

Coauthor Index

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

Colors in the list of coauthors