ISSTA 2011-International Symposium on Software Testing and Analysis

[{"title":"（ 35 个子文件 16.51MB ） ISSTA 2011-International Symposium on Software Testing and Analysis","children":[{"title":"ISSTA 2011-International Symposium on Software Testing and Analysis 2011","children":[{"title":"Concurrency","children":[{"title":"Persuasive prediction of concurrency access anomalies.pdf <span style='color:#111;'> 505.53KB </span>","children":null,"spread":false},{"title":"Testing concurrent programs on relaxed memory models.pdf <span style='color:#111;'> 286.61KB </span>","children":null,"spread":false},{"title":"Change-aware preemption prioritization.pdf <span style='color:#111;'> 499.82KB </span>","children":null,"spread":false}],"spread":true},{"title":"Analysis of systems and binary code","children":[{"title":"Efficient, sensitivity resistant binary instrumentation.pdf <span style='color:#111;'> 490.45KB </span>","children":null,"spread":false},{"title":"Defective error pointer interactions in the Linux kernel.pdf <span style='color:#111;'> 262.81KB </span>","children":null,"spread":false},{"title":"Recovering the toolchain provenance of binary code.pdf <span style='color:#111;'> 419.73KB </span>","children":null,"spread":false}],"spread":true},{"title":"Test generation I","children":[{"title":"Symbolic execution with mixed concrete-symbolic solving.pdf <span style='color:#111;'> 300.72KB </span>","children":null,"spread":false},{"title":"eXpress _ guided path exploration for efficient regression test generation.pdf <span style='color:#111;'> 461.16KB </span>","children":null,"spread":false},{"title":"Automatic partial loop summarization in dynamic test generation.pdf <span style='color:#111;'> 421.78KB </span>","children":null,"spread":false},{"title":"Statically-directed dynamic automated test generation.pdf <span style='color:#111;'> 325.20KB </span>","children":null,"spread":false}],"spread":true},{"title":"Combinatorial and random testing","children":[{"title":"Feedback driven adaptive combinatorial testing.pdf <span style='color:#111;'> 332.85KB </span>","children":null,"spread":false},{"title":"Using binary decision diagrams for combinatorial test design.pdf <span style='color:#111;'> 834.10KB </span>","children":null,"spread":false},{"title":"Adaptive random testing _ an illusion of effectiveness.pdf <span style='color:#111;'> 486.87KB </span>","children":null,"spread":false}],"spread":true},{"title":"Test generation II","children":[{"title":"Combined static and dynamic automated test generation.pdf <span style='color:#111;'> 366.78KB </span>","children":null,"spread":false},{"title":"High coverage testing of Haskell programs.pdf <span style='color:#111;'> 383.46KB </span>","children":null,"spread":false},{"title":"Generating parameterized unit tests.pdf <span style='color:#111;'> 439.09KB </span>","children":null,"spread":false}],"spread":true},{"title":"Specification and optimization","children":[{"title":"Iterative refinement of specification for component based embedded systems.pdf <span style='color:#111;'> 1.01MB </span>","children":null,"spread":false},{"title":"Using automatic persistent memoization to facilitate data analysis scripting.pdf <span style='color:#111;'> 441.02KB </span>","children":null,"spread":false},{"title":"CoDeSe _ fast deserialization via code generation.pdf <span style='color:#111;'> 437.24KB </span>","children":null,"spread":false}],"spread":true},{"title":"Faults II","children":[{"title":"Selecting peers for execution comparison.pdf <span style='color:#111;'> 544.32KB </span>","children":null,"spread":false},{"title":"Characterizing failure-causing parameter interactions by adaptive testing.pdf <span style='color:#111;'> 435.49KB </span>","children":null,"spread":false},{"title":"The use of mutation in testing experiments and its sensitivity to external threats.pdf <span style='color:#111;'> 632.55KB </span>","children":null,"spread":false},{"title":"Generating analyses for detecting faults in path segments.pdf <span style='color:#111;'> 324.58KB </span>","children":null,"spread":false}],"spread":true},{"title":"Program analysis","children":[{"title":"Demand-driven context-sensitive alias analysis for Java.pdf <span style='color:#111;'> 610.19KB </span>","children":null,"spread":false},{"title":"Path- and index-sensitive string analysis based on monadic second-order logic.pdf <span style='color:#111;'> 919.91KB </span>","children":null,"spread":false},{"title":"Saving the world wide web from vulnerable JavaScript.pdf <span style='color:#111;'> 329.76KB </span>","children":null,"spread":false},{"title":"Geometric encoding _ forging the high performance context sensitive points-to analysis for Java.pdf <span style='color:#111;'> 1.14MB </span>","children":null,"spread":false}],"spread":true},{"title":"Faults I","children":[{"title":"On the influence of multiple faults on coverage-based fault localization.pdf <span style='color:#111;'> 356.62KB </span>","children":null,"spread":false},{"title":"Detecting anomalies in the order of equally-typed method arguments.pdf <span style='color:#111;'> 344.35KB </span>","children":null,"spread":false},{"title":"Minimizing reproduction of software failures.pdf <span style='color:#111;'> 407.90KB </span>","children":null,"spread":false},{"title":"Are automated debugging techniques actually helping programmers.pdf <span style='color:#111;'> 693.92KB </span>","children":null,"spread":false}],"spread":true},{"title":"Models","children":[{"title":"Polyglot _ modeling and analysis for multiple Statechart formalisms.pdf <span style='color:#111;'> 1.48MB </span>","children":null,"spread":false},{"title":"Automated framework for formal operator task analysis.pdf <span style='color:#111;'> 907.49KB </span>","children":null,"spread":false},{"title":"Bounded verification of Ruby on Rails data models.pdf <span style='color:#111;'> 363.08KB </span>","children":null,"spread":false},{"title":"Scalable analysis of conceptual data models.pdf <span style='color:#111;'> 406.05KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]