menu

References

  1. K. Hinsen, “Dealing with software collapse,” Computing in Science & Engineering, vol. 21, no. 3, pp. 104–108, 2019. Full details | PDF
  2. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub, “Answer set solving in practice,” Synthesis lectures on artificial intelligence and machine learning, vol. 6, no. 3, pp. 1–238, 2012. Full details | PDF
  3. Y. Wang et al., “Could I Have a Stack Trace to Examine the Dependency Conflict Issue?,” in 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE), 2019, pp. 572–583. Full details | PDF
  4. M. Schroeder, “OpenSUSE Package Management.” https://www.youtube.com/watch?v=FNwNF19oFqM, Feb-2013. Full details | PDF
  5. T. Gamblin, “How compilers affect dependency resolution in Spack,” in Free and Open source Software Developers’ European Meeting (FOSDEM’18), Brussels, Belgium, 2018. Full details | PDF
  6. Y. Hu, G. Huang, and P. Huang, https://www.usenix.org/conference/osdi20/presentation/hu“Automated Reasoning and Detection of Specious Configuration in Large Systems with Symbolic Execution”</a> in 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), 2020, pp. 719–734. Full details | PDF
  7. N. Jones and M. R. Fahey, “Design, Implementation, and Experiences of Third-Party Software Administration at the ORNL NCCS,” in Proceedings of the 50th Cray User Group (CUG08), Helsinki, Finland, 2008. Full details | PDF
  8. K. Hoste, J. Timmerman, A. Georges, and S. D. Weirdt, “EasyBuild: Building Software with Ease,” in 2012 SC Companion: High Performance Computing, Networking Storage and Analysis, 2012, pp. 572–582. Full details | PDF
  9. M. Geimer, K. Hoste, and R. McLay, https://doi.org/10.1109/HUST.2014.8“Modern Scientific Software Management Using EasyBuild and Lmod”</a> in Proceedings of the First International Workshop on HPC User Support Tools, 2014, pp. 41–51. Full details | PDF
  10. P. Abate, R. Di Cosmo, R. Treinen, and S. Zacchiroli, http://www.sciencedirect.com/science/article/pii/S0950584912001851“A modular package manager architecture”</a> Information and Software Technology, vol. 55, no. 2, pp. 459–474, 2013. Full details | PDF
  11. L. Courtès and R. Wurmus, https://hal.inria.fr/hal-01161771“Reproducible and User-Controlled Software Environments in HPC with Guix”</a> in 2nd International Workshop on Reproducibility in Parallel Computing (RepPar), Vienne, Austria, 2015. Full details | PDF
  12. T. Epperly and L. Hochstein, “Software Construction and Composition Tools for Petascale Computing SCW0837 Progress Report,” Lawrence Livermore National Laboratory, LLNL-TR-499074, 2011. Full details | PDF
  13. C. Barrett and C. Tinelli, “Satisfiability Modulo Theories,” in Handbook of Satisfiability, IOS Press, 2008, pp. 737–797. Full details | PDF
  14. L. Nelson, J. V. Geffen, E. Torlak, and X. Wang, https://www.usenix.org/conference/osdi20/presentation/nelson“Specification and verification in the field: Applying formal methods to BPF just-in-time compilers in the Linux kernel”</a> in 14th USENIX Symposium on Operating Systems Design and Implementation (OSDI 20), 2020, pp. 41–61. Full details | PDF
  15. D. Winterer, C. Zhang, and Z. Su, https://doi.org/10.1145/3385412.3385985“Validating SMT Solvers via Semantic Fusion”</a> in Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, New York, NY, USA, 2020, pp. 718–730. Full details | PDF
  16. D. Ancona, S. Fagorzi, and E. Zucca, “A calculus for dynamic linking,” in Italian Conference on Theoretical Computer Science, 2003, pp. 284–301. Full details | PDF
  17. E. Torlak, “A constraint solver for software engineering: finding models and cores of large relational specifications,” PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 2009. Full details | PDF
  18. G. Jenson, J. Dietrich, and H. W. Guesgen, “A Formal Framework to Optimise Component Dependency Resolution,” in 17th Asia Pacific Software Engineering Conference, APSEC 2010, Sydney, Australia, November 30 - December 3, 2010, 2010, pp. 226–233. Full details | PDF
  19. T. Ringer, D. Grossman, D. Schwartz-Narbonne, and S. Tasiran, “A Solver-Aided Language for Test Input Generation,” Proc. ACM Program. Lang., vol. 1, no. OOPSLA, Oct. 2017. Full details | PDF
  20. G. Jenson, “A Study of Software Component System Evolution,” PhD thesis, Massey University, Palmerston North, New Zealand, 2013. Full details | PDF
  21. T. Winters, “ABI - Now or Never,” in C++ Standards Committee WG21, 2020. Full details | PDF
  22. C. Jaspan et al., “Advantages and Disadvantages of a Monolithic Repository: A Case Study at Google,” in Proceedings of the 40th International Conference on Software Engineering: Software Engineering in Practice, New York, NY, USA, 2018, pp. 225–234. Full details | PDF
  23. D. Jackson, “Alloy: A Language and Tool for Exploring Software Designs,” Commun. ACM, vol. 62, no. 9, pp. 66–76, Aug. 2019. Full details | PDF
  24. S. McIntosh, B. Adams, T. H. D. Nguyen, Y. Kamei, and A. E. Hassan, “An empirical study of build maintenance effort,” in 2011 33rd International Conference on Software Engineering (ICSE), 2011, pp. 141–150. Full details | PDF
  25. M. Vieira and D. Richardson, “Analyzing dependencies in large component-based systems,” in Proceedings 17th IEEE International Conference on Automated Software Engineering, 2002, pp. 241–244. Full details | PDF
  26. A. R. Bernat and B. P. Miller, “Anywhere, Any-Time Binary Instrumentation,” in Proceedings of the 10th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools, New York, NY, USA, 2011, pp. 9–16. Full details | PDF
  27. D. Beckingsale, O. Pearce, I. Laguna, and T. Gamblin, “Apollo: Reusable Models for Fast, Dynamic Tuning of Input-Dependent Code,” in 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2017, pp. 307–316. Full details | PDF
  28. M. Gebser, R. Kaminski, and T. Schaub, “aspcud: A Linux Package Configuration Tool Based on Answer Set Programming,” Electronic Proceedings in Theoretical Computer Science, vol. 65, pp. 12–25, Aug. 2011. Full details | PDF
  29. J. Ossher, S. Bajracharya, and C. Lopes, “Automated dependency resolution for open source software,” in 2010 7th IEEE Working Conference on Mining Software Repositories (MSR 2010), 2010, pp. 130–140. Full details | PDF
  30. Z. Lin, X. Zhang, and D. Xu, “Automatic Reverse Engineering of Data Structures from Binary Execution,” in Proceedings of the 11th Annual Information Security Symposium, West Lafayette, IN, 2010. Full details | PDF
  31. H. Menon, A. Bhatele, and T. Gamblin, “Auto-Tuning Parameter Choices using Bayesian Optimization,” in Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS’20), 2020. Full details | PDF
  32. A. Ponomarenko and V. Rubanov, “Backward compatibility of software interfaces: Steps towards automatic verification,” Programming and Computer Software, vol. 38, no. 5, pp. 257–267, Sep. 2012. Full details | PDF
  33. J. Caballero, N. M. Johnson, S. McCamant, and D. Song, “Binary code extraction and interface identification for security applications,” CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE, 2009. Full details | PDF
  34. X. Meng and B. P. Miller, “Binary Code is Not Easy,” in Proceedings of the 25th International Symposium on Software Testing and Analysis, New York, NY, USA, 2016, pp. 24–35. Full details | PDF
  35. J. J. Thiagarajan et al., “Bootstrapping Parameter Space Exploration for Fast Tuning,” in International Conference on Supercomputing (ICS’18), Beijing, China, 2018. Full details | PDF
  36. T. Gamblin, “Build for your microarchitecture: experiences with Spack and archspec,” in Free and Open source Software Developers’ European Meeting (FOSDEM’20), Brussels, Belgium, 2020. Full details | PDF
  37. T. Bao, J. Burket, M. Woo, R. Turner, and D. Brumley, “BYTEWEIGHT: Learning to Recognize Functions in Binary Code,” in Proceedings of the 23rd USENIX Conference on Security Symposium, USA, 2014, pp. 845–860. Full details | PDF
  38. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, “Chaff: Engineering an efficient SAT solver,” in Proceedings of the 38th annual Design Automation Conference, 2001, pp. 530–535. Full details | PDF
  39. R. O’Callahan, “clang++/g++ disagree on how template arguments in substitutions are resolved.” https://github.com/itanium-cxx-abi/cxx-abi/issues/68, Nov-2018. Full details | PDF
  40. P. Wang, S. Cuellar, and A. Chlipala, “Compiler verification meets cross-language linking via data abstraction,” ACM SIGPLAN Notices, vol. 49, no. 10, pp. 675–690, 2014. Full details | PDF
  41. “Computer Science infrastructure components for HPC applications.” https://github.com/llnl/axom. Full details | PDF
  42. Anaconda, Inc., “Conda: A Cross-Platform, Language-Agnostic Binary Package Manager.” https://conda.io. Full details | PDF
  43. R. Seater, “Core extraction and non-example generation : debugging and understanding logical models,” Sep. 2006. Full details | PDF
  44. M. Brain and M. D. Vos, “Debugging Logic Programs under the Answer Set Semantics,” in Answer Set Programming, Advances in Theory and Implementation, Proceedings of the 3rd Intl. ASP’05 Workshop, Bath, UK, September 27-29, 2005, 2005, vol. 142. Full details | PDF
  45. I. Shlyakhter, R. Seater, D. Jackson, M. Sridharan, and M. Taghdiri, “Debugging overconstrained declarative models using unsatisfiable cores,” in 18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings. Full details | PDF
  46. P. Abate, R. Di Cosmo, R. Treinen, and S. Zacchiroli, “Dependency solving: a separate concern in component evolution management,” Journal of Systems and Software, vol. 85, no. 10, pp. 2228–2240, 2012. Full details | PDF
  47. P. Abate, R. Di Cosmo, G. Gousios, and S. Zacchiroli, “Dependency Solving Is Still Hard, but We Are Getting Better at It,” in 2020 IEEE 27th International Conference on Software Analysis, Evolution and Reengineering (SANER), 2020, pp. 547–551. Full details | PDF
  48. J. Dietrich, D. J. Pearce, J. Stringer, A. Tahir, and K. Blincoe, “Dependency Versioning in the Wild,” in Proceedings of the 16th International Conference on Mining Software Repositories, 2019, pp. 349–359. Full details | PDF
  49. R. G. Kula, D. M. German, A. Ouni, T. Ishio, and K. Inoue, “Do developers update their library dependencies?,” Empirical Software Engineering, vol. 23, no. 1, pp. 384–417, 2018. Full details | PDF
  50. M. Hicks, J. T. Moore, and S. Nettles, “Dynamic software updating,” ACM SIGPLAN Notices, vol. 36, no. 5, pp. 13–23, 2001. Full details | PDF
  51. R. D. Cosmo, “EDOS deliverable WP2-D2.1: Report on Formal Management of Software Dependencies,” INRIA, May 2005. Full details | PDF
  52. M. Kechagia, X. Devroey, A. Panichella, G. Gousios, and A. van Deursen, “Effective and efficient API misuse detection via exception propagation and search-based testing,” in Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 2019, Beijing, China, July 15-19, 2019, 2019, pp. 192–203. Full details | PDF
  53. N. E. Rosenblum, B. P. Miller, and X. Zhu, “Extracting Compiler Provenance from Program Binaries,” in Proceedings of the 9th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, New York, NY, USA, 2010, pp. 21–28. Full details | PDF
  54. A. Gelder, “Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution .,” 2002. Full details | PDF
  55. R. D. Cosmo and S. Zacchiroli, “Feature Diagrams as Package Dependencies,” in Software Product Lines: Going Beyond - 14th International Conference, SPLC 2010, Jeju Island, South Korea, September 13-17, 2010. Proceedings, 2010, vol. 6287, pp. 476–480. Full details | PDF
  56. X. Yang, Y. Chen, E. Eide, and J. Regehr, “Finding and Understanding Bugs in C Compilers,” in Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, New York, NY, USA, 2011, pp. 283–294. Full details | PDF
  57. J. Bornholt and E. Torlak, “Finding code that explodes under symbolic evaluation,” Proceedings of the ACM on Programming Languages, vol. 2, no. OOPSLA, pp. 1–26, 2018. Full details | PDF
  58. R. L. Bown, “First International Conference on Ada (R) Programming Language Applications for the NASA Space Station, volume 2,” 1986. Full details | PDF
  59. T. Wang, N. Jain, D. Böhme, F. Mueller, and T. Gamblin, “FuncyTuner: Auto-tuning Scientific Applications With Per-loop Compilation,” in International Conference on Parallel Processing (ICPP’19), Tsukuba, Japan, 2019. Full details | PDF
  60. E. Torlak and R. Bodik, “Growing solver-aided languages with rosette,” in Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software, 2013, pp. 135–152. Full details | PDF
  61. G. D. Jenson, “Improving Component Dependency Resolution with Soft Constraints, Validation and Verification,” in 2009 IEEE/ACM International Conference on Automated Software Engineering, 2009, pp. 716–720. Full details | PDF
  62. CodeSourcery, Compaq, EDG, HP, IBM, Intel, Red Hat, and SGI, “Itanium C++ ABI.” https://itanium-cxx-abi.github.io/cxx-abi/abi.html, 2001. Full details | PDF
  63. N. Rosenblum, X. Zhu, B. Miller, and K. Hunt, “Learning to Analyze Binary Computer Code,” in Proceedings of the 23rd National Conference on Artificial Intelligence - Volume 2, 2008, pp. 798–804. Full details | PDF
  64. D. Seketeli, “libabigail: The ABI Generic Analysis and Instrumentation Library.” https://sourceware.org/libabigail/. Full details | PDF
  65. M. Taghdiri, R. Seater, and D. Jackson, “Lightweight Extraction of Syntactic Specifications,” in Proceedings of the 14th ACM SIGSOFT International Symposium on Foundations of Software Engineering, New York, NY, USA, 2006, pp. 276–286. Full details | PDF
  66. G. Becker, P. Scheibel, M. P. LeGendre, and T. Gamblin, “Managing Combinatorial Software Installations with Spack,” in Second International Workshop on HPC User Support Tools (HUST’16), Salt Lake City, UT, 2016. Full details | PDF
  67. F. Mancinelli et al., “Managing the Complexity of Large Free and Open Source Package-Based Software Distributions,” in 21st IEEE/ACM International Conference on Automated Software Engineering (ASE’06), 2006, pp. 199–208. Full details | PDF
  68. W. Frings, D. H. Ahn, M. LeGendre, T. Gamblin, B. R. de Supinski, and F. Wolf, “Massively Parallel Loading,” in International Conference on Supercomputing (ICS’13), Eugene, OR, 2013. Full details | PDF
  69. E. Torlak, M. Vaziri, and J. Dolby, “MemSAT: Checking Axiomatic Specifications of Memory Models,” SIGPLAN Not., vol. 45, no. 6, pp. 341–350, Jun. 2010. Full details | PDF
  70. I. S. Wiese, I. Polato, and G. Pinto, “Naming the Pain in Developing Scientific Software,” IEEE Software, 2019. Full details | PDF
  71. E. Dolstra, M. de Jonge, and E. Visser, “Nix: A Safe and Policy-Free System for Software Deployment,” in Proceedings of the 18th Large Installation System Administration Conference (LISA XVIII), Berkeley, CA, USA, 2004, pp. 79–92. Full details | PDF
  72. E. Dolstra and A. Löh, “NixOS: A Purely Functional Linux Distribution,” in Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming, New York, NY, USA, 2008, pp. 367–378. Full details | PDF
  73. A. Decan, T. Mens, and M. Claes, “On the Topology of Package Dependency Networks: A Comparison of Three Programming Language Ecosystems,” in Proccedings of the 10th European Conference on Software Architecture Workshops, New York, NY, USA, 2016. Full details | PDF
  74. A. Miranda and J. Pimentel, “On the Use of Package Managers by the C++ Open-Source Community,” in Proceedings of the 33rd Annual ACM Symposium on Applied Computing, New York, NY, USA, 2018, pp. 1483–1491. Full details | PDF
  75. C. Tucker, D. Shuffelton, R. Jhala, and S. Lerner, “OPIUM: Optimal Package Install/Uninstall Manager,” in Proceedings of the 29th International Conference on Software Engineering, USA, 2007, pp. 178–188. Full details | PDF
  76. M. Gebser, B. Kaufmann, R. Kaminski, M. Ostrowski, T. Schaub, and M. Schneider, “Potassco: The Potsdam answer set solving collection,” AI Communications, vol. 24, no. 2, pp. 107–124, 2011. Full details | PDF
  77. L. C. Harris and B. P. Miller, “Practical Analysis of Stripped Binary Code,” SIGARCH Comput. Archit. News, vol. 33, no. 5, pp. 63–68, Dec. 2005. Full details | PDF
  78. H. Seo, C. Sadowski, S. Elbaum, E. Aftandilian, and R. Bowdidge, “Programmers’ Build Errors: A Case Study (at Google),” in Proceedings of the 36th International Conference on Software Engineering, New York, NY, USA, 2014, pp. 724–734. Full details | PDF
  79. N. Weizenbaum, “PubGrub: Next-Generation Version Solving.” https://medium.com/@nex3/pubgrub-2fb6470504f, Apr-2018. Full details | PDF
  80. “RADIUSS (Rapid Application Development via an Institutional Universal Software Stack).” https://hpc.llnl.gov/radiuss, 2019. Full details | PDF
  81. N. Rosenblum, B. P. Miller, and X. Zhu, “Recovering the Toolchain Provenance of Binary Code,” in Proceedings of the 2011 International Symposium on Software Testing and Analysis, New York, NY, USA, 2011, pp. 100–110. Full details | PDF
  82. E. Kula, A. Rastogi, H. Huijgens, A. van Deursen, and G. Gousios, “Releasing fast and slow: an exploratory case study at ING,” in Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC/SIGSOFT FSE 2019, Tallinn, Estonia, August 26-30, 2019, 2019, pp. 785–795. Full details | PDF
  83. L. De Moura and N. Bjørner, “Satisfiability modulo Theories: Introduction and Applications,” Commun. ACM, vol. 54, no. 9, pp. 69–77, Sep. 2011. Full details | PDF
  84. D. Yurichev, “SAT/SMT by example.” Online. Full details | PDF
  85. T. Preston-Werner, “Semantic Versioning 2.0. 0.” http://semver. org, 2013. Full details | PDF
  86. J. Hejderup, A. van Deursen, and G. Gousios, “Software ecosystem call graph for dependency management,” in Proceedings of the 40th International Conference on Software Engineering: New Ideas and Emerging Results, ICSE (NIER) 2018, Gothenburg, Sweden, May 27 - June 03, 2018, 2018, pp. 101–104. Full details | PDF
  87. P. Naur and B. Randell, “Software Engineering: Report of a conference sponsored by the NATO Science Committee, Garmisch, Germany, 7th-11th October 1968,” 1969. Full details | PDF
  88. G. Kumfert and T. Epperly, “Software in the DOE: The Hidden Overhead of ‘The Build,’” Lawrence Livermore National Laboratory, Feb. 2002. Full details | PDF
  89. T. Gamblin, “Spack’s new Concretizer: Dependency solving is more than just SAT!,” in Free and Open source Software Developers’ European Meeting (FOSDEM’20), Brussels, Belgium, 2020. Full details | PDF
  90. R. Kikas, G. Gousios, M. Dumas, and D. Pfahl, “Structure and Evolution of Package Dependency Networks,” in Proceedings of the 14th International Conference on Mining Software Repositories, 2017, pp. 102–112. Full details | PDF
  91. R. Cox, “Surviving Software Dependencies,” Commun. ACM, vol. 62, no. 9, pp. 36–43, Aug. 2019. Full details | PDF
  92. P. Cuoq et al., “Testing static analyzers with randomly generated programs,” in NASA Formal Methods Symposium, 2012, pp. 120–125. Full details | PDF
  93. R. J. Krebbers, “The C standard formalized in Coq,” PhD thesis, [Sl: sn], 2015. Full details | PDF
  94. L. Hochstein and Y. Jiao, “The Cost of the Build Tax in Scientific Software,” in International Symposium on Empirical Software Engineering and Measurement, 2011, pp. 384–387. Full details | PDF
  95. S. Kell, D. P. Mulligan, and P. Sewell, “The Missing Link: Explaining ELF Static Linking, Semantically,” SIGPLAN Not., vol. 51, no. 10, pp. 607–623, Oct. 2016. Full details | PDF
  96. B. P. Miller et al., “The Paradyn parallel performance measurement tool,” Computer, vol. 28, no. 11, pp. 37–46, 1995. Full details | PDF
  97. T. Gamblin et al., “The Spack Package Manager: Bringing order to HPC software chaos,” in Supercomputing 2015 (SC’15), Austin, Texas, 2015. Full details | PDF
  98. A. Ignatiev, M. Janota, and J. Marques-Silva, “Towards efficient optimization in package management systems,” in Proceedings of the 36th International Conference on Software Engineering, 2014, pp. 745–755. Full details | PDF
  99. A. Maier, H. Gascon, C. Wressnegger, and K. Rieck, “TypeMiner: Recovering Types in Binary Programs Using Machine Learning,” in International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment, 2019, pp. 288–308. Full details | PDF
  100. N. Glew and G. Morrisett, “Type-Safe Linking and Modular Assembly Language,” in Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New York, NY, USA, 1999, pp. 250–261. Full details | PDF
  101. N. Sangal, E. Jordan, V. Sinha, and D. Jackson, “Using dependency models to manage complex software architecture,” in Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, 2005, pp. 167–176. Full details | PDF
  102. S. Knight, J. Wilke, and T. Gamblin, “Using Malleable Task Scheduling to Accelerate Package Manager Installations,” in Workshop on HPC User Support Tools (HUST-19), Denver, CO, 2019. Full details | PDF
  103. P. Abate, R. Di Cosmo, L. Gesbert, F. Le Fessant, and S. Zacchiroli, “Using Preferences to Tame your Package Manager,” in OCaml 2014, Goteborg, Sweden, 2014. Full details | PDF
  104. M. Melara et al., “Using Spack to Manage Software on Cray Supercomputers,” in Cray Users Group (CUG 2017), Seattle, WA, 2017. Full details | PDF
  105. R. Cox, “Version SAT.” https://research.swtch.com/version-sat, Dec-2016. Full details | PDF
  106. A. Decan and T. Mens, “What do package dependencies tell us about semantic versioning?,” IEEE Transactions on Software Engineering, 2019. Full details | PDF
  107. T. Winters, “What is ABI, and What Should WG21Do About It?,” in C++ Standards Committee WG21, 2020. Full details | PDF
  108. C. Artho, K. Suzaki, R. Di Cosmo, R. Treinen, and S. Zacchiroli, “Why do software packages conflict?,” in 2012 9th IEEE Working Conference on Mining Software Repositories (MSR), 2012, pp. 141–150. Full details | PDF
  109. P. F. Dubois, T. Epperly, and G. Kumfert, “Why Johnny can’t build [portable scientific software],” Computing in Science Engineering, vol. 5, no. 5, pp. 83–88, 2003. Full details | PDF
  110. A. Huebl, “Working with Multiple Package Managers,” in Collegeville Workshop, Virtual Event, 2020. Full details | PDF
  111. L. De Moura and N. Bjørner, “Z3: An efficient SMT solver,” in International conference on Tools and Algorithms for the Construction and Analysis of Systems, 2008, pp. 337–340. Full details | PDF
Top