• HajiHosseinKhani S, Lashkari A and Mizani Oskui A. (2023). Unveiling Vulnerable Smart Contracts: Toward Profiling Vulnerable Smart Contracts using Genetic Algorithm and Generating Benchmark Dataset. Blockchain: Research and Applications. 10.1016/j.bcra.2023.100171. (100171). Online publication date: 1-Nov-2023.

    https://linkinghub.elsevier.com/retrieve/pii/S2096720923000465

  • Fachinetti L, Palmer Z, Smith S, Wu K and Yorihiro A. A Set-Based Context Model for Program Analysis. Programming Languages and Systems. (3-24).

    https://doi.org/10.1007/978-3-030-64437-6_1

  • Jaiswal S, Khedker U and Chakraborty S. (2020). Bidirectionality in flow-sensitive demand-driven analysis. Science of Computer Programming. 10.1016/j.scico.2020.102391. (102391). Online publication date: 1-Jan-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0167642320300022

  • Tridgell S, Kumm M, Hardieck M, Boland D, Moss D, Zipf P and Leong P. (2019). Unrolling Ternary Neural Networks. ACM Transactions on Reconfigurable Technology and Systems. 12:4. (1-23). Online publication date: 31-Dec-2020.

    https://doi.org/10.1145/3359983

  • Engelhardt N and So H. (2019). GraVF-M. ACM Transactions on Reconfigurable Technology and Systems. 12:4. (1-28). Online publication date: 27-Nov-2019.

    https://doi.org/10.1145/3357596

  • Facchinetti L, Palmer Z and Smith S. (2019). Higher-order Demand-driven Program Analysis. ACM Transactions on Programming Languages and Systems. 41:3. (1-53). Online publication date: 30-Sep-2019.

    https://doi.org/10.1145/3310340

  • Frühstück A, Alhashim I and Wonka P. (2019). TileGAN. ACM Transactions on Graphics. 38:4. (1-11). Online publication date: 31-Aug-2019.

    https://doi.org/10.1145/3306346.3322993

  • Tricard T, Efremov S, Zanni C, Neyret F, Martínez J and Lefebvre S. (2019). Procedural phasor noise. ACM Transactions on Graphics. 38:4. (1-13). Online publication date: 31-Aug-2019.

    https://doi.org/10.1145/3306346.3322990

  • Monszpart A, Guerrero P, Ceylan D, Yumer E and Mitra N. (2019). iMapper. ACM Transactions on Graphics. 38:4. (1-15). Online publication date: 31-Aug-2019.

    https://doi.org/10.1145/3306346.3322961

  • Germane K, McCarthy J, Adams M and Might M. (2019). Demand Control-Flow Analysis. Verification, Model Checking, and Abstract Interpretation. 10.1007/978-3-030-11245-5_11. (226-246).

    http://link.springer.com/10.1007/978-3-030-11245-5_11

  • Apinis K, Vene V and Vojdani V. (2018). Demand-driven interprocedural analysis for map-based abstract domains. Journal of Logical and Algebraic Methods in Programming. 10.1016/j.jlamp.2018.06.003. 100. (57-70). Online publication date: 1-Nov-2018.

    https://linkinghub.elsevier.com/retrieve/pii/S2352220817300391

  • Biswas A, Ghosal D and Nagaraja S. (2017). A Survey of Timing Channels and Countermeasures. ACM Computing Surveys. 50:1. (1-39). Online publication date: 31-Jan-2018.

    https://doi.org/10.1145/3023872

  • Su T, Wu K, Miao W, Pu G, He J, Chen Y and Su Z. (2017). A Survey on Data-Flow Testing. ACM Computing Surveys. 50:1. (1-35). Online publication date: 31-Jan-2018.

    https://doi.org/10.1145/3020266

  • Facchinetti L, Palmer Z and Smith S. (2017). Relative Store Fragments for Singleton Abstraction. Static Analysis. 10.1007/978-3-319-66706-5_6. (106-127).

    http://link.springer.com/10.1007/978-3-319-66706-5_6

  • Mani S, Padhye R and Sinha V. Mining API Expertise Profiles with Partial Program Analysis. Proceedings of the 9th India Software Engineering Conference. (109-118).

    https://doi.org/10.1145/2856636.2856646

  • Ding S, Zhang H and Beng Kuan Tan H. (2014). Detecting infeasible branches based on code patterns 2014 Software Evolution Week - IEEE Conference on Software Maintenance, Reengineering and Reverse Engineering (CSMR-WCRE). 10.1109/CSMR-WCRE.2014.6747227. 978-1-4799-3752-3. (74-83).

    http://ieeexplore.ieee.org/document/6747227/

  • Le W and Soffa M. (2013). Marple. ACM Transactions on Software Engineering and Methodology. 22:3. (1-38). Online publication date: 1-Jul-2013.

    https://doi.org/10.1145/2491509.2491512

  • Mayr C, Zdun U and Dustdar S. (2013). Enhancing traceability of persistent data access flows in process-driven SOAs. Distributed and Parallel Databases. 31:1. (1-45). Online publication date: 1-Mar-2013.

    https://doi.org/10.1007/s10619-012-7102-6

  • Kim H, Doh K and Schmidt D. (2013). Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing. Static Analysis. 10.1007/978-3-642-38856-9_12. (194-214).

    http://link.springer.com/10.1007/978-3-642-38856-9_12

  • Zhang C, Lu L, Zhou H, Zhao J and Zhang Z. MoonBox. Proceedings of the Third ACM SIGOPS Asia-Pacific conference on Systems. (12-12).

    /doi/10.5555/2387841.2387853

  • Zhang C, Lu L, Zhou H, Zhao J and Zhang Z. MoonBox. Proceedings of the Asia-Pacific Workshop on Systems. (1-6).

    https://doi.org/10.1145/2349896.2349908

  • Lu L, Zhang C and Zhao J. Soot-based implementation of a demand-driven reaching definitions analysis. Proceedings of the ACM SIGPLAN International Workshop on State of the Art in Java Program analysis. (21-26).

    https://doi.org/10.1145/2259051.2259055

  • Takimoto M. (2012). Demand-driven Partial Dead Code Elimination. IPSJ Online Transactions. 10.2197/ipsjtrans.5.79. 5. (79-86).

    http://joi.jlc.jst.go.jp/JST.JSTAGE/ipsjtrans/5.79?from=CrossRef

  • ZHAO Y, GONG Y, LIU L, XIAO Q and YANG Z. (2011). Improving the Efficiency and Accuracy of Path-Sensitive Defect Detecting. Chinese Journal of Computers. 10.3724/SP.J.1016.2011.01100. 34:6. (1100-1113). Online publication date: 6-Sep-2011.

    http://pub.chinasciencejournal.com/article/getArticleRedirect.action?doiCode=10.3724/SP.J.1016.2011.01100

  • Le W and Soffa M. Generating analyses for detecting faults in path segments. Proceedings of the 2011 International Symposium on Software Testing and Analysis. (320-330).

    https://doi.org/10.1145/2001420.2001459

  • Brauer J and King A. Approximate quantifier elimination for propositional boolean formulae. Proceedings of the Third international conference on NASA Formal methods. (73-88).

    /doi/10.5555/1986308.1986318

  • Doh K, Kim H and Schmidt D. Abstract LR-parsing. Formal modeling. (90-109).

    /doi/10.5555/2074591.2074599

  • Doh K, Kim H and Schmidt D. (2011). Abstract LR-Parsing. Formal Modeling: Actors, Open Systems, Biological Systems. 10.1007/978-3-642-24933-4_6. (90-109).

    http://link.springer.com/10.1007/978-3-642-24933-4_6

  • Brauer J and King A. (2011). Approximate Quantifier Elimination for Propositional Boolean Formulae. NASA Formal Methods. 10.1007/978-3-642-20398-5_7. (73-88).

    http://link.springer.com/10.1007/978-3-642-20398-5_7

  • Le W and Soffa M. Path-based fault correlations. Proceedings of the eighteenth ACM SIGSOFT international symposium on Foundations of software engineering. (307-316).

    https://doi.org/10.1145/1882291.1882336

  • Naeem N, Lhoták O and Rodriguez J. Practical extensions to the IFDS algorithm. Proceedings of the 19th joint European conference on Theory and Practice of Software, international conference on Compiler Construction. (124-144).

    https://doi.org/10.1007/978-3-642-11970-5_8

  • Doh K, Kim H and Schmidt D. Abstract Parsing. Proceedings of the 16th International Symposium on Static Analysis. (256-272).

    https://doi.org/10.1007/978-3-642-03237-0_18

  • (2009). References. Data Flow Analysis. 10.1201/9780849332517.bmatt. (371-378). Online publication date: 27-Mar-2009.

    http://www.crcnetbase.com/doi/10.1201/9780849332517.bmatt

  • Le W and Soffa M. Marple. Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering. (272-282).

    https://doi.org/10.1145/1453101.1453137

  • Dagenais B and Hendren L. (2008). Enabling static analysis for partial java programs. ACM SIGPLAN Notices. 43:10. (313-328). Online publication date: 27-Oct-2008.

    https://doi.org/10.1145/1449955.1449790

  • Dagenais B and Hendren L. Enabling static analysis for partial java programs. Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications. (313-328).

    https://doi.org/10.1145/1449764.1449790

  • Kuhl S, Creem-Regehr S and Thompson W. (2008). Recalibration of rotational locomotion in immersive virtual environments. ACM Transactions on Applied Perception. 5:3. (1-11). Online publication date: 1-Aug-2008.

    https://doi.org/10.1145/1402236.1402241

  • Fontana F and Rocchesso D. (2008). Auditory distance perception in an acoustic pipe. ACM Transactions on Applied Perception. 5:3. (1-15). Online publication date: 1-Aug-2008.

    https://doi.org/10.1145/1402236.1402240

  • Nees M and Walker B. (2008). Data density and trend reversals in auditory graphs. ACM Transactions on Applied Perception. 5:3. (1-24). Online publication date: 1-Aug-2008.

    https://doi.org/10.1145/1402236.1402237

  • Tardos G. (2008). Optimal probabilistic fingerprint codes. Journal of the ACM. 55:2. (1-24). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1346330.1346335

  • Gottlob G and Nash A. (2008). Efficient core computation in data exchange. Journal of the ACM. 55:2. (1-49). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1346330.1346334

  • Benedikt M, Fan W and Geerts F. (2008). XPath satisfiability in the presence of DTDs. Journal of the ACM. 55:2. (1-79). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1346330.1346333

  • Arenas M and Libkin L. (2008). XML data exchange. Journal of the ACM. 55:2. (1-72). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1346330.1346332

  • Abadi M and Warinschi B. (2008). Security analysis of cryptographically controlled access to XML documents. Journal of the ACM. 55:2. (1-29). Online publication date: 1-May-2008.

    https://doi.org/10.1145/1346330.1346331

  • Shehab M, Bhattacharya K and Ghafoor A. (2007). Web services discovery in secure collaboration environments. ACM Transactions on Internet Technology. 8:1. (5-es). Online publication date: 1-Nov-2007.

    https://doi.org/10.1145/1294148.1294153

  • Gupta V, Sigman K, Harchol-Balter M and Whitt W. (2007). Insensitivity for PS server farms with JSQ routing. ACM SIGMETRICS Performance Evaluation Review. 35:2. (24-26). Online publication date: 1-Sep-2007.

    https://doi.org/10.1145/1330555.1330566

  • Ciucu F. (2007). Exponential supermartingales for evaluating end-to-end backlog bounds. ACM SIGMETRICS Performance Evaluation Review. 35:2. (21-23). Online publication date: 1-Sep-2007.

    https://doi.org/10.1145/1330555.1330565

  • Wang P and Bohacek S. (2007). An overview of tractable computation of optimal scheduling and routing in mesh networks. ACM SIGMETRICS Performance Evaluation Review. 35:2. (18-20). Online publication date: 1-Sep-2007.

    https://doi.org/10.1145/1330555.1330564

  • Hoßfeld T, Leibnitz K and Remiche M. (2007). Modeling of an online TV recording service. ACM SIGMETRICS Performance Evaluation Review. 35:2. (15-17). Online publication date: 1-Sep-2007.

    https://doi.org/10.1145/1330555.1330563

  • Osogami T. (2007). Accuracy of measured throughputs and mean response times. ACM SIGMETRICS Performance Evaluation Review. 35:2. (9-11). Online publication date: 1-Sep-2007.

    https://doi.org/10.1145/1330555.1330561

  • Le W and Soffa M. Refining buffer overflow detection via demand-driven path-sensitive analysis. Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering. (63-68).

    https://doi.org/10.1145/1251535.1251546

  • Ancona D, Anderson C, Damiani F, Drossopoulou S, Giannini P and Zucca E. (2007). A provenly correct translation of Fickle into Java. ACM Transactions on Programming Languages and Systems. 29:2. (13-es). Online publication date: 1-Apr-2007.

    https://doi.org/10.1145/1216374.1216381

  • Marathe J, Mueller F, Mohan T, Mckee S, De Supinski B and Yoo A. (2007). METRIC. ACM Transactions on Programming Languages and Systems. 29:2. (12-es). Online publication date: 1-Apr-2007.

    https://doi.org/10.1145/1216374.1216380

  • Hirzel M, Dincklage D, Diwan A and Hind M. (2007). Fast online pointer analysis. ACM Transactions on Programming Languages and Systems. 29:2. (11-es). Online publication date: 1-Apr-2007.

    https://doi.org/10.1145/1216374.1216379

  • Snodgrass R. (2007). Editorial. ACM Transactions on Database Systems. 32:1. (1-es). Online publication date: 1-Mar-2007.

    https://doi.org/10.1145/1206049.1206050

  • Archer A and Tardos É. (2007). Frugal path mechanisms. ACM Transactions on Algorithms. 3:1. (1-22). Online publication date: 1-Feb-2007.

    https://doi.org/10.1145/1186810.1186813

  • Cormode G and Muthukrishnan S. (2007). The string edit distance matching problem with moves. ACM Transactions on Algorithms. 3:1. (1-19). Online publication date: 1-Feb-2007.

    https://doi.org/10.1145/1186810.1186812

  • Bandyopadhyay S, Bhattacharyya D and Pal A. (2006). Secure delivery of handwritten signature. Ubiquity. 2006:October. (1-12). Online publication date: 1-Oct-2006.

    https://doi.org/10.1145/1183081.1183087

  • Salmeron J. (2006). Management information systems. Ubiquity. 2006:October. (2-2). Online publication date: 1-Oct-2006.

    https://doi.org/10.1145/1183081.1183083

  • Banka H and Mitra S. (2006). Evolutionary biclustering of gene expressions. Ubiquity. 2006:October. (1-12). Online publication date: 1-Oct-2006.

    https://doi.org/10.1145/1183081.1183082

  • Rochecouste O, Pokam G and Seznec A. (2006). A case for a complexity-effective, width-partitioned microarchitecture. ACM Transactions on Architecture and Code Optimization. 3:3. (295-326). Online publication date: 1-Sep-2006.

    https://doi.org/10.1145/1162690.1162693

  • Hazelwood K and Smith M. (2006). Managing bounded code caches in dynamic binary optimization systems. ACM Transactions on Architecture and Code Optimization. 3:3. (263-294). Online publication date: 1-Sep-2006.

    https://doi.org/10.1145/1162690.1162692

  • Zhao M, Childers B and Soffa M. (2006). An approach toward profit-driven optimization. ACM Transactions on Architecture and Code Optimization. 3:3. (231-262). Online publication date: 1-Sep-2006.

    https://doi.org/10.1145/1162690.1162691

  • Duncan M, Kelley M and Jacobson J. (2006). High school graduate refines gyromouse interface for virtual reality. ACM SIGGRAPH Computer Graphics. 40:2. (2-es). Online publication date: 1-Aug-2006.

    https://doi.org/10.1145/1181091.1181095

  • Ambainis A, Schulman L and Vazirani U. (2006). Computing with highly mixed states. Journal of the ACM. 53:3. (507-531). Online publication date: 1-May-2006.

    https://doi.org/10.1145/1147954.1147962

  • Saha D and Ramakrishnan C. Incremental and demand-driven points-to analysis using logic programming. Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming. (117-128).

    https://doi.org/10.1145/1069774.1069785

  • Zhao M, Childers B and Soffa M. A Model-Based Framework. Proceedings of the international symposium on Code generation and optimization. (317-327).

    https://doi.org/10.1109/CGO.2005.2

  • Xu B, Qian J, Zhang X, Wu Z and Chen L. (2005). A brief survey of program slicing. ACM SIGSOFT Software Engineering Notes. 30:2. (1-36). Online publication date: 1-Mar-2005.

    https://doi.org/10.1145/1050849.1050865

  • Stankovic J. (2004). Research challenges for wireless sensor networks. ACM SIGBED Review. 1:2. (9-12). Online publication date: 1-Jul-2004.

    https://doi.org/10.1145/1121776.1121780

  • Akyildiz I, Pompili D and Melodia T. (2004). Challenges for efficient communication in underwater acoustic sensor networks. ACM SIGBED Review. 1:2. (3-8). Online publication date: 1-Jul-2004.

    https://doi.org/10.1145/1121776.1121779

  • Bodík R, Gupta R and Soffa M. (2004). Complete removal of redundant expressions. ACM SIGPLAN Notices. 39:4. (596-611). Online publication date: 1-Apr-2004.

    https://doi.org/10.1145/989393.989453

  • Sittampalam G, de Moor O and Larsen K. Incremental execution of transformation specifications. Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (26-38).

    https://doi.org/10.1145/964001.964004

  • Sittampalam G, de Moor O and Larsen K. (2004). Incremental execution of transformation specifications. ACM SIGPLAN Notices. 39:1. (26-38). Online publication date: 1-Jan-2004.

    https://doi.org/10.1145/982962.964004

  • Spoto F and Jensen T. (2003). Class analyses as abstract interpretations of trace semantics. ACM Transactions on Programming Languages and Systems. 25:5. (578-630). Online publication date: 1-Sep-2003.

    https://doi.org/10.1145/937563.937565

  • Merlo E, Antoniol G and Brunelle P. Fast flow analysis to compute fuzzy estimates of risk levels Seventh European Conference on Software Maintenance and Reengineering. 10.1109/CSMR.2003.1192443. 0-7695-1902-4. (351-360).

    http://ieeexplore.ieee.org/document/1192443/

  • Antoniol G, Ceccarelli M, Rollo F, Longo W, Nutile T, Ciullo M, Colonna E, Calabria A, Astore M, Lembo A, Toriello P and Persico M. (2003). Browsing Large Pedigrees to Study of the Isolated Populations in the “Parco Nazionale del Cilento e Vallo di Diano”. Neural Nets. 10.1007/978-3-540-45216-4_29. (258-268).

    http://link.springer.com/10.1007/978-3-540-45216-4_29

  • Souter A and Pollock L. (2002). Characterization and automatic identification of type infeasible call chains. Information and Software Technology. 10.1016/S0950-5849(02)00126-X. 44:13. (721-732). Online publication date: 1-Oct-2002.

    http://linkinghub.elsevier.com/retrieve/pii/S095058490200126X

  • Gupta R and Gupta N. (2002). Data Flow Testing. The Compiler Design Handbook. 10.1201/9781420040579.ch7. Online publication date: 25-Sep-2002.

    http://www.crcnetbase.com/doi/10.1201/9781420040579.ch7

  • Gupta R, Mehofer E and Zhang Y. (2002). Profile-Guided Compiler Optimizations. The Compiler Design Handbook. 10.1201/9781420040579.ch4. Online publication date: 25-Sep-2002.

    http://www.crcnetbase.com/doi/10.1201/9781420040579.ch4

  • Khedker U. (2002). Data Flow Analysis. The Compiler Design Handbook. 10.1201/9781420040579.ch1. Online publication date: 25-Sep-2002.

    http://www.crcnetbase.com/doi/10.1201/9781420040579.ch1

  • Fernández M and Espasa R. Speculative Alias Analysis for Executable Code. Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques. (222-231).

    /doi/10.5555/645989.674312

  • Fernandez M and Espasa R. Speculative alias analysis for executable code 2002 International Conference on Parallel Architectures and Compilation Techniques. PACT 2002. 10.1109/PACT.2002.1106020. 0-7695-1620-3. (222-231).

    http://ieeexplore.ieee.org/document/1106020/

  • Hajnal A and Forgacs I. A precise demand-driven definition-use chaining algorithm Sixth European Conference on Software Maintenance and Reengineering. 10.1109/CSMR.2002.995792. 0-7695-1438-3. (77-86).

    http://ieeexplore.ieee.org/document/995792/

  • Agrawal G, Li J and Su Q. (2002). Evaluating a Demand Driven Technique for Call Graph Construction. Compiler Construction. 10.1007/3-540-45937-5_5. (29-45).

    http://link.springer.com/10.1007/3-540-45937-5_5

  • Souter A and Pollock L. Incremental Call Graph Reanalysis for Object-Oriented Software Maintenance. Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01).

    https://doi.org/10.1109/ICSM.2001.972787

  • Zhang Y and Gupta R. Timestamped whole program path representation and its applications. Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation. (180-190).

    https://doi.org/10.1145/378795.378835

  • Shaham R, Kolodner E and Sagiv M. Heap profiling for space-efficient Java. Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation. (104-113).

    https://doi.org/10.1145/378795.378820

  • Vivien F and Rinard M. Incrementalized pointer and escape analysis. Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation. (35-46).

    https://doi.org/10.1145/378795.378804

  • Zhang Y and Gupta R. (2001). Timestamped whole program path representation and its applications. ACM SIGPLAN Notices. 36:5. (180-190). Online publication date: 1-May-2001.

    https://doi.org/10.1145/381694.378835

  • Shaham R, Kolodner E and Sagiv M. (2001). Heap profiling for space-efficient Java. ACM SIGPLAN Notices. 36:5. (104-113). Online publication date: 1-May-2001.

    https://doi.org/10.1145/381694.378820

  • Vivien F and Rinard M. (2001). Incrementalized pointer and escape analysis. ACM SIGPLAN Notices. 36:5. (35-46). Online publication date: 1-May-2001.

    https://doi.org/10.1145/381694.378804

  • Souter A and Pollock L. Type infeasible call chains First IEEE International Workshop on Source Code Analysis and Manipulation. 10.1109/SCAM.2001.972681. 0-7695-1387-5. (194-203).

    http://ieeexplore.ieee.org/document/972681/

  • Spoto F. (2001). Watchpoint Semantics: A Tool for Compositional and Focussed Static Analyses. Static Analysis. 10.1007/3-540-47764-0_8. (127-145).

    http://link.springer.com/10.1007/3-540-47764-0_8

  • Bodík R, Gupta R and Sarkar V. ABCD. Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation. (321-333).

    https://doi.org/10.1145/349299.349342

  • Lin Y and Padua D. Compiler analysis of irregular memory accesses. Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation. (157-168).

    https://doi.org/10.1145/349299.349322

  • Bodík R, Gupta R and Sarkar V. (2000). ABCD. ACM SIGPLAN Notices. 35:5. (321-333). Online publication date: 1-May-2000.

    https://doi.org/10.1145/358438.349342

  • Lin Y and Padua D. (2000). Compiler analysis of irregular memory accesses. ACM SIGPLAN Notices. 35:5. (157-168). Online publication date: 1-May-2000.

    https://doi.org/10.1145/358438.349322

  • Knoop J and Rüthing O. (2000). Constant Propagation on the Value Graph: Simple Constants and Beyond. Compiler Construction. 10.1007/3-540-46423-9_7. (94-110).

    http://link.springer.com/10.1007/3-540-46423-9_7

  • Lin Y and Padua D. (2000). Demand-Driven Interprocedural Array Property Analysis. Languages and Compilers for Parallel Computing. 10.1007/3-540-44905-1_19. (303-317).

    http://link.springer.com/10.1007/3-540-44905-1_19

  • Knoop J. Parallel Data-Flow Analysis of Explicitly Parallel Programs. Proceedings of the 5th International Euro-Par Conference on Parallel Processing. (391-400).

    /doi/10.5555/646664.700753

  • Knoop J. (1999). Parallel Data-Flow Analysis of Explicitly Parallel Programs. Euro-Par’99 Parallel Processing. 10.1007/3-540-48311-X_51. (391-400).

    http://link.springer.com/10.1007/3-540-48311-X_51

  • Knoop J. (1999). Demand-Driven Model Checking for Context-Free Processes. Advances in Computing Science — ASIAN’99. 10.1007/3-540-46674-6_18. (201-213).

    http://link.springer.com/10.1007/3-540-46674-6_18

  • Bodík R, Gupta R and Soffa M. (1998). Complete removal of redundant expressions. ACM SIGPLAN Notices. 33:5. (1-14). Online publication date: 1-May-1998.

    https://doi.org/10.1145/277652.277653

  • Bodík R, Gupta R and Soffa M. Complete removal of redundant expressions. Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation. (1-14).

    https://doi.org/10.1145/277650.277653

  • Gupta R. (1998). A code motion framework for global instruction scheduling. Compiler Construction. 10.1007/BFb0026434. (219-233).

    http://link.springer.com/10.1007/BFb0026434

  • Baraff D. (1991). Coping with friction for non-penetrating rigid body simulation. ACM SIGGRAPH Computer Graphics. 25:4. (31-41). Online publication date: 2-Jul-1991.

    https://doi.org/10.1145/127719.122722

  • Coquillart S and Jancéne P. (1991). Animated free-form deformation. ACM SIGGRAPH Computer Graphics. 25:4. (23-26). Online publication date: 2-Jul-1991.

    https://doi.org/10.1145/127719.122720

  • Wejchert J and Haumann D. (1991). Animation aerodynamics. ACM SIGGRAPH Computer Graphics. 25:4. (19-22). Online publication date: 2-Jul-1991.

    https://doi.org/10.1145/127719.122719

  • d'Hautcourt-Carette F. (1977). A microprogrammed virtual memory for Eclipse. ACM SIGMICRO Newsletter. 8:2. (10-20). Online publication date: 1-Jun-1977.

    https://doi.org/10.1145/1217228.1217229

  • Rice D. (1973). An analytical model for computer system performance evaluation. ACM SIGMETRICS Performance Evaluation Review. 2:2. (14-30). Online publication date: 1-Jun-1973.

    https://doi.org/10.1145/1113644.1113646

  • Duncan F. (1968). ALGOL bulletin no. 28. ACM SIGPLAN Notices. 3:11. (1-83). Online publication date: 1-Nov-1968.

    https://doi.org/10.1145/1139536.1139538

  • Duncan F. (1968). ALGOL bulletin no. 27. ACM SIGPLAN Notices. 3:9. (1-65). Online publication date: 1-Sep-1968.

    https://doi.org/10.1145/1139560.1139562