default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulian Richardson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i2]Dell Zhang, Alexander Kuhnle, Julian Richardson, Murat Sensoy:
Process Discovery for Structured Program Synthesis. CoRR abs/2008.05804 (2020)
2010 – 2019
- 2016
- [c14]Dayu Yuan, Julian Richardson, Ryan Doherty, Colin Evans, Eric Altendorf:
Semi-supervised Word Sense Disambiguation with Neural Models. COLING 2016: 1374-1385 - [i1]Dayu Yuan, Ryan Doherty, Julian Richardson, Colin Evans, Eric Altendorf:
Word Sense Disambiguation with Neural Language Models. CoRR abs/1603.07012 (2016)
2000 – 2009
- 2008
- [j5]Tim Menzies
, Markland Benson, Ken Costello, Christina Moats, Melissa Northey, Julian Richardson:
Learning better IV&V practices. Innov. Syst. Softw. Eng. 4(2): 169-183 (2008) - 2007
- [j4]Tim Menzies, David Owen, Julian Richardson:
The Strangest Thing About Software. Computer 40(1): 54-60 (2007) - [c13]James D. Kiper, Martin S. Feather, Julian Richardson:
Optimizing the V&V process for critical systems. GECCO 2007: 1139 - 2006
- [j3]Tim Menzies, Julian Richardson:
Making Sense of Requirements, Sooner. Computer 39(10): 112-114 (2006) - [c12]Tim Menzies, Julian Richardson:
Qualitative Modeling for Requirements Engineering. SEW 2006: 11-20 - 2004
- [c11]Julian Richardson, Jeff Green:
Automating Traceability for Generated Software Artifacts . ASE 2004: 24-33 - 2002
- [c10]Julian Richardson:
A Semantics for Proof Plans with Applications to Interactive Proof Planning. LPAR 2002: 337-351 - 2001
- [j2]Steven Willmott, Julian Richardson, Alan Bundy, John Levine:
Applying adversarial planning techniques to Go. Theor. Comput. Sci. 252(1-2): 45-82 (2001) - 2000
- [j1]Pierre Flener, Kung-Kiu Lau, Mario Ornaghi, Julian Richardson:
An Abstract Formalization of Correct Schemas for Program Synthesis. J. Symb. Comput. 30(1): 93-127 (2000) - [c9]David Lacey, Julian Richardson, Alan Smaill:
Logic Program Synthesis in a Higher-Order Setting. Computational Logic 2000: 87-100
1990 – 1999
- 1999
- [c8]Stephen Cresswell, Alan Smaill, Julian Richardson:
Deductive Synthesis of Recursive Plans in Linear Logic. ECP 1999: 252-264 - [c7]Alan Bundy, Julian Richardson:
Proofs About Lists Using Ellipsis. LPAR 1999: 1-12 - 1998
- [c6]Julian Richardson, Alan Smaill, Ian Green:
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam. CADE 1998: 129-133 - [c5]Steven Willmott, Julian Richardson, Alan Bundy, John Levine:
An Adversarial Planning Approach to Go. Computers and Games 1998: 93-112 - [c4]Julian Richardson:
Abstract: Proof Planning with Program Schemas. LOPSTR 1998: 313-315 - 1997
- [c3]Julian Richardson, Norbert E. Fuchs:
Development of Correct Transformation Schemata for Prolog Programs. LOPSTR 1997: 263-281 - 1996
- [c2]Laurent Fribourg, Julian Richardson:
Symbolic Verification with Gap-Order Constraints. LOPSTR 1996: 20-37 - 1995
- [c1]Julian Richardson:
Automating Changes of Data Type in Functional Programs. KBSE 1995: 166-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
