{"entities":{"Q7361913":{"pageid":31521278,"ns":120,"title":"Item:Q7361913","lastrevid":105370379,"modified":"2026-10-07T13:39:09Z","type":"item","id":"Q7361913","labels":{"en":{"language":"en","value":"A data flow analysis algorithm for computing dominators"}},"descriptions":{"en":{"language":"en","value":"AFP entry Dominance_CHK"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"762945fe20b79572b3f38dc02a5c0b2b4a2559de","datavalue":{"value":"https://isa-afp.org/entries/Dominance_CHK.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361913$2C4B44E1-3E65-403D-9E5A-F6828E6E3D87","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ae4cdc588d91a6ef243152ffd8c07bcd2770f85e","datavalue":{"value":{"time":"+2021-09-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361913$A3DCAEB6-2179-47CB-A293-9B7AA8CA5AFF","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"97ae6cfe850621159f4d7122e9706d888021b915","datavalue":{"value":"Nan Jiang","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361913$1358DF8E-9C59-43FD-9ADE-D29A6A7636BA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1cc15015f8f9e8dcaeb6a742ff645da53b0568cc","datavalue":{"value":{"text":"A data flow analysis algorithm for computing dominators","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361913$8F177FDB-6FCF-4BDC-9E65-0C6895C6618A","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"31201fbd4f2b3f0a058ab9727f6d682ac2a74c41","datavalue":{"value":"This entry formalises the fast iterative algorithm for computing dominators due to Cooper, Harvey and Kennedy. It gives a specification of computing dominators on a control flow graph where each node refers to its reverse post order number. A semilattice of reversed-ordered list which represents dominators is built and a Kildall-style algorithm on the semilattice is defined for computing dominators. Finally the soundness and completeness of the algorithm are proved w.r.t. the specification.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361913$A0A09C07-CD9F-4DB0-A688-81A17AFFFE81","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361913$9E53BA9C-FC3B-4C89-8B00-66C331319E3D","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"8072b0b9bf20925c4942af3ffdb86b7f35fb0680","datavalue":{"value":{"entity-type":"item","numeric-id":7361808,"id":"Q7361808"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361913$C48E4E30-E443-49B4-8F94-64489AE63120","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"e0b5465b6a0d9e05645cdb7168eee1aaf7eb2845","datavalue":{"value":{"entity-type":"item","numeric-id":7361518,"id":"Q7361518"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361913$D8CDE939-E61C-4D41-8E05-64C163FE50BC","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"b721b89857a714d14089f2631e7d6953fb3d481c","datavalue":{"value":{"entity-type":"item","numeric-id":7360799,"id":"Q7360799"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361913$1DD198C8-D376-4297-A230-155661E7D826","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361913$7F21A007-3184-4B44-A05D-822CF4C91DF3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A data flow analysis algorithm for computing dominators","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_data_flow_analysis_algorithm_for_computing_dominators"}}}}}