FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2029844502> ?p ?o ?g. }

• W2029844502 abstract "Program checking, program self-correcting and program self-testing were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain confidence in software, by considering program correctness on an input by input basis rather than full program verification. Work in the field of program checking focused on designing, for specific functions, checkers, testers and correctors which are more efficient than the best program known for the function. These were designed utilizing specific algebraic, combinatorial or completeness properties of the function at hand. In this work we introduce a novel composition methodology for improving the efficiency of program checkers. We use this approach to design a variety of program checkers that are provably more efficient, in terms of circuit depth, than the optimal program for computing the function being checked. Extensions of this methodology for the cases of program testers and correctors are also presented. In particular, we show: For all i ≥ 1, every language in RNCi (that is NCO-hard under NCZ-reductions) has a program checker in RNCi-1. In addition, for all i ≥ 1, every language in RNCi (that is NCO-hard under ACZ-reductions) has a program corrector, tester and checker in RACi-1. This is the first time checkers are designed for a wide class of functions characterized only by its complexity, rather than by algebraic or combinatorial properties. This characterization immediately yields new and efficient checkers for languages such as graph connectivity, perfect matching and bounded-degree graph isomorphism. Constant-depth checkers, testers and correctors for matrix multiplication, inversion, determinant and rank. All previous program checkers, testers and correctors for these problems run in nearly logarithmic depth. Moreover, except for matrix multiplication, they all require the use of the library notion of [Blum-Luby-Rubinfeld], in which checkers have access to a library of programs for various matrix functions, rather than only having access to a program for the function being checked. Furthermore, we provide conditions under which program libraries can be eliminated. Important ingredients in these results are new and very efficient checkers for complete languages in low complexity classes (e.g. NCO). These constructions are based on techniques that were developed in the field of cryptography." @default.
• W2029844502 created "2016-06-24" @default.
• W2029844502 creator A5015086408 @default.
• W2029844502 creator A5057788395 @default.
• W2029844502 creator A5069967790 @default.
• W2029844502 creator A5070011898 @default.
• W2029844502 creator A5073397662 @default.
• W2029844502 date "2008-05-17" @default.
• W2029844502 modified "2023-09-26" @default.
• W2029844502 title "A (de)constructive approach to program checking" @default.
• W2029844502 cites W1596412683 @default.
• W2029844502 cites W1630273691 @default.
• W2029844502 cites W1980280740 @default.
• W2029844502 cites W1984459117 @default.
• W2029844502 cites W1996839061 @default.
• W2029844502 cites W2007327671 @default.
• W2029844502 cites W2010873187 @default.
• W2029844502 cites W2014343882 @default.
• W2029844502 cites W2016443801 @default.
• W2029844502 cites W2021276494 @default.
• W2029844502 cites W2026123763 @default.
• W2029844502 cites W2060270693 @default.
• W2029844502 cites W2080063509 @default.
• W2029844502 cites W2092018479 @default.
• W2029844502 cites W2134409170 @default.
• W2029844502 cites W2134839489 @default.
• W2029844502 cites W2398704230 @default.
• W2029844502 cites W2998808137 @default.
• W2029844502 cites W3004537778 @default.
• W2029844502 cites W3165549676 @default.
• W2029844502 cites W4240781210 @default.
• W2029844502 doi "https://doi.org/10.1145/1374376.1374399" @default.
• W2029844502 hasPublicationYear "2008" @default.
• W2029844502 type Work @default.
• W2029844502 sameAs 2029844502 @default.
• W2029844502 citedByCount "21" @default.
• W2029844502 countsByYear W20298445022012 @default.
• W2029844502 countsByYear W20298445022013 @default.
• W2029844502 countsByYear W20298445022015 @default.
• W2029844502 countsByYear W20298445022017 @default.
• W2029844502 countsByYear W20298445022018 @default.
• W2029844502 countsByYear W20298445022021 @default.
• W2029844502 crossrefType "proceedings-article" @default.
• W2029844502 hasAuthorship W2029844502A5015086408 @default.
• W2029844502 hasAuthorship W2029844502A5057788395 @default.
• W2029844502 hasAuthorship W2029844502A5069967790 @default.
• W2029844502 hasAuthorship W2029844502A5070011898 @default.
• W2029844502 hasAuthorship W2029844502A5073397662 @default.
• W2029844502 hasConcept C199360897 @default.
• W2029844502 hasConcept C2778701210 @default.
• W2029844502 hasConcept C41008148 @default.
• W2029844502 hasConcept C98045186 @default.
• W2029844502 hasConceptScore W2029844502C199360897 @default.
• W2029844502 hasConceptScore W2029844502C2778701210 @default.
• W2029844502 hasConceptScore W2029844502C41008148 @default.
• W2029844502 hasConceptScore W2029844502C98045186 @default.
• W2029844502 hasLocation W20298445021 @default.
• W2029844502 hasOpenAccess W2029844502 @default.
• W2029844502 hasPrimaryLocation W20298445021 @default.
• W2029844502 hasRelatedWork W1527862632 @default.
• W2029844502 hasRelatedWork W2109507516 @default.
• W2029844502 hasRelatedWork W2112962394 @default.
• W2029844502 hasRelatedWork W2118300983 @default.
• W2029844502 hasRelatedWork W2135396778 @default.
• W2029844502 hasRelatedWork W2382501300 @default.
• W2029844502 hasRelatedWork W2740990710 @default.
• W2029844502 hasRelatedWork W3137189469 @default.
• W2029844502 hasRelatedWork W4235530921 @default.
• W2029844502 hasRelatedWork W4243252198 @default.
• W2029844502 isParatext "false" @default.
• W2029844502 isRetracted "false" @default.
• W2029844502 magId "2029844502" @default.
• W2029844502 workType "article" @default.