Literatura científica selecionada sobre o tema "Iterators"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Índice
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Iterators".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Iterators"
Baker, Henry G. "Iterators". ACM SIGPLAN OOPS Messenger 4, n.º 3 (julho de 1993): 18–25. http://dx.doi.org/10.1145/165507.165514.
Texto completo da fonteLiu, Jed, Aaron Kimball e Andrew C. Myers. "Interruptible iterators". ACM SIGPLAN Notices 41, n.º 1 (12 de janeiro de 2006): 283–94. http://dx.doi.org/10.1145/1111320.1111063.
Texto completo da fonteLamb, D. A. "Specification of iterators". IEEE Transactions on Software Engineering 16, n.º 12 (1990): 1352–60. http://dx.doi.org/10.1109/32.62444.
Texto completo da fonteCastagna, Giuseppe, e Kim Nguyen. "Typed iterators for XML". ACM SIGPLAN Notices 43, n.º 9 (27 de setembro de 2008): 15–26. http://dx.doi.org/10.1145/1411203.1411210.
Texto completo da fonteMESSERSCHMIDT, H. J. "List Iterators in C++". Software: Practice and Experience 26, n.º 11 (novembro de 1996): 1197–203. http://dx.doi.org/10.1002/(sici)1097-024x(199611)26:11<1197::aid-spe55>3.0.co;2-l.
Texto completo da fonteHaack, Christian, e Clément Hurlin. "Resource Usage Protocols for Iterators." Journal of Object Technology 8, n.º 4 (2009): 55. http://dx.doi.org/10.5381/jot.2009.8.4.a3.
Texto completo da fonteCoyle, Christopher, e Peter Crogono. "Building abstract iterators using continuations". ACM SIGPLAN Notices 26, n.º 2 (2 de janeiro de 1991): 17–24. http://dx.doi.org/10.1145/122179.122181.
Texto completo da fonteRayside, Derek, Vajihollah Montaghami, Francesca Leung, Albert Yuen, Kevin Xu e Daniel Jackson. "Synthesizing iterators from abstraction functions". ACM SIGPLAN Notices 48, n.º 3 (10 de abril de 2013): 31–40. http://dx.doi.org/10.1145/2480361.2371407.
Texto completo da fonteZhang, Wei, Per Larsen, Stefan Brunthaler e Michael Franz. "Accelerating iterators in optimizing AST interpreters". ACM SIGPLAN Notices 49, n.º 10 (31 de dezembro de 2014): 727–43. http://dx.doi.org/10.1145/2714064.2660223.
Texto completo da fonteBergstra, Jan A., e Alban Ponse. "Non-regular iterators in process algebra". Theoretical Computer Science 269, n.º 1-2 (outubro de 2001): 203–29. http://dx.doi.org/10.1016/s0304-3975(00)00413-8.
Texto completo da fonteTeses / dissertações sobre o assunto "Iterators"
Shen, Jiasi. "RIFL : a language with filtered iterators". Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101587.
Texto completo da fonteCataloged from PDF version of thesis.
Includes bibliographical references (pages 143-146).
RIFL is a new programming language that enables developers to write only common-case code to robustly process structured inputs. RIFL eliminates the need to manually handle errors with a new control structure, filtered iterators. A filtered iterator treats inputs as collections of input units, iterates over the units, uses the program itself to filter out unanticipated units, and atomically updates program state for each unit. Filtered iterators can greatly simplify the development of robust programs. We formally define filtered iterators in RIFL. The semantics of filtered iterators ensure that each input unit affects program execution atomically. Our benchmarks show that using filtered iterators reduces an average of 41.7% lines of code, or 58.5% conditional clauses and 33.4% unconditional computation, from fully manual implementations.
by Jiasi Shen.
S.M.
Manilov, Stanislav Zapryanov. "Analysis and transformation of legacy code". Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/29612.
Texto completo da fonteDenis, Xavier. "Deductive verification of Rust programs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG101.
Texto completo da fonteRust is a programming language introduced in 2015, which provides the programmer with safety features regarding the use of memory. The goal of this thesis is the development of a deductive verification tool for the Rust language, by leveraging the specificities of its type system, in order to simplify memory aliasing management, among other things. Such a verification approach ensures the absence of errors during the execution of the considered programs, as well as their compliance with a formal specification of the expected functional behavior. The theoretical foundation of the approach proposed in this thesis is to use a notion of prophecy that interprets the mutable borrows in the Rust language as a current value and a future value of this borrow. The Coq proof assistant was used to formalize this prophetic encoding and prove the correctness of the associated proof obligation generation. Furthermore, the approach has been implemented in a verification software for Rust that automates the generation of proof obligations and relies on external solvers to validate these obligations. In order to support Rust iterators, an extension has been developed to manipulate closures, as well as a verification technique for iterators and combinators. The implementation has been experimentally evaluated on relevant algorithm and data structure examples. It has also been validated through a significant case study: the verification of a satisfiability modulo theories (SMT) solver
Galbraith, Steven Douglas. "Iterations of elliptic curves". Thesis, Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/28620.
Texto completo da fonteLodin, Viktor, e Magnus Olovsson. "Prestanda- och beteendeanalys av parallella köer med iterator". Thesis, Högskolan i Borås, Institutionen Handels- och IT-högskolan, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-17770.
Texto completo da fonteProgram: Systemarkitekturutbildningen
Shlapunov, Alexander. "On Iterations of double layer potentials". Universität Potsdam, 2000. http://opus.kobv.de/ubp/volltexte/2008/2568/.
Texto completo da fonteSchrader, U. "Convergence of Asynchronous Jacobi-Newton-Iterations". Universitätsbibliothek Chemnitz, 1998. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-199801324.
Texto completo da fonteTorshage, Axel. "Linear Functional Equations and Convergence of Iterates". Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-56450.
Texto completo da fonteMONTAGNAC, MARC. "Controle dynamique d'algorithmes iteratifs de resolution de systemes lineaires". Paris 6, 1999. http://www.theses.fr/1999PA066351.
Texto completo da fonteStumpo, Gordon. "Design Iterations Through Fusion of Additive and Subtractive Design". Kent State University / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=kent1461602511.
Texto completo da fonteLivros sobre o assunto "Iterators"
Iterature. Brooklyn: Ugly Duckling Presse, 2005.
Encontre o texto completo da fonteOstashevsky, Eugene. Iterature. [s.l.]: Ugly Duckling Presse, 2004.
Encontre o texto completo da fonteRobert, François. Discrete Iterations. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-61607-5.
Texto completo da fonteRobert, François. Discrete iterations: Ametric study. Berlin: Springer-Verlag, 1986.
Encontre o texto completo da fonteBabin, A. V. Iterations of differential operators. New York: Gordon and Breach Science Publishers, 1989.
Encontre o texto completo da fonteIterations of the diagonal. Toronto, ON: Shuffaloff, 1995.
Encontre o texto completo da fonteTimothy, Druckrey, Stainback Charles 1952- e International Center of Photography, eds. Iterations: The new image. New York City: International Center of Photography, 1993.
Encontre o texto completo da fonteLeader, Jeffery J. Boundedness and asymptotics of the Generalized Theodorus Iteration. Monterey, Calif: Naval Postgraduate School, 1993.
Encontre o texto completo da fonteScandrett, Clyde. Comparison of several iterative techniques in the solution of symmetric banded equations on a two-pipe Cyber 205. Monterey, Calif: Naval Postgraduate School, 1988.
Encontre o texto completo da fonteUnited States. National Aeronautics and Space Administration., ed. Spectrum transformation for divergent iterations. [Washington, DC]: National Aeronautics and Space Administration, 1991.
Encontre o texto completo da fonteCapítulos de livros sobre o assunto "Iterators"
Lischner, Ray. "Iterators". In Exploring C++ 11, 315–24. Berkeley, CA: Apress, 2013. http://dx.doi.org/10.1007/978-1-4302-6194-0_44.
Texto completo da fonteRobson, Robert. "Iterators". In Using the STL, 24–46. New York, NY: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4684-0531-6_2.
Texto completo da fonteSeamark, Philip, e Thomas Martens. "Iterators". In Pro DAX with Power BI, 119–44. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-4897-3_6.
Texto completo da fonteAspin, Adam. "Iterators". In Pro DAX and Data Modeling in Power BI, 275–303. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8995-2_12.
Texto completo da fonteRobson, Robert. "Iterators". In Using the STL, 29–62. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4612-1312-3_2.
Texto completo da fonteLischner, Ray. "Using Iterators". In Exploring C++20, 153–58. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_23.
Texto completo da fonteMilanesi, Carlo. "Using Iterators". In Beginning Rust, 197–221. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3468-6_16.
Texto completo da fontePilgrim, Mark. "Advanced Iterators". In Dive Into Python 3, 113–30. Berkeley, CA: Apress, 2009. http://dx.doi.org/10.1007/978-1-4302-2416-7_8.
Texto completo da fonteMilanesi, Carlo. "Using Iterators". In Beginning Rust, 217–42. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-7208-4_16.
Texto completo da fonteLischner, Ray. "More About Iterators". In Exploring C++20, 341–50. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_46.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Iterators"
Liu, Jed, Aaron Kimball e Andrew C. Myers. "Interruptible iterators". In Conference record of the 33rd ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1111037.1111063.
Texto completo da fonteFilliâtre, Jean-Christophe. "Backtracking iterators". In the 2006 workshop. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1159876.1159885.
Texto completo da fonteJoyner, M., B. L. Chamberlain e S. J. Deitz. "Iterators in Chapel". In Proceedings 20th IEEE International Parallel & Distributed Processing Symposium. IEEE, 2006. http://dx.doi.org/10.1109/ipdps.2006.1639499.
Texto completo da fonteCastagna, Giuseppe, e Kim Nguyen. "Typed iterators for XML". In Proceeding of the 13th ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1411204.1411210.
Texto completo da fonteRayside, Derek, Vajihollah Montaghami, Francesca Leung, Albert Yuen, Kevin Xu e Daniel Jackson. "Synthesizing iterators from abstraction functions". In the 11th International Conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2371401.2371407.
Texto completo da fonteShen, Jiasi, e Martin Rinard. "Robust programs with filtered iterators". In SPLASH '17: Conference on Systems, Programming, Languages, and Applications: Software for Humanity. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3136014.3136030.
Texto completo da fonteLangr, Daniel, Ivan Šimeček e Tomáš Dytrych. "Block Iterators for Sparse Matrices". In 2016 Federated Conference on Computer Science and Information Systems. IEEE, 2016. http://dx.doi.org/10.15439/2016f35.
Texto completo da fonteZhang, Wei, Per Larsen, Stefan Brunthaler e Michael Franz. "Accelerating iterators in optimizing AST interpreters". In SPLASH '14: Conference on Systems, Programming, and Applications: Software for Humanity. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2660193.2660223.
Texto completo da fonteKrishnaswami, Neelakantan R. "Reasoning about iterators with separation logic". In the 2006 conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1181195.1181213.
Texto completo da fonteBrock, Benjamin, Scott McMillan, Aydin Buluc, Timothy G. Mattson e Jose E. Moreira. "GraphBLAS: C++ Iterators for Sparse Matrices". In 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2022. http://dx.doi.org/10.1109/ipdpsw55747.2022.00053.
Texto completo da fonteRelatórios de organizações sobre o assunto "Iterators"
Hahn, Kim, e Ja Young Hwang. Helical Iterations. Ames: Iowa State University, Digital Repository, setembro de 2016. http://dx.doi.org/10.31274/itaa_proceedings-180814-1601.
Texto completo da fonteMarchesini, Stefano. Phase retrieval by power iterations. Office of Scientific and Technical Information (OSTI), outubro de 2012. http://dx.doi.org/10.2172/1172721.
Texto completo da fonteYao, Jen-Chih. Fixed points by Ishikawa iterations. Office of Scientific and Technical Information (OSTI), dezembro de 1989. http://dx.doi.org/10.2172/5213436.
Texto completo da fonteWalker, Homer F. Anderson Acceleration for Fixed-Point Iterations. Office of Scientific and Technical Information (OSTI), agosto de 2015. http://dx.doi.org/10.2172/1240289.
Texto completo da fonteYounes, W., e D. Gogny. FRANCHFRI: the Finite-RANge Constrained Hartree-Fock Rapid Iterator. Office of Scientific and Technical Information (OSTI), janeiro de 2007. http://dx.doi.org/10.2172/902336.
Texto completo da fonteRaftery, Adrian E., e Steven Lewis. How Many Iterations in the Gibbs Sampler? Fort Belvoir, VA: Defense Technical Information Center, setembro de 1991. http://dx.doi.org/10.21236/ada640705.
Texto completo da fonteLeader, Jeffery J. Power Iterations and the Dominant Eigenvalue Problem. Fort Belvoir, VA: Defense Technical Information Center, dezembro de 1992. http://dx.doi.org/10.21236/ada261695.
Texto completo da fonteElman, Howard, e David Silvester. Fast Nonsymmetric Iterations and Preconditioning for Navier-Stokes Equations. Fort Belvoir, VA: Defense Technical Information Center, junho de 1994. http://dx.doi.org/10.21236/ada599710.
Texto completo da fonteSezer, Sefa A., e Ibrahim Çanak. Tauberian Remainder Theorems for Iterations of Methods of Weighted Means. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, fevereiro de 2019. http://dx.doi.org/10.7546/crabs.2019.01.01.
Texto completo da fonteYao, Jen-Chih. On mean value iterations with application to variational inequality problems. Office of Scientific and Technical Information (OSTI), dezembro de 1989. http://dx.doi.org/10.2172/5173143.
Texto completo da fonte