Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Microsoft_Terminator> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Microsoft_Terminator abstract "Terminator, a research project at Microsoft Research, is an automated program analyzer that aims to find whether a program can run infinitely (so called termination analysis). It supports nested loops and recursive functions, pointers and side-effects, and function-pointers as well as concurrent programs. Like all programs for termination analysis it tries to solve the halting problem for particular cases, since the general problem is undecidable. It provides a solution which is sound, meaning that when it states that a program does always terminate, the result is dependable.".
- Microsoft_Terminator wikiPageExternalLink TERMINATOR.
- Microsoft_Terminator wikiPageID "14627105".
- Microsoft_Terminator wikiPageLength "1040".
- Microsoft_Terminator wikiPageOutDegree "7".
- Microsoft_Terminator wikiPageRevisionID "610323255".
- Microsoft_Terminator wikiPageWikiLink Category:Microsoft_Research.
- Microsoft_Terminator wikiPageWikiLink Halting_problem.
- Microsoft_Terminator wikiPageWikiLink Microsoft_Research.
- Microsoft_Terminator wikiPageWikiLink Soundness.
- Microsoft_Terminator wikiPageWikiLink Static_program_analysis.
- Microsoft_Terminator wikiPageWikiLink Termination_analysis.
- Microsoft_Terminator wikiPageWikiLink Undecidable_problem.
- Microsoft_Terminator wikiPageWikiLinkText "Microsoft Terminator".
- Microsoft_Terminator wikiPageUsesTemplate Template:Microsoft_Research.
- Microsoft_Terminator wikiPageUsesTemplate Template:Reflist.
- Microsoft_Terminator wikiPageUsesTemplate Template:Windows-software-stub.
- Microsoft_Terminator subject Category:Microsoft_Research.
- Microsoft_Terminator hypernym Analyzer.
- Microsoft_Terminator type Software.
- Microsoft_Terminator type Division.
- Microsoft_Terminator comment "Terminator, a research project at Microsoft Research, is an automated program analyzer that aims to find whether a program can run infinitely (so called termination analysis). It supports nested loops and recursive functions, pointers and side-effects, and function-pointers as well as concurrent programs. Like all programs for termination analysis it tries to solve the halting problem for particular cases, since the general problem is undecidable.".
- Microsoft_Terminator label "Microsoft Terminator".
- Microsoft_Terminator sameAs Q6840235.
- Microsoft_Terminator sameAs m.03gr3yg.
- Microsoft_Terminator sameAs Q6840235.
- Microsoft_Terminator wasDerivedFrom Microsoft_Terminator?oldid=610323255.
- Microsoft_Terminator isPrimaryTopicOf Microsoft_Terminator.