default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan Green
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j6]Louise A. Dennis
, Ian Green, Alan Smaill:
The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling. J. Autom. Reason. 47(1): 57-105 (2011)
2000 – 2009
- 2009
- [j5]Raúl Monroy, Alan Bundy, Ian Green:
On Process Equivalence = Equation Solving in CCS. J. Autom. Reason. 43(1): 53-80 (2009) - 2002
- [p1]Mateja Jamnik, Alan Bundy, Ian Green:
On Automating Diagrammatic Proofs of Arithmetic Arguments. Diagrammatic Representation and Reasoning 2002: 315-338 - 2000
- [j4]Louise A. Dennis, Alan Bundy, Ian Green:
Making a productive use of failure to generate witnesses for coinduction from divergent proof attempts. Ann. Math. Artif. Intell. 29(1-4): 99-138 (2000) - [j3]Raúl Monroy, Alan Bundy, Ian Green:
Planning Proofs of Equations in CCS. Autom. Softw. Eng. 7(3): 263-304 (2000) - [c14]Raúl Monroy, Alan Bundy, Ian Green:
Searching for a Solution to Program Verification=Equation Solving in CCS. MICAI 2000: 1-12
1990 – 1999
- 1999
- [j2]Alessandro Armando, Alan Smaill, Ian Green:
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm. Autom. Softw. Eng. 6(4): 329-356 (1999) - [j1]Mateja Jamnik, Alan Bundy, Ian Green:
On Automating Diagrammatic Proofs of Arithmetic Arguments. J. Log. Lang. Inf. 8(3): 297-321 (1999) - [c13]Predrag Janicic, Alan Bundy, Ian Green:
A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers. CADE 1999: 127-141 - [c12]Jeremy Gow, Alan Bundy, Ian Green:
Extensions to the Estimation Calculus. LPAR 1999: 258-272 - 1998
- [c11]Julian Richardson, Alan Smaill, Ian Green:
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam. CADE 1998: 129-133 - [c10]Raúl Monroy, Alan Bundy, Ian Green:
Observant: An Annotated Term-Rewriting System for Deciding Observation Congruence. ECAI 1998: 393-397 - [c9]Raúl Monroy, Alan Bundy, Ian Green:
Planning Equational Verification in CCS. ASE 1998: 43-52 - 1997
- [c8]Louise A. Dennis, Alan Bundy, Ian Green:
Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs. CADE 1997: 276-290 - [c7]Mateja Jamnik, Alan Bundy, Ian Green:
Automation of Diagrammatic Reasoning. IJCAI (1) 1997: 528-533 - [c6]Alessandro Armando, Alan Smaill, Ian Green:
Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm. ASE 1997: 2-9 - 1996
- [c5]Alan Smaill, Ian Green:
Higher-Order Annotated Terms for Proof Search. TPHOLs 1996: 399-413 - 1994
- [c4]Peter Madden, Ian Green:
A General Technique for Automatically Optimizing Programs Through the Use of Proof Plans. AISMC 1994: 64-79 - [c3]Tetsuya Yoshida, Alan Bundy, Ian Green, Toby Walsh, David A. Basin:
Coloured Rippling: An Extension of a Theorem Proving Heuristic. ECAI 1994: 85-89 - 1993
- [c2]Peter Madden, Jane Hesketh, Ian Green, Alan Bundy:
A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (Abstract). LOPSTR 1993: 64-66 - 1991
- [c1]Ian Green:
Using Abstraction to Automate Program Improvement by Transformation. AAAI 1991: 317-322
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 23:21 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:
