@Inproceedings{Cod-Gen-Son-Stu_ICLP01,
  author    = {Michael Codish and 
		Samir Genaim and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Higher-Precision Groundness Analysis},
  editor    = {P. Codognet},
  booktitle = {Logic Programming: Proceedings of the 17th International 
		Conference},
  series    = {Lecture Notes in Computer Science},
  volume    = {2237},
  pages     = {135--149},
  publisher = {Springer},
  year      = {2001},
  doi       = {10.1007/3-540-45635-x_17},
  abstract  = {Groundness analysis of logic programs using Pos-based abstract
		interpretation is one of the clear success stories of the last
		decade in the area of logic program analysis. In this work we
		identify two problems with the Pos domain, the multiplicity and
		sign problems, that arise independently in groundness and 
		uniqueness analysis. We describe how these problems can be 
		solved using an analysis based on a domain Size for inferring 
		term size relations.  However this solution has its own 
		shortcomings because it involves a widening operator which leads
		to a loss of Pos information. Inspired by Pos, Size and the
		Lsign domain for abstract linear arithmetic constraints we
		introduce a new domain Lpos, and show how it can be used for
		groundness and uniqueness analysis. The idea is to use the sign
		information of Lsign to improve the widening of Size so that
		it does not lose Pos information. We prove that the resulting 
		analyses using Lpos are uniformly more precise than those using
		Pos.},
  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},
}

{"_id":"eWGAMnDLZuehSWc8B","bibbaseid":"codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001","author_short":["Codish, M.","Genaim, S.","Søndergaard, H.","Stuckey, P. J."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michael"],"propositions":[],"lastnames":["Codish"],"suffixes":[]},{"firstnames":["Samir"],"propositions":[],"lastnames":["Genaim"],"suffixes":[]},{"firstnames":["Harald"],"propositions":[],"lastnames":["Søndergaard"],"suffixes":[]},{"firstnames":["Peter","J."],"propositions":[],"lastnames":["Stuckey"],"suffixes":[]}],"title":"Higher-Precision Groundness Analysis","editor":[{"firstnames":["P."],"propositions":[],"lastnames":["Codognet"],"suffixes":[]}],"booktitle":"Logic Programming: Proceedings of the 17th International Conference","series":"Lecture Notes in Computer Science","volume":"2237","pages":"135–149","publisher":"Springer","year":"2001","doi":"10.1007/3-540-45635-x_17","abstract":"Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis. In this work we identify two problems with the Pos domain, the multiplicity and sign problems, that arise independently in groundness and uniqueness analysis. We describe how these problems can be solved using an analysis based on a domain Size for inferring term size relations. However this solution has its own shortcomings because it involves a widening operator which leads to a loss of Pos information. Inspired by Pos, Size and the Lsign domain for abstract linear arithmetic constraints we introduce a new domain Lpos, and show how it can be used for groundness and uniqueness analysis. The idea is to use the sign information of Lsign to improve the widening of Size so that it does not lose Pos information. We prove that the resulting analyses using Lpos are uniformly more precise than those using Pos.","keywords":"Boolean logic, Abstract domains, Abstract interpretation, Logic programming","bibtex":"@Inproceedings{Cod-Gen-Son-Stu_ICLP01,\n author = {Michael Codish and \n\t\tSamir Genaim and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n title = {Higher-Precision Groundness Analysis},\n editor = {P. Codognet},\n booktitle = {Logic Programming: Proceedings of the 17th International \n\t\tConference},\n series = {Lecture Notes in Computer Science},\n volume = {2237},\n pages = {135--149},\n publisher = {Springer},\n year = {2001},\n doi = {10.1007/3-540-45635-x_17},\n abstract = {Groundness analysis of logic programs using Pos-based abstract\n\t\tinterpretation is one of the clear success stories of the last\n\t\tdecade in the area of logic program analysis. In this work we\n\t\tidentify two problems with the Pos domain, the multiplicity and\n\t\tsign problems, that arise independently in groundness and \n\t\tuniqueness analysis. We describe how these problems can be \n\t\tsolved using an analysis based on a domain Size for inferring \n\t\tterm size relations. However this solution has its own \n\t\tshortcomings because it involves a widening operator which leads\n\t\tto a loss of Pos information. Inspired by Pos, Size and the\n\t\tLsign domain for abstract linear arithmetic constraints we\n\t\tintroduce a new domain Lpos, and show how it can be used for\n\t\tgroundness and uniqueness analysis. The idea is to use the sign\n\t\tinformation of Lsign to improve the widening of Size so that\n\t\tit does not lose Pos information. We prove that the resulting \n\t\tanalyses using Lpos are uniformly more precise than those using\n\t\tPos.},\n keywords = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\n}\n\n","author_short":["Codish, M.","Genaim, S.","Søndergaard, H.","Stuckey, P. J."],"editor_short":["Codognet, P."],"key":"Cod-Gen-Son-Stu_ICLP01","id":"Cod-Gen-Son-Stu_ICLP01","bibbaseid":"codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001","role":"author","urls":{},"keyword":["Boolean logic","Abstract domains","Abstract interpretation","Logic programming"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/zarajoy/testbibtex/refs/heads/main/test.bib","dataSources":["yWvm3kzg5vKQAPLm7","ofmsZryxNDBSpE7j5","9aC4cxLD8D6oJ3FLN","wpkuJrZJJtqra3FbL","BNGFBQQncqevukxoe","q5pWX4XZgAS4TQBof","yb3uN577XrYa7qf57","9jmvjAEoFta6emcgS","XqcrNTrCCBr9mSd37","W7ih7WyQivP4EDh83"],"keywords":["boolean logic","abstract domains","abstract interpretation","logic programming"],"search_terms":["higher","precision","groundness","analysis","codish","genaim","søndergaard","stuckey"],"title":"Higher-Precision Groundness Analysis","year":2001}