Ursula Martin - RankMe

49 papers A* 1A 8B 4C 1Journal 22Unranked 11

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Enabling mathematical cultures: introduction. Synth. Benedikt Löwe, Ursula Martin, Alison Pease
2019	J	`jnl`	Women in Logic 2018 workshop report. ACM SIGLOG News Mihaela Rozman, Valeria de Paiva, Amy P. Felty, Ursula Martin
2018	J	`jnl`	Argumentation theory for mathematical argument. CoRR Joseph Corneli, Ursula Martin, Dave Murray-Rust, Gabriela Rino Nesin, Alison Pease
2018	—	`conf`	Automating "Human-Like" Example-Use in Mathematics. Bridging@IJCAI/ECAI Alison Pease, Ursula Martin
2017	—	`conf`	Modelling the way mathematics is actually done. FARM@ICFP Joseph Corneli, Ursula Martin, Dave Murray-Rust, Alison Pease, Raymond Puzio, Gabriela Rino Nesin
2017	C	`conf`	Towards Mathematical AI via a Model of the Content and Process of Mathematical Question and Answer Dialogues. CICM Joseph Corneli, Ursula Martin, Dave Murray-Rust, Alison Pease
2016	J	`jnl`	Computational logic and the social. J. Log. Comput. Ursula Martin
2015	—	`conf`	Ada Lovelace, a scientist in the archives. Ada Lovelace Symposium Søren Riis, Ursula Martin, Nick Woodhouse
2015	A	`conf`	Stumbling Around in the Dark: Lessons from Everyday Mathematics. CADE Ursula Martin
2013	J	`jnl`	A Hoare logic for linear systems. Formal Aspects Comput. Rob Arthan, Ursula Martin, Paulo Oliva
2013	J	`jnl`	Applications of real number theorem proving in PVS. Formal Aspects Comput. Hanne Gottliebsen, Ruth Hardy, Olga Lightfoot, Ursula Martin
2013	—	`conf`	Mathematical Practice, Crowdsourcing, and Social Machines. MKM/Calculemus/DML Ursula Martin, Alison Pease
2013	J	`jnl`	Mathematical practice, crowdsourcing, and social machines CoRR Ursula Martin, Alison Pease
2013	J	`jnl`	What does mathoverflow tell us about the production of mathematics? CoRR Ursula Martin, Alison Pease
2009	J	`jnl`	A general framework for sound and complete Floyd-Hoare logics. ACM Trans. Comput. Log. Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva
2008	J	`jnl`	A General Framework for Sound and Complete Floyd-Hoare Logics CoRR Rob Arthan, Ursula Martin, Erik Arne Mathiesen, Paulo Oliva
2008	—	`ch.`	Women in Computing. Wiley Encyclopedia of Computer Science and Engineering 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
2006	B	`conf`	Hoare Logic in the Abstract. CSL Ursula Martin, Erik Arne Mathiesen, Paulo Oliva
2005	J	`jnl`	Hidden verification for computational mathematics. J. Symb. Comput. Hanne Gottliebsen, Tom W. Kelsey, Ursula Martin
2004	B	`conf`	Design Verification for Control Engineering. IFM Richard J. Boulton, Hanne Gottliebsen, Ruth Hardy, Tom W. Kelsey, Ursula Martin
2003	—	`conf`	A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems. HSCC Richard J. Boulton, Ruth Hardy, Ursula Martin
2001	—	`conf`	Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS. TPHOLs Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom W. Kelsey, Ursula Martin, Sam Owre
2001	J	`jnl`	The Classification of Polynomial Orderings on Monadic Terms. Appl. Algebra Eng. Commun. Comput. Nick Cropper, Ursula Martin
2000	J	`jnl`	Invariants, Patterns and Weights for Ordering Terms. J. Symb. Comput. Ursula Martin, Duncan Shand
2000	A	`conf`	Workshop: The Role of Automated Deduction in Mathematics. CADE Simon Colton, Volker Sorge, Ursula Martin
1999	B	`conf`	Automated Theorem Proving in Support of Computer Algebra: Symbolic Definite Integration as a Case Study. ISSAC Andrew A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
1999	—	`conf`	Formal Methods for Extensions to CAS. World Congress on Formal Methods Martin Dunstan, Tom W. Kelsey, Ursula Martin, Steve Linton
1999	A	`conf`	VSDITLU: a verifiable symbolic definite integral table look-up. CADE Andrew A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin
1998	B	`conf`	Lightweight Formal Methods for Computer Algebra Systems. ISSAC Martin Dunstan, Tom W. Kelsey, Steve Linton, Ursula Martin
1997	J	`jnl`	The Order Types of Termination Orderings on Monadic Terms, Strings and Multisets. J. Symb. Log. Ursula Martin, Elizabeth Scott
1996	A	`conf`	Algebra and Automated Deduction. CADE Steve Linton, Ursula Martin, Péter Pröhle, Duncan Shand
1996	A	`conf`	Theorem Proving with Group Presentations: Examples and Questions. CADE Ursula Martin
1995	J	`jnl`	On the Diversity of Orderings on Strings. Fundam. Informaticae Ursula Martin
1994	A	`conf`	Termination, Geometry and Invariants. CADE Ursula Martin
1994	—	`conf`	Verification Techniques for LOTOS. FME Ursula Martin, Muffy Thomas
1993	—	`ed.`	First International Workshop on Larch, Proceedings of the first First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992 Larch Ursula Martin, Jeannette M. Wing
1993	—	`conf`	Linear Interpretations by Counting Patterns. RTA Ursula Martin
1993	A*	`conf`	The order types of termination orderings on monadic terms, strings and multisets LICS Ursula Martin, Elizabeth Scott
1992	J	`jnl`	Some Experiments with a Completion Theorem Prover. J. Symb. Comput. Ursula Martin, Michael Lai
1990	J	`jnl`	A Note on Division Orderings on Strings. Inf. Process. Lett. Ursula Martin
1990	—	`conf`	Automating Squiggol. Programming Concepts and Methods Ursula Martin, Tobias Nipkow
1990	J	`jnl`	Automating the Knuth Bendix Ordering. Acta Informatica Jeremy Dick, John Kalmus, Ursula Martin
1990	A	`conf`	Ordered Rewriting and Confluence. CADE Ursula Martin, Tobias Nipkow
1989	J	`jnl`	A Geometrical Approach to Multiset Orderings. Theor. Comput. Sci. Ursula Martin
1989	J	`jnl`	Boolean Unification - The Story So Far. J. Symb. Comput. Ursula Martin, Tobias Nipkow
1988	J	`jnl`	Unification in Boolean Rings. J. Autom. Reason. Ursula Martin, Tobias Nipkow
1987	J	`jnl`	Extension Functions for Multiset Orderings. Inf. Process. Lett. Ursula Martin
1987	—	`conf`	How to Choose Weights in the Knuth Bendix Ordering. RTA Ursula Martin
1986	A	`conf`	Unification in Boolean Rings. CADE Ursula Martin, Tobias Nipkow