Program partition and logic program analysis
A program partition scheme for stratified programs introduced by Apt et al. (1988) is used to study efficient computation of logic programs. We consider three types of program partitions and their corresponding graph representations: 1) the natural partition, 2) stratified partitions, and 3) the red...
Saved in:
| Published in: | IEEE transactions on software engineering Vol. 21; no. 12; pp. 959 - 968 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY
IEEE
01.12.1995
Institute of Electrical and Electronics Engineers IEEE Computer Society |
| Subjects: | |
| ISSN: | 0098-5589, 1939-3520 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | A program partition scheme for stratified programs introduced by Apt et al. (1988) is used to study efficient computation of logic programs. We consider three types of program partitions and their corresponding graph representations: 1) the natural partition, 2) stratified partitions, and 3) the reduced partition. The natural (program) partition consists of definitions of relations, each definition being a subprogram. Subprograms of a program partition may consist of several relations. A partition graph is introduced for a program partition, each node of which corresponds to a subprogram. The partition graph for a stratified partition is a directed acyclic graph (DAG). A stratified partition decomposes a program into modules. The stratified partition with the maximum number of modules is the reduced partition. The cost to achieve a reduced partition is linear in the program size, using well known graph algorithms. We introduce the modular interpretations, which are equivalent in semantics to the standard interpretation. The modular interpretations offer encapsulation and may reduce the computation cost for some modules significantly. The modular approach can play an important role in query optimization, efficient termination, programming design, and software engineering. We classify query types and answer types then discuss query optimization for some query types. Many efficient query processing strategies are applicable to restricted subclasses of programs. The program partition method allows us to select the most efficient strategy for each module. For example, if a module is a uniformly bounded recursion, then the module can be terminated efficiently. If a module defines the transitive closure, then efficient program transformations may be applied to this module. |
|---|---|
| AbstractList | A program partition scheme for stratified programs introduced by Apt et al. (1988) is used to study efficient computation of logic programs. We consider three types of program partitions and their corresponding graph representations: 1) the natural partition, 2) stratified partitions, and 3) the reduced partition. The natural (program) partition consists of definitions of relations, each definition being a subprogram. Subprograms of a program partition may consist of several relations. A partition graph is introduced for a program partition, each node of which corresponds to a subprogram. The partition graph for a stratified partition is a directed acyclic graph (DAG). A stratified partition decomposes a program into modules. The stratified partition with the maximum number of modules is the reduced partition. The cost to achieve a reduced partition is linear in the program size, using well known graph algorithms. We introduce the modular interpretations, which are equivalent in semantics to the standard interpretation. The modular interpretations offer encapsulation and may reduce the computation cost for some modules significantly. The modular approach can play an important role in query optimization, efficient termination, programming design, and software engineering. We classify query types and answer types then discuss query optimization for some query types. Many efficient query processing strategies are applicable to restricted subclasses of programs. The program partition method allows us to select the most efficient strategy for each module. For example, if a module is a uniformly bounded recursion, then the module can be terminated efficiently. If a module defines the transitive closure, then efficient program transformations may be applied to this module A program partition scheme for stratified programs introduced by Apt et al. (1988) is used to study efficient computation of logic programs. We consider three types of program partitions and their corresponding graph representations: 1) the natural partition, 2) stratified partitions, and 3) the reduced partition. The natural (program) partition consists of definitions of relations, each definition being a subprogram. Subprograms of a program partition may consist of several relations. A partition graph is introduced for a program partition, each node of which corresponds to a subprogram. The partition graph for a stratified partition is a directed acyclic graph (DAG). A stratified partition decomposes a program into modules. The stratified partition with the maximum number of modules is the reduced partition. The cost to achieve a reduced partition is linear in the program size, using well known graph algorithms. We introduce the modular interpretations, which are equivalent in semantics to the standard interpretation. The modular interpretations offer encapsulation and may reduce the computation cost for some modules significantly. The modular approach can play an important role in query optimization, efficient termination, programming design, and software engineering. We classify query types and answer types then discuss query optimization for some query types. Many efficient query processing strategies are applicable to restricted subclasses of programs. The program partition method allows us to select the most efficient strategy for each module. For example, if a module is a uniformly bounded recursion, then the module can be terminated efficiently. If a module defines the transitive closure, then efficient program transformations may be applied to this module. A program partition scheme for stratified programs introduced by Apt, Blair, and Walker (1988) is used to study efficient computation of logic programs. Three types of program partitions and their corresponding graph representations are considered: 1. the natural partition, 2. stratified partitions, and 3. the reduced partition. The natural (program) partition consists of definitions of relations, each definition being a subprogram. Subprograms of a program partition may consist of several relations. A partition graph is introduced for a program partition, each node of which corresponds to a subprogram. The partition graph for a stratified partition is a directed acyclic graph (DAG). A stratified partition decomposes a program into modules. The stratified partition with the maximum number of modules is the reduced partition. The cost to achieve a reduced partition is linear in the program size, using well known graph algorithms. Modular interpretations, which are equivalent in semantics to the standard interpretation, are introduced. The modular interpretations offer encapsulation and may reduce the computation cost for some modules significantly. |
| Author | Jia Liang Han |
| Author_xml | – sequence: 1 givenname: Jia surname: Han middlename: Liang fullname: Han, Jia Liang |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2927125$$DView record in Pascal Francis |
| BookMark | eNpt0M9LwzAUB_AgE5zTg1dPQ0QQ7Pby0jTNUYa_YKAHPYc0TUdG186kO-y_N6PVw_D0Du_zHu99z8moaRtLyBWFGaUg5wxnaS5B4AkZU8lkwjjCiIwBZJ5wnsszch7CGgC4EHxMHj58u_J6M91q37nOtc1UN-W0blfOTLdDTze63gcXLshppetgL4c6IV_PT5-L12T5_vK2eFwmhjHeJQy01oUVFaNY8aoEwCyXmawyylJTQipStLLIUBacxpKDKKgweSoxS8GUbELu-r3xgO-dDZ3auGBsXevGtrugMKcpYoYR3hzBdbvz8dqgqIzfAuVZRLcD0sHouvK6MS6orXcb7fcKJQqKPLJ5z4xvQ_C2UsZ1-pBI57WrFQV1SFgxVH3CceL-aOJ353_2urfOWvvnhuYPVa6CMA |
| CODEN | IESEDJ |
| CitedBy_id | crossref_primary_10_1145_1064978_1065039 |
| Cites_doi | 10.1137/0201008 10.1002/int.4550070403 10.1145/116825.116838 10.1016/B978-0-934613-40-8.50006-3 10.1016/B978-0-444-88074-1.50015-9 10.7551/mitpress/7160.001.0001 10.1109/TAI.1991.167044 10.1137/0201010 10.1145/321978.321991 10.1007/BF01840452 10.1145/67544.66948 10.1145/210332.210335 10.1145/113413.113425 10.1007/978-3-642-83189-8 10.1145/6012.15399 |
| ContentType | Journal Article |
| Copyright | 1996 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 1995 |
| Copyright_xml | – notice: 1996 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 1995 |
| DBID | AAYXX CITATION IQODW 3V. 7WY 7WZ 7X7 7XB 87Z 88E 88F 88I 88K 8AL 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L6V M0C M0N M0S M1P M1Q M2O M2P M2T M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U 7SC 8FD L7M L~C L~D |
| DOI | 10.1109/32.489072 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) ProQuest ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Medical Database (Alumni Edition) Military Database (Alumni Edition) Science Database (Alumni Edition) Telecommunications (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library (Alumni) Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest SciTech Premium Collection Technology Collection Advanced Technologies & Aerospace Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection ProQuest Technology Collection ProQuest One ProQuest Central Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest ABI/INFORM Global Computing Database ProQuest Health & Medical Collection Medical Database Military Database Research Library Science Database Telecommunications Database Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest One Academic ProQuest One Academic ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic Computer and Information Systems Abstracts Technology Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest Telecommunications ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Telecommunications (Alumni Edition) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1939-3520 |
| EndPage | 968 |
| ExternalDocumentID | 9159456 2927125 10_1109_32_489072 489072 |
| GroupedDBID | --Z -DZ -~X .4S .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 7WY 7X7 85S 88E 88I 8FE 8FG 8FI 8FJ 8FL 8G5 8R4 8R5 97E 9M8 AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABJCF ABPPZ ABQJQ ABUWG ABVLG ACGFO ACGOD ACIWK ACNCT ADBBV AENEX AETIX AFKRA AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ARAPS ARCSS ASUFR ATWAV AZQEC BEFXN BENPR BEZIV BFFAM BGLVJ BGNUA BKEBE BKOMP BPEOZ BPHCQ BVXVI CCPQU CS3 DU5 DWQXO E.L EBS EDO EJD FRNLG FYUFA GNUQQ GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HMCUK HZ~ H~9 I-F IBMZZ ICLAB IEDLZ IFIPE IFJZH IPLJI ITG ITH JAVBF K60 K6V K6~ K7- L6V LAI M0C M1P M1Q M2O M2P M43 M7S MS~ O9- OCL OHT P2P P62 PHGZM PHGZT PJZUB PPXIY PQBIZ PQBZA PQGLB PQQKQ PROAC PSQYO PTHSS PUEGO Q2X RIA RIE RNI RNS RXW RZB S10 TAE TN5 TWZ UHB UKHRP UPT UQL VH1 WH7 XOL YYP YZZ ZCG AAYXX AFFHD CITATION ALIPV IQODW RIG 3V. 7XB 88K 8AL 8FK JQ2 K9. L.- M0N M2T MBDVC PKEHL PQEST PQUKI PRINS Q9U 7SC 8FD L7M L~C L~D |
| ID | FETCH-LOGICAL-c335t-30aaabe7f312f5fd00268969f6134cd04742e9b629b51b62807b17c8492640cd3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1109_32_489072&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0098-5589 |
| IngestDate | Sun Sep 28 01:11:00 EDT 2025 Mon Oct 06 17:00:08 EDT 2025 Mon Jul 21 09:15:25 EDT 2025 Tue Nov 18 22:34:42 EST 2025 Sat Nov 29 02:38:28 EST 2025 Wed Aug 27 02:47:42 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 12 |
| Keywords | Program graph Query formulation Computer programming Logic programming Deductive database Semantic analysis Task scheduling Computer programming languages Decomposition Graph theory Optimization Program verification Algorithms Acyclic graph Directed graph |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c335t-30aaabe7f312f5fd00268969f6134cd04742e9b629b51b62807b17c8492640cd3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 195580156 |
| PQPubID | 21418 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_489072 proquest_journals_195580156 pascalfrancis_primary_2927125 crossref_citationtrail_10_1109_32_489072 crossref_primary_10_1109_32_489072 proquest_miscellaneous_28142262 |
| PublicationCentury | 1900 |
| PublicationDate | 1995-12-01 |
| PublicationDateYYYYMMDD | 1995-12-01 |
| PublicationDate_xml | – month: 12 year: 1995 text: 1995-12-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on software engineering |
| PublicationTitleAbbrev | TSE |
| PublicationYear | 1995 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers IEEE Computer Society |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: IEEE Computer Society |
| References | BIBS095916 han (BIBS09599) 1993 BIBS095917 BIBS095914 BIBS095915 kemp (BIBS095913) 1990 han (BIBS09598) 1992 BIBS09597 BIBS09596 ullman (BIBS095921) 1989; 2 BIBS09595 BIBS095919 sagiv (BIBS095918) 1990 a t-kaci (BIBS09593) 1991 warren (BIBS095924) 1983 BIBS095923 BIBS095912 ullman (BIBS095920) 1988; 1 BIBS095922 BIBS095911 han (BIBS095910) 1993 BIBS09594 BIBS09592 aho (BIBS09591) 1983 |
| References_xml | – start-page: 250 year: 1993 ident: BIBS09599 article-title: on optimizing uniformly bounded datalog program publication-title: Advances in Database Research – ident: BIBS09592 doi: 10.1137/0201008 – ident: BIBS095911 doi: 10.1002/int.4550070403 – ident: BIBS095923 doi: 10.1145/116825.116838 – ident: BIBS09595 doi: 10.1016/B978-0-934613-40-8.50006-3 – ident: BIBS09594 doi: 10.1016/B978-0-444-88074-1.50015-9 – start-page: 380 year: 1990 ident: BIBS095913 article-title: right-, left-, and multi-linear rule transformations that maintain context information publication-title: Proc of the 16th Int?l Conf on Very Large Data Bases – volume: 2 year: 1989 ident: BIBS095921 publication-title: Principles of database and knowledge-base systems – start-page: 235 year: 1990 ident: BIBS095918 article-title: is there anything better than magic? publication-title: Proc North Am Conf on Logic Programming – year: 1993 ident: BIBS095910 article-title: on termination of single rule recursions in prolog – start-page: 113 year: 1992 ident: BIBS09598 article-title: on constraints in recursive rules publication-title: Research and Practical Issues in Databases – year: 1983 ident: BIBS09591 publication-title: Data structures and algorithms – year: 1991 ident: BIBS09593 publication-title: Warren?s Abstract Machine A Tutorial Reconstruction doi: 10.7551/mitpress/7160.001.0001 – ident: BIBS09597 doi: 10.1109/TAI.1991.167044 – ident: BIBS095919 doi: 10.1137/0201010 – ident: BIBS095922 doi: 10.1145/321978.321991 – ident: BIBS095912 doi: 10.1007/BF01840452 – volume: 1 year: 1988 ident: BIBS095920 publication-title: Principles of database and knowledge-base systems – ident: BIBS095917 doi: 10.1145/67544.66948 – ident: BIBS095914 doi: 10.1145/210332.210335 – ident: BIBS095916 doi: 10.1145/113413.113425 – ident: BIBS095915 doi: 10.1007/978-3-642-83189-8 – year: 1983 ident: BIBS095924 publication-title: An Abstract Prolog Instruction Set – ident: BIBS09596 doi: 10.1145/6012.15399 |
| SSID | ssj0005775 |
| Score | 1.4972106 |
| Snippet | A program partition scheme for stratified programs introduced by Apt et al. (1988) is used to study efficient computation of logic programs. We consider three... A program partition scheme for stratified programs introduced by Apt, Blair, and Walker (1988) is used to study efficient computation of logic programs. Three... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 959 |
| SubjectTerms | Algorithms Applied sciences Automatic programming Automation Computational efficiency Computer science; control theory; systems Costs Exact sciences and technology Graph representations Graphs Information systems. Data bases Logic programming Memory organisation. Data processing Optimization techniques Partitioning algorithms Programming languages Query processing Relational data bases Relational databases Semantics Software Software engineering Software maintenance Studies Systems analysis Writing |
| SummonAdditionalLinks | – databaseName: Research Library dbid: M2O link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB58Hby4PrGujyIePFhtk7RNTiLi4sXVg4K30qQJCNJdt6u_30maVkTx4qklDyjznmYyH8BJqgzX1LDIVCaOmKRZJEhe4pvkGCAYU0ruwCby8Zg_P4sHX5vT-LLKziY6Q11NlP1HfpGINOX23u_l9C2yoFH2cNUjaCzCMvrpzAIY3JH7rwqPPE-7lpm4WfjGQkksLig5ZxzzQvLNHTl8FVsdWTZIINMiW_ww0s7zjAb__OZ1WPMhZ3jVysgGLOh6EwYdnEPotXsLzh7aWq1wasXJMiws6yp0xjH0dVw40jYx2Yan0c3j9W3kwRQiRWk6j2hclqXUuaEJMampbPLFRSYM-nOmqphhjqyFzIiQaYIPHucyyRW3DQVZrCq6A0v1pNa7EKKPpwYVVytmmEwNx5xNYtxbYbBjmNABnHY0LZTvNG4BL14Ll3HEoqCkaMkfwHG_dNq21_ht0aZlTL-gGz34xqd-mqCwoTgEMOyYUni9bIqeIwEc9bOoUPaUpKz15L0pCHe3i8nen_uHsOout7vCln1Yms_e9QGsqI_5SzM7dHL4CeGX47Q priority: 102 providerName: ProQuest |
| Title | Program partition and logic program analysis |
| URI | https://ieeexplore.ieee.org/document/489072 https://www.proquest.com/docview/195580156 https://www.proquest.com/docview/28142262 |
| Volume | 21 |
| WOSCitedRecordID | wos10_1109_32_489072&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1939-3520 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: RIE dateStart: 19750101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: 7WY dateStart: 19870101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: M0C dateStart: 19870101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: P5Z dateStart: 19870101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: K7- dateStart: 19870101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: M7S dateStart: 19870101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: 7X7 dateStart: 19870101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: Military Database (ProQuest) customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: M1Q dateStart: 19870101 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: BENPR dateStart: 19870101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Proquest-PRL（Research Library） customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: M2O dateStart: 19870101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1939-3520 dateEnd: 20120331 omitProxy: false ssIdentifier: ssj0005775 issn: 0098-5589 databaseCode: M2P dateStart: 19870101 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR1dT9sw8DTYHngBVkCUQhehPfCwtIk_avuRoVZI00oGTCu8RLFjS5OmFNGW38_ZSToheOHl4tiOEt2dfXfxfQB85cZJSx2LXemSmGk6ihURBba0RAXBuULLUGxCTKdyNlNZk2c7xMJYa4PzmR34ZjjLL-dm5X-VDZlEUw732w0hRnWo1n9vDiF4mx6Tc6maJEJpooaUDOoHX4ieUEvFe0IWC0SGq6tYvNqQg5SZ7Lzr-3Zhu1Emo_Oa-p_hg606sNMWaoiadbsH37LaCyt68IziSREVVRmFbS9qPLSwp05Psg-_J-Pbi8u4KZMQG0r5MqZJURTaCkdT4rgrvVkl1Ug5lNTMlAlD69cqPSJK8xQvMhE6FUb6VIEsMSU9gM1qXtlDiFB6U4dL0hrmmOZOojWmUaMtUY1xTNkunLUYzE2TQ9yXsviXB1siUTkleY2FLpyupz7UiTPemtTxWFxPaHtPXlBlPUyQjVAh60KvpVLerLhFnioku48L78KX9SguFX_-UVR2vlrkRIa4YXL05lt7sBXC1YOryjFsLh9X9gQ-mafl38VjH3nuz52HM9GHj9_H0-wa736IGOHP5MLD9JeH5CrALMBbD8UNwozf9wPHPgNhpt20 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1JS8QwFH64gV7cxXEtouDBOm2STpODiLigqIMHBW-1SRMQpDPaUfFH-R99SRcRxZsHTy1JWkLf3rz3PoDNSBmuqWG-yUzgM0k7viBxineSo4NgTCq5A5uIu11-eyuuhuC9roWxaZW1TnSKOusp-4-8HYoo4rbud7__6FvQKHu4WiNolFxxrt9eMWIr9s6OkLxbhJwcXx-e-hWogK8ojQY-DdI0lTo2NCQmMpkNQrjoCIN2jaksYBgraiE7RMgoxAsPYhnGitvGeixQGcX3DsMow7jLitVlcPiZURLHUd2iEzcrqkZGYSDalOwyjnEo-WL-HJ6LzcZMCySIKZE0vhkFZ-lOpv7ZN5qGycql9g5KGZiBIZ3PwlQNV-FV2msOdq7KXDSvb8XFMqSX5pnnlL9X5anhSNmkZR5u_mTPCzCS93K9CB76MNSgYtKKGSYjwzEmlejXZ-jMGSZ0C7ZrGiaq6qRuAT0eEhdRBSKhJCnJ3YKNZmm_bB_y06JZywjNgnp09QtfNNMEhQnd0hYs10yQVHqnSBoOaMF6M4sKw54CpbnuPRcJ4a56miz9-vw6jJ9eX14kF2fd82WYcIX8LolnBUYGT896FcbUy-C-eFpzMuDB3V8z1Ac7Qj3r |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Program+partition+and+logic+program+analysis&rft.jtitle=IEEE+transactions+on+software+engineering&rft.au=JIA+LIANG+HAN&rft.date=1995-12-01&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=0098-5589&rft.volume=21&rft.issue=12&rft.spage=959&rft.epage=968&rft_id=info:doi/10.1109%2F32.489072&rft.externalDBID=n%2Fa&rft.externalDocID=2927125 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0098-5589&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0098-5589&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0098-5589&client=summon |