default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLee Naish
Person information
- affiliation: University of Melbourne, Australia
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Lee Naish:
Sharing Analysis in the Pawns Compiler. CoRR abs/2409.02398 (2024)- [i8]Lee Naish:
A Brief Overview of the Pawns Programming Language. CoRR abs/2409.03152 (2024)
2010 – 2019
- 2018
- [j20]Neelofar
, Lee Naish, Kotagiri Ramamohanarao:
Spectral-based fault localization using hyperbolic function. Softw. Pract. Exp. 48(3): 641-664 (2018) - 2017
- [j19]Neelofar, Lee Naish, Jason Lee, Kotagiri Ramamohanarao:
Improving spectral-based fault localization using static analysis. Softw. Pract. Exp. 47(11): 1633-1655 (2017) - [c36]Andrew Conway, Michelle L. Blom, Lee Naish, Vanessa Teague:
An analysis of New South Wales electronic vote counting. ACSW 2017: 24:1-24:5 - 2016
- [j18]Lee Naish, Peter Schachte, Aleck M. MacNally:
Adtpp: lightweight efficient safe polymorphic algebraic data types for C. Softw. Pract. Exp. 46(12): 1685-1703 (2016) - [i7]Andrew Conway, Michelle L. Blom, Lee Naish, Vanessa Teague:
An analysis of New South Wales electronic vote counting. CoRR abs/1611.02015 (2016) - [i6]Lee Naish:
Similarity to a single set. PeerJ Prepr. 4: e1713 (2016) - 2015
- [j17]Lee Naish:
Sharing analysis in the Pawns compiler. PeerJ Comput. Sci. 1: e22 (2015) - [c35]Lee Naish, Neelofar, Kotagiri Ramamohanarao:
Multiple Bug Spectral Fault Localization Using Genetic Programming. ASWEC 2015: 11-17 - [i5]Lee Naish:
Sharing analysis in the Pawns compiler. PeerJ Prepr. 3: e907 (2015) - 2014
- [j16]Graeme Gange, Benjamin Horsfall, Lee Naish, Harald Søndergaard:
Four-Valued Reasoning and Cyclic Circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(7): 1003-1016 (2014) - [j15]Lee Naish:
Transforming floundering into success. Theory Pract. Log. Program. 14(2): 215-238 (2014) - [j14]Lee Naish, Harald Søndergaard:
Truth versus information in logic programming. Theory Pract. Log. Program. 14(6): 803-840 (2014) - 2013
- [c34]Lee Naish, Hua Jie Lee:
Duals in Spectral Fault Localization. Australian Software Engineering Conference 2013: 51-59 - [i4]Lee Naish, Harald Søndergaard:
Truth versus information in logic programming. CoRR abs/1305.0141 (2013) - 2012
- [c33]Stephen P. Smith, Reeva Lederman, Paul Monagle, Basil Alzougool, Lee Naish, Suelette Dreyfus:
Individually tailored client-focused reports for ubiquitous devices: An experimental analysis. ACIS 2012 - [c32]Lee Naish:
Declarative Diagnosis of Floundering in Prolog. ACSC 2012: 49-56 - [c31]Lee Naish, Hua Jie Lee, Kotagiri Ramamohanarao:
Spectral debugging: How much better can we do? ACSC 2012: 99-106 - [c30]Lee Naish, Harald Søndergaard, Benjamin Horsfall:
Logic Programming: From Underspecification to Undefinedness. CATS 2012: 49-58 - [i3]Lee Naish:
Transforming floundering into success. CoRR abs/1207.6816 (2012) - 2011
- [j13]Lee Naish, Hua Jie Lee, Kotagiri Ramamohanarao:
A model for spectra-based software diagnosis. ACM Trans. Softw. Eng. Methodol. 20(3): 11:1-11:32 (2011) - 2010
- [c29]Lee Naish, Hua Jie Lee, Kotagiri Ramamohanarao:
Statements versus Predicates in Spectral Bug Localization. APSEC 2010: 375-384 - [c28]Hua Jie Lee, Lee Naish, Kotagiri Ramamohanarao:
Effective Software Bug Localization Using Spectral Frequency Weighting Function. COMPSAC 2010: 218-227
2000 – 2009
- 2009
- [j12]Josh Benaloh, Tal Moran, Lee Naish, Kim Ramchen, Vanessa Teague:
Shuffle-sum: coercion-resistant verifiable tallying for STV voting. IEEE Trans. Inf. Forensics Secur. 4(4): 685-698 (2009) - [c27]Lee Naish, Hua Jie Lee, Kotagiri Ramamohanarao:
Spectral Debugging with Weights and Incremental Ranking. APSEC 2009: 168-175 - 2008
- [j11]Lee Naish:
Probabilistic Declarative Debugging. J. Funct. Log. Program. 2008 (2008) - [c26]Vanessa Teague, Kim Ramchen, Lee Naish:
Coercion-Resistant Tallying for STV Voting. EVT 2008 - 2007
- [c25]Lee Naish:
Resource-Oriented Deadlock Analysis. ICLP 2007: 302-316 - [i2]Lee Naish:
Declarative Diagnosis of Floundering. CoRR abs/0711.0048 (2007) - 2006
- [j10]Lee Naish:
A three-valued semantics for logic programmers. Theory Pract. Log. Program. 6(5): 509-538 (2006) - 2005
- [i1]Lee Naish:
A three-valued semantics for logic programmers. CoRR abs/cs/0508004 (2005) - 2003
- [c24]Lee Naish:
Approximating the Success Set of Logic Programs Using Constrained Regular Types. ACSC 2003: 61-67 - [c23]Bernard J. Pope, Lee Naish:
A Program Transformation for Debugging Haskell 98. ACSC 2003: 227-236 - [c22]Bernard J. Pope, Lee Naish:
Practical aspects of declarative debugging in Haskell 98. PPDP 2003: 230-240 - 2002
- [c21]Linda Stern, Lee Naish:
Visual representations for recursive algorithms. SIGCSE 2002: 196-200 - 2001
- [j9]Leon Sterling, Lee Naish, Manuel V. Hermenegildo:
Guest editor's introduction Special issue on Logic Programming and the Internet. Theory Pract. Log. Program. 1(3): 249-250 (2001) - [c20]Bernard J. Pope, Lee Naish:
Specialisation of Higher-Order Functions for Debugging. WFLP 2001: 277-291 - 2000
- [j8]Lee Naish, Leon Sterling:
Stepwise Enhancement and Higher-Order Programming in Prolog. J. Funct. Log. Program. 2000(4) (2000) - [c19]Lee Naish:
A Three-Valued Declarative Debugging Scheme. ACSC 2000: 166-173 - [c18]Lee Naish:
A Three-Valued Semantic for Horn Clause Programs. ACSC 2000: 174-180
1990 – 1999
- 1999
- [c17]Linda Stern, Harald Søndergaard, Lee Naish:
A strategy for managing content complexity in algorithm animation. ITiCSE 1999: 127-130 - 1997
- [j7]Lee Naish:
A Declarative Debugging Scheme. J. Funct. Log. Program. 1997(3) (1997) - [c16]Lee Naish, Leon Sterling:
A Higher Order Reconstruction of Stepwise Enhancement. LOPSTR 1997: 245-262 - [c15]Lee Naish:
A Three-Valued Declarative Debugging Scheme. LPE 1997: 1-12 - [e1]Lee Naish:
Logic Programming, Proceedings of the Fourteenth International Conference on Logic Programming, Leuven, Belgium, July 8-11, 1997. MIT Press 1997, ISBN 0-262-64035-X [contents] - 1996
- [c14]Lee Naish:
A Declarative View of Modes. JICSLP 1996: 185-199 - 1992
- [j6]Lee Naish:
Declarative Diagnosis of Missing Answers. New Gener. Comput. 10(3): 255-286 (1992) - [c13]Lee Naish:
Declarative Debugging of Lazy Functional Programs. LPE 1992: 29-34 - [p3]Lee Naish:
Types and the Intended Meaning of Logic Programs. Types in Logic Programming 1992: 189-216 - 1991
- [c12]Lee Naish:
Verification of Logic Programs and Imperative Programs. ICLP Workshop on Construction of Logic Programs 1991: 143-164 - [c11]Doug Palmer, Lee Naish:
NUA-Prolog: An Extension to the WAM for Parallel Andorra. ICLP 1991: 429-442 - [c10]Lee Naish:
Adding equations to NU-Prolog. PLILP 1991: 15-26 - 1990
- [j5]Kim Marriott, Lee Naish, Jean-Louis Lassez:
Most Specific Logic Programs. Ann. Math. Artif. Intell. 1: 303-338 (1990)
1980 – 1989
- 1989
- [j4]Lee Naish:
Proving Properties of Committed Choice Logic Programs. J. Log. Program. 7(1): 63-84 (1989) - [c9]Lee Naish, Philip W. Dart, Justin Zobel:
The NU-Prolog Debugging Environment. ICLP 1989: 521-536 - 1988
- [c8]Kim Marriott, Lee Naish, Jean-Louis Lassez:
Most Specific Logic Programs. ICLP/SLP 1988: 909-923 - [c7]Lee Naish:
Parallelizing NU-Prolog. ICLP/SLP 1988: 1546-1564 - [p2]Kotagiri Ramamohanarao, John Shepherd, Isaac Balbin, Graeme S. Port, Lee Naish, James A. Thom, Justin Zobel, Philip W. Dart:
The NU-Prolog Deductive Database System. Prolog and Databases 1988: 212-250 - [p1]James A. Thom, Kotagiri Ramamohanarao, Lee Naish:
A Superjoin Algorithm for Deductive Databases. Foundations of Deductive Databases and Logic Programming. 1988: 519-543 - 1987
- [j3]Kotagiri Ramamohanarao, John Shepherd, Isaac Balbin, Graeme S. Port, Lee Naish, James A. Thom, Justin Zobel, Philip W. Dart:
The NU-Prolog Deductive Database System. IEEE Data Eng. Bull. 10(4): 10-19 (1987) - [c6]Lee Naish:
Specification = Program + Types. FSTTCS 1987: 326-339 - [c5]Lee Naish, James A. Thom, Kotagiri Ramamohanarao:
Concurrent Database Updates in PROLOG. ICLP 1987: 178-195 - 1986
- [b2]Lee Naish:
Negation and Control in Prolog. Lecture Notes in Computer Science 238, Springer 1986, ISBN 3-540-16815-X - [c4]Lee Naish:
Negation and Quantifiers in NU-Prolog. ICLP 1986: 624-634 - [c3]James A. Thom, Kotagiri Ramamohanarao, Lee Naish:
A Superjoin Algorithm for Deductive Databases. VLDB 1986: 189-196 - 1985
- [b1]Lee Naish:
Negation and control in PROLOG. University of Melbourne, Parkville, Victoria, Australia, 1985 - [j2]Lee Naish:
Automating Control for Logic Programs. J. Log. Program. 2(3): 167-183 (1985) - [c2]Lee Naish:
Prolog Control Rules. IJCAI 1985: 720-722 - [c1]Lee Naish:
All Solutions Predicates in Prolog. SLP 1985: 73-77 - 1984
- [j1]Lee Naish:
Heterogeneous SLD Resolution. J. Log. Program. 1(4): 297-303 (1984)
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-10-10 21:13 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:
