Journal articles: 'Programs with pointers'

1

Møller, Anders. "Verifying Programs that Manipulate Pointers." Electronic Notes in Theoretical Computer Science 98 (August 2004): 3–4. http://dx.doi.org/10.1016/j.entcs.2003.10.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Amme, Wolfram, and Eberhard Zehendner. "Data dependence analysis in programs with pointers." Parallel Computing 24, no. 3-4 (May 1998): 505–25. http://dx.doi.org/10.1016/s0167-8191(98)00023-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Eisenbarth, Thomas, Rainer Koschke, and Gunther Vogel. "Static object trace extraction for programs with pointers." Journal of Systems and Software 77, no. 3 (September 2005): 263–84. http://dx.doi.org/10.1016/j.jss.2004.04.028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Milanova, Ana, Atanas Rountev, and Barbara G. Ryder. "Precise Call Graphs for C Programs with Function Pointers." Automated Software Engineering 11, no. 1 (January 2004): 7–26. http://dx.doi.org/10.1023/b:ause.0000008666.56394.a1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Shelekhov, V. I. "Applying Program Transformations for Deductive Verification of the List Reverse Program." Programmnaya Ingeneria 12, no. 3 (May 19, 2021): 127–39. http://dx.doi.org/10.17587/prin.12.127-139.

Full text

Abstract:

The program transformation methods to simplify the deductive verification of programs with recursive data types are investigated. The list reversion program is considered as an example. A source program in the C language is translated to the cP functional language which includes no pointers. The resulting program is translated further to the WhyML language to perform deductive verification of the program. The cP language includes the same constructs of the C language except pointers. In the C program, all actions that include pointers are replaced by the equivalent fragments without pointers. These replacement are performed by the special transformations using the results of the program dataflow analysis. Three variants of deductive verification of the transformed list reverse program in the Why3 verification platform with SMT solvers (Z3 4.8.6, CVC3 2.4.1, CVC4 1.7) are performed. First, the recursive WhyML program supplied with specifications was automatically verified successfully using only SMT solvers. Second, the recursive program was translated to the P predicate language. Correctness formulae were constructed for the P program and translated further to the why3 specification language. The formulae proving correctness were easy like the first variant. But correctness formulae for the first and second variants were different. Third, the "imperative" WhyML program that included while loop with additional invariant specifications was verified. The proving was easy but not automatic. So, for deductive verification, recursive program variant appears to be more preferable against imperative program variant.

APA, Harvard, Vancouver, ISO, and other styles

6

Halpern, Leslie F. "Some Pointers for Students Interested in Applying to Graduate Programs in Clinical Psychology." Eye on Psi Chi Magazine 6, no. 2 (2002): 21–23. http://dx.doi.org/10.24839/1092-0803.eye6.2.21.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chung, In-Sang. "Automated Test Data Generation for Testing Programs with Multi-level Stack-directed Pointers." KIPS Transactions:PartD 17D, no. 4 (August 31, 2010): 297–310. http://dx.doi.org/10.3745/kipstd.2010.17d.4.297.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Livshits, V. Benjamin, and Monica S. Lam. "Tracking pointers with path and context sensitivity for bug detection in C programs." ACM SIGSOFT Software Engineering Notes 28, no. 5 (September 2003): 317–26. http://dx.doi.org/10.1145/949952.940114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Watanabe, Yasunari, Kiran Gopinathan, George Pîrlea, Nadia Polikarpova, and Ilya Sergey. "Certifying the synthesis of heap-manipulating programs." Proceedings of the ACM on Programming Languages 5, ICFP (August 22, 2021): 1–29. http://dx.doi.org/10.1145/3473589.

Full text

Abstract:

Automated deductive program synthesis promises to generate executable programs from concise specifications, along with proofs of correctness that can be independently verified using third-party tools. However, an attempt to exercise this promise using existing proof-certification frameworks reveals significant discrepancies in how proof derivations are structured for two different purposes: program synthesis and program verification. These discrepancies make it difficult to use certified verifiers to validate synthesis results, forcing one to write an ad-hoc translation procedure from synthesis proofs to correctness proofs for each verification backend. In this work, we address this challenge in the context of the synthesis and verification of heap-manipulating programs. We present a technique for principled translation of deductive synthesis derivations (a.k.a. source proofs) into deductive target proofs about the synthesised programs in the logics of interactive program verifiers. We showcase our technique by implementing three different certifiers for programs generated via SuSLik, a Separation Logic-based tool for automated synthesis of programs with pointers, in foundational verification frameworks embedded in Coq: Hoare Type Theory (HTT), Iris, and Verified Software Toolchain (VST), producing concise and efficient machine-checkable proofs for characteristic synthesis benchmarks.

APA, Harvard, Vancouver, ISO, and other styles

10

Atto, Muhsin H. "Graph Inclusion and Matching Algorithms for Programs Manipulating Singly linked Heaps." Science Journal of University of Zakho 9, no. 1 (March 30, 2021): 30–37. http://dx.doi.org/10.25271/sjuoz.2021.9.1.778.

Full text

Abstract:

Programs that manipulate heaps such as singlylinked lists, doublylinked lists, skiplists, and treesare ubiquitous, and hence ensuring their correctness is of utmost importance. Analysing correctness properties for such programs is not trivial since they induce dynamic data structures, leading to unbounded state spaces with intricate patterns. One approach that has been adopted to tackle this problem is the use of symbolic searching techniques. The state space is encoded using graphs where the nodes represent memory cells, and the edges represent pointers between the cells. It is necessary to prune the search to avoid generating massive numbers of graphs, thus making the procedure unpractical. Pruning strategies are defined based on operations such as graph matching and inclusion. In this paper, a set of algorithms for performing these operations are presented. It is demonstrated that the proposed algorithms can handle typical graphs that arise in the verification of heap manipulating programs.

APA, Harvard, Vancouver, ISO, and other styles

11

Curseen, Kimberly, William Smucker, Jessica Kalender-Rich, Betty Lim, Paula Sanders, and Cari Levy. "Palliative Care in Long-Term Care Update: Practical Pointers, Policies, Programs, and Regulatory Pitfalls (P13)." Journal of Pain and Symptom Management 49, no. 2 (February 2015): 323. http://dx.doi.org/10.1016/j.jpainsymman.2014.11.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Raheem, Mazin Ismael. "Evaluation of Environmentally Urban Content Depending on Digital Medium." Association of Arab Universities Journal of Engineering Sciences 26, no. 3 (August 31, 2019): 136–44. http://dx.doi.org/10.33261/jaaru.2019.26.3.015.

Full text

Abstract:

This research suggest a technique for evaluating the urban content environmentally depending on digital media, throughout identifying the creative analytic techniques that develops the simple urban raster which is known as Digital Elevation Models( DEMs)Additionally , we prepare a group of systems that adopt 3D representation through simple drawing instruments, display environment and 3D spacial analysis.They are supporting programs for the concept of 3D representation and analysis, not the building specially in large scales. Now the research problem emerged, represented by: obviously deficient acknowledgment, in practical and academic media, in using digital medium that help to predict and evaluate, environmentally; the urban content. So, this research aims at: delineating some urban form linked environmental pointers through simple aids use (groups of scripts) that predicts the environmentally evaluated, the urban content: through designing process. This research depends in its academic and practical frames on the concept that it acts by developing effective strategic materials for analyzing and delineation the urban form and measuring the environmental pointers reaching to conclusion and recommendations.

APA, Harvard, Vancouver, ISO, and other styles

13

ALVIANO, MARIO, and RAFAEL PEÑALOZA. "Fuzzy answer sets approximations." Theory and Practice of Logic Programming 13, no. 4-5 (July 2013): 753–67. http://dx.doi.org/10.1017/s1471068413000471.

Full text

Abstract:

AbstractFuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answer sets are between these bounds. This paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. The operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answer sets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool.

APA, Harvard, Vancouver, ISO, and other styles

14

Bittman, Daniel, Peter Alvaro, Pankaj Mehra, Darrell D. E. Long, and Ethan L. Miller. "Twizzler: A Data-centric OS for Non-volatile Memory." ACM Transactions on Storage 17, no. 2 (June 7, 2021): 1–31. http://dx.doi.org/10.1145/3454129.

Full text

Abstract:

Byte-addressable, non-volatile memory (NVM) presents an opportunity to rethink the entire system stack. We present Twizzler, an operating system redesign for this near-future. Twizzler removes the kernel from the I/O path, provides programs with memory-style access to persistent data using small (64 bit), object-relative cross-object pointers, and enables simple and efficient long-term sharing of data both between applications and between runs of an application. Twizzler provides a clean-slate programming model for persistent data, realizing the vision of Unix in a world of persistent RAM. We show that Twizzler is simpler, more extensible, and more secure than existing I/O models and implementations by building software for Twizzler and evaluating it on NVM DIMMs. Most persistent pointer operations in Twizzler impose less than 0.5 ns added latency. Twizzler operations are up to faster than Unix , and SQLite queries are up to faster than on PMDK. YCSB workloads ran 1.1– faster on Twizzler than on native and NVM-optimized SQLite backends.

APA, Harvard, Vancouver, ISO, and other styles

15

Plunkett, Kim. "Computational Tools for Analysing Talk." Nordic Journal of Linguistics 13, no. 2 (December 1990): 187–99. http://dx.doi.org/10.1017/s0332586500002262.

Full text

Abstract:

The Child Language Data Exchange System — CHILDES — is the largest child language archive in the world. The archive includes a wide range of languages covering both normal and abnormal populations. The database is freely accessible to the research community and the user is supported with guidelines for carrying out transcription work and software packages for the automatic analysis of transcriptions. The article provides a brief overview of the CHAT transcription notation and the CLAN programs that can be used to analyse transcripts written in CHAT format. Current drawbacks of the CHILDES system are discussed and some pointers to future developments higlighted.

APA, Harvard, Vancouver, ISO, and other styles

16

Haux, R., J. Frank, and P. Knaup. "The IMIA WGI Database on Health and Medical Informatics Programs and Courses: A Call for Participation." Methods of Information in Medicine 36, no. 03 (July 1997): 233–34. http://dx.doi.org/10.1055/s-0038-1636844.

Full text

Abstract:

Working Group 1 on health and medical informatics education of the International Medical Informatics Association (IMIA) has established a WWW site (http://ix.urz.uni-heidelberg.de/ ~ d16) to provide up-to-date information about its work. The core of the site is an underlying database providing information on health and medical informatics (HMI) programs and courses worldwide. To be able to have a database of high quality and value we encourage all teachers and institutions to submit information about courses and programs on HMI education offered and to set pointers to their own WWW sites. In addition, a mailing list was installed to facilitate communication between all persons interested in HMI education. For subscription a message has to be sent to “listserv@listserv.net”. The body of the message should read “SUBSCRIBE IMIA-WG1”. Messages to the IMIAWG1 list have to be sent to “imia-wg1@urzinfo.urz.uni-heidelberg.de”.

APA, Harvard, Vancouver, ISO, and other styles

17

Ghareb, Mazen Ismaeel, and Garry Allen. "An empirical evaluation of metrics on aspect-oriented programs." UHD Journal of Science and Technology 3, no. 2 (October 23, 2019): 74. http://dx.doi.org/10.21928/uhdjst.v3n2y2019.pp74-86.

Full text

Abstract:

The quality evaluation of software metrics measurement is considered as the primary indicator of imperfection prediction and software maintenance in various empirical studies of software products. However, there is no agreement on which metrics are compelling quality pointers for new software development approaches such as aspect-oriented programming (AOP) techniques. AOP intends to enhance programming quality by providing fundamentally different parts of the systems, for example, pointcuts, advice, and intertype relationships. Hence, it is not evident if quality characteristics for AOP could be extracted from direct expansions of traditional object-oriented programming (OOP) measurements. Then again, investigations of AOP do regularly depend on established static and dynamic metrics measurement; notwithstanding the late research of AOP in empirical studies, few analyses been adopted using the International Organization for Standardization 9126 quality model as useful markers of flaw inclination in this context. This paper examination we have considered different programming quality models given by various authors every once in a while and distinguished that adaptability was deficient in the current model. We have testing 10 projects developed by AOP. We have used many applications to extract the metrics, but none of them could extract all AOP Metrics. It only can measure some of AOP Metrics, not all of them. This study investigates the suitable framework for extract AOP Metrics, for instance, static and dynamic metrics measurement for hybrid application systems (AOP and OOP) or only AOP application.

APA, Harvard, Vancouver, ISO, and other styles

18

Yassine, Alaeeddine, Driss Chenouni, Mohammed Berrada, and Ahmed Tahiri. "A Serious Game for Learning C Programming Language Concepts Using Solo Taxonomy." International Journal of Emerging Technologies in Learning (iJET) 12, no. 03 (March 27, 2017): 110. http://dx.doi.org/10.3991/ijet.v12i03.6476.

Full text

Abstract:

This paper conducts a study to identify pedagogical approaches and gameplay techniques involved in the development of serious games for teaching scientific courses in general especially programming languages. The concept of serious games is increasingly popular and is considered as an innovative teaching practice since it is based on information and communication technology and gamification to foster learning. To this end, a serious game "Perobo" will be introduced and discussed. It is based on a set of gameplay techniques and pedagogical approaches used for teaching pointers, considered as a difficult concept in C programming language, and essential for programming complex and advanced programs. The game is also based on a taxonomy design to define the learning levels.

APA, Harvard, Vancouver, ISO, and other styles

19

Jones, Neil D., and Jakob Grue Simonsen. "Programs=data=first-class citizens in a computational world." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, no. 1971 (July 28, 2012): 3305–18. http://dx.doi.org/10.1098/rsta.2011.0328.

Full text

Abstract:

From a programming perspective, Alan Turing's epochal 1936 paper on computable functions introduced several new concepts, including what is today known as self-interpreters and programs as data , and invented a great many now-common programming techniques. We begin by reviewing Turing's contribution from a programming perspective; and then systematize and mention some of the many ways that later developments in models of computation (MOCs) have interacted with computability theory and programming language research. Next, we describe the ‘blob’ MOC: a recent stored-program computational model without pointers . In the blob model, programs are truly first-class citizens , capable of being automatically compiled, or interpreted, or executed directly. Further, the blob model appears closer to being physically realizable than earlier computation models. In part, this is due to strong finiteness owing to early binding in the program; and a strong adjacency property : the active instruction is always adjacent to the piece of data on which it operates. The model is Turing complete in a strong sense: a universal interpretation algorithm exists that is able to run any program in a natural way and without arcane data encodings. Next, some of the best known among the numerous existing MOCs are described, and we develop a list of traits an ‘ideal’ MOC should possess from our perspective. We make no attempt to consider all models put forth since Turing's 1936 paper, and the selection of models covered concerns only models with discrete, atomic computation steps. The next step is to classify the selected models by qualitative rather than quantitative features. Finally, we describe how the blob model differs from an ‘ideal’ MOC, and identify some natural next steps to achieve such a model.

APA, Harvard, Vancouver, ISO, and other styles

20

Demri, Stéphane, Etienne Lozes, and Alessio Mansutti. "The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic." ACM Transactions on Computational Logic 22, no. 2 (June 21, 2021): 1–56. http://dx.doi.org/10.1145/3448269.

Full text

Abstract:

The list segment predicate ls used in separation logic for verifying programs with pointers is well suited to express properties on singly-linked lists. We study the effects of adding ls to the full quantifier-free separation logic with the separating conjunction and implication, which is motivated by the recent design of new fragments in which all these ingredients are used indifferently and verification tools start to handle the magic wand connective. This is a very natural extension that has not been studied so far. We show that the restriction without the separating implication can be solved in polynomial space by using an appropriate abstraction for memory states, whereas the full extension is shown undecidable by reduction from first-order separation logic. Many variants of the logic and fragments are also investigated from the computational point of view when ls is added, providing numerous results about adding reachability predicates to quantifier-free separation logic.

APA, Harvard, Vancouver, ISO, and other styles

21

Mehrotra, Seema, Satish Kumar C. R., Aditi Gandotra, Paulomi M. Sudhir, Jagadisha Thirthalli, and Girish N. Rao. "Why urban Indians are interested in an internet based self-care app for depression? a brief pilot survey." International Journal Of Community Medicine And Public Health 4, no. 6 (May 22, 2017): 2197. http://dx.doi.org/10.18203/2394-6040.ijcmph20172059.

Full text

Abstract:

Background: Digital technology has emerged as a powerful approach to bridge treatment gap in the field of mental health. However, public health impact of e-interventions is unlikely without large scale uptake of such services. Hence it becomes important to understand motives of potential users in order to design programs that address such needs as well as disseminate information about the same in ways that appeal to the users. Methods: Reasons underlying interest in an internet based self-care program for depression were explored through a brief survey of potential users who had explicitly shown interest in such a program. Responses to an online survey were received from 120 respondents out of which about 69% were in 18-35 years of age-range and 12% were above 50 years of age. Results: Preference for flexibility in terms of ‘when I do things to help myself’, ‘not having time to go for face to face counselling/therapy’ and ‘wanting to learn and do something to prevent problems in future even though I am currently on treatment’ emerged as the top 3 reasons underlying interest in internet based self-help programs for depression. Not having the finances to seek face to face mental health consultation emerged as one of the top 3 reasons in the older group. Conclusions: Incorporating maximal flexibility, providing pointers to the most relevant components thereby minimizing time required, and focusing on preventive strategies (even for those who are currently seeking treatment) are aspects that need to be considered in development and dissemination of internet based self-help programs for depression in urban India.

APA, Harvard, Vancouver, ISO, and other styles

22

Kataev, Nikita Andreevich, Alexander Andreevich Smirnov, and Andrey Dmitrievich Zhukov. "Investigation of Data Dependencies by Dynamic Analysis of Sapfor." Russian Digital Libraries Journal 23, no. 3 (May 9, 2020): 473–93. http://dx.doi.org/10.26907/1562-5419-2020-23-3-473-493.

Full text

Abstract:

The use of pointers and indirect memory accesses in the program, as well as the complex control flow are some of the main weaknesses of the static analysis of programs. The program properties investigated by this analysis are too conservative to accurately describe program behavior and hence they prevent parallel execution of the program. The application of dynamic analysis allows us to expand the capabilities of semi-automatic parallelization. In the SAPFOR system (System FOR Automated Parallelization), a dynamic analysis tool has been implemented, based on on the instrumentation of the LLVM representation of an analyzed program, which allows the system to explore programs in both C and Fortran programming languages. The capabilities of the static analysis implemented in SAPFOR are used to reduce the overhead program execution, while maintaining the completeness of the analysis. The use of static analysis allows to reduce the number of analyzed memory accesses and to ignore scalar variables, which can be explored in a static way. The developed tool was tested on performance tests from the NAS Parallel Benchmarks package for C and Fortran languages. The implementation of dynamic analysis, in addition to traditional types of data dependencies (flow, anit, output), allows us to determine privitizable variables and a possibility of pipeline execution of loops. Together with the capabilities of DVM and OpenMP these greatly facilitates program parallelization and simplify insertion of the appropriate compiler directives.

APA, Harvard, Vancouver, ISO, and other styles

23

Pearce, David J. "A Lightweight Formalism for Reference Lifetimes and Borrowing in Rust." ACM Transactions on Programming Languages and Systems 43, no. 1 (April 2021): 1–73. http://dx.doi.org/10.1145/3443420.

Full text

Abstract:

Rust is a relatively new programming language that has gained significant traction since its v1.0 release in 2015. Rust aims to be a systems language that competes with C/C++. A claimed advantage of Rust is a strong focus on memory safety without garbage collection. This is primarily achieved through two concepts, namely, reference lifetimes and borrowing . Both of these are well-known ideas stemming from the literature on region-based memory management and linearity / uniqueness . Rust brings both of these ideas together to form a coherent programming model. Furthermore, Rust has a strong focus on stack-allocated data and, like C/C++ but unlike Java, permits references to local variables. Type checking in Rust can be viewed as a two-phase process: First, a traditional type checker operates in a flow-insensitive fashion; second, a borrow checker enforces an ownership invariant using a flow-sensitive analysis. In this article, we present a lightweight formalism that captures these two phases using a flow-sensitive type system that enforces “ type and borrow safety .” In particular, programs that are type and borrow safe will not attempt to dereference dangling pointers. Our calculus core captures many aspects of Rust, including copy- and move-semantics, mutable borrowing, reborrowing, partial moves, and lifetimes. In particular, it remains sufficiently lightweight to be easily digested and understood and, we argue, still captures the salient aspects of reference lifetimes and borrowing. Furthermore, extensions to the core can easily add more complex features (e.g., control-flow, tuples, method invocation). We provide a soundness proof to verify our key claims of the calculus. We also provide a reference implementation in Java with which we have model checked our calculus using over 500B input programs. We have also fuzz tested the Rust compiler using our calculus against 2B programs and, to date, found one confirmed compiler bug and several other possible issues.

APA, Harvard, Vancouver, ISO, and other styles

24

Galmiche, Didier, and Daniel Méry. "Labelled cyclic proofs for separation logic." Journal of Logic and Computation 31, no. 3 (April 2021): 892–922. http://dx.doi.org/10.1093/logcom/exab017.

Full text

Abstract:

Abstract Separation logic (SL) is a logical formalism for reasoning about programs that use pointers to mutate data structures. It is successful for program verification as an assertion language to state properties about memory heaps using Hoare triples. Most of the proof systems and verification tools for ${\textrm{SL}}$ focus on the decidable but rather restricted symbolic heaps fragment. Moreover, recent proof systems that go beyond symbolic heaps are purely syntactic or labelled systems dedicated to some fragments of ${\textrm{SL}}$ and they mainly allow either the full set of connectives, or the definition of arbitrary inductive predicates, but not both. In this work, we present a labelled proof system, called ${\textrm{G}_{\textrm{SL}}}$, that allows both the definition of cyclic proofs with arbitrary inductive predicates and the full set of SL connectives. We prove its soundness and show that we can derive in ${\textrm{G}_{\textrm{SL}}}$ the built-in rules for data structures of another non-cyclic labelled proof system and also that ${\textrm{G}_{\textrm{SL}}}$ is strictly more powerful than that system.

APA, Harvard, Vancouver, ISO, and other styles

25

Chanza, Nelson, and Walter Musakwa. "“Trees Are Our Relatives”: Local Perceptions on Forestry Resources and Implications for Climate Change Mitigation." Sustainability 13, no. 11 (May 24, 2021): 5885. http://dx.doi.org/10.3390/su13115885.

Full text

Abstract:

The link between nature and society is vital for climate change mitigation and sustainable natural recourse management. Based on a case study of the indigenous people of Mbire in Zimbabwe, we argue that perceptions of indigenous people about forestry resources provide useful pointers toward framing climate mitigation interventions. This interest was necessitated by the growing call to address the suppression of forest-rich indigenous communities in climate change science. Accordingly, the aim of the study was to understand how indigenous people can contribute to the abatement of climate change. The study engaged 32 purposively selected elderly participants in focus group discussions; these participants had long histories of staying in the villages studied and were figures whom the locals regarded as “experts” in giving credible inferences about their environment. The participants corroboratively perceived forests and trees as their own “relatives”, who should not be harmed because of the support they continue to generously give to the people. Their construct of climate change relates to the gradual but continuing trivialization of cultural beliefs and abandonment of traditional practices, which they believe offend the spirits who have powers to influence the climate system. Although their attribution view on climate change is in contrast with that of mainstream climate scientists, we argue that their profound acknowledgement of climatic change, coupled with their scientific understanding of the intrinsic relationship between people’s wellbeing and the environment, are key entry points to design sustainable climate mitigation programs at community scales. The sustainability of such programs should not ignore local belief systems and strategies that communities use in preserving their forests.

APA, Harvard, Vancouver, ISO, and other styles

26

Burn, G. L. "Implementing the evaluation transformer model of reduction on parallel machines." Journal of Functional Programming 1, no. 3 (July 1991): 329–66. http://dx.doi.org/10.1017/s0956796800000137.

Full text

Abstract:

AbstractThe evaluation transformer model of reduction generalizes lazy evaluation in two ways: it can start the evaluation of expressions before their first use, and it can evaluate expressions further than weak head normal form. Moreover, the amount of evaluation required of an argument to a function may depend on the amount of evaluation required of the function application. It is a suitable candidate model for implementing lazy functional languages on parallel machines.In this paper we explore the implementation of lazy functional languages on parallel machines, both shared and distributed memory architectures, using the evaluation transformer model of reduction. We will see that the same code can be produced for both styles of architecture, and the definition of the instruction set is virtually the same for each style. The essential difference is that a distributed memory architecture has one extra node type for non-local pointers, and instructions which involve the value of such nodes need their definitions extended to cover this new type of node.To make our presentation accessible, we base our description on a variant of the well-known G-machine, an abstract machine for executing lazy functional programs.

APA, Harvard, Vancouver, ISO, and other styles

27

Shields, Denis C., Andrew Collins, and Angela Marlow. "Coding of pointers in the segregation analysis program POINTER." Genetic Epidemiology 11, no. 4 (1994): 385–87. http://dx.doi.org/10.1002/gepi.1370110408.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Vervarcke, Anne. "Simplifying Homeopathy." Homœopathic Links 31, no. 02 (June 2018): 097–102. http://dx.doi.org/10.1055/s-0038-1654679.

Full text

Abstract:

AbstractAfter the initial enthusiasm in the homeopathic community about the exciting progress and expansion since the 1980s, the sobering fact seems to be that we evolved in the direction of such sophistication that our dear system becomes unmanageable. We did our inner work, try to balance things that were somehow off but still the plain fact is that we are still crushed under too much information. And there is no way to stop it! We are only at the beginning of exploring and including every single species on the planet and beyond in our Materia Medica. But we've already come to a point where even the fastest and most extensive software programs won't help us solve a case. In this article, I argue that we need to boil down the overwhelming bulk of data to clear, simple and reliable pointers to large groups and then smaller groups. The best way to do this is adding the ‘context’ in the analysis. Though often overlooked it turns out to be solid information. The first distinction in a case analysis could be between the Second Dimension (Rocks and Stones, Gems, Bacteria, Viruses, Sarcodes) and the Third Dimension groups (Plants, Animal and Fungi) and often the context will decide. Some information on these groups is given, in an attempt to make homeopathy manageable again without losing its refinement.

APA, Harvard, Vancouver, ISO, and other styles

29

Shaughnessy, Erin E., Kimberly Ginsbach, Nicole Groeschl, Dawn Bragg, and Michael Weisgerber. "Brief Educational Intervention Improves Content of Intern Handovers." Journal of Graduate Medical Education 5, no. 1 (March 1, 2013): 150–53. http://dx.doi.org/10.4300/jgme-d-12-00139.1.

Full text

Abstract:

Abstract Background The Accreditation Council for Graduate Medical Education requires residency programs to ensure safe patient handovers and to document resident competency in handover communication, yet there are few evidence-based curricula teaching resident handover skills. Objective We assessed the immediate and sustained impact of a brief educational intervention on pediatrics intern handover skills. Methods Interns at a freestanding children's hospital participated in an intervention that included a 1-hour educational workshop on components of high-quality handovers, as well as implementation of a standardized handover format. The format, SAFETIPS, includes patient information, current diagnosis and assessment, patient acuity, a focused plan, a baseline exam, a to-do list, anticipatory guidance, and potential pointers and pitfalls. Important communication behaviors, such as paraphrasing key information, were addressed. Quality of intern handovers was evaluated using a simulated encounter 2 weeks before, 2 weeks after, and 7 months after the workshop. Two trained, blinded, independent observers scored the videotaped encounters. Results All 27 interns rotating at the Children's Hospital consented to participate in the study, and 20 attended the workshop. We included all participant data in the analysis, regardless of workshop attendance. Following the intervention, intern reporting of patient acuity improved from 13% to 92% (P < .001), and gains were maintained 7 months later. Rates of key communication behaviors, such as paraphrasing critical information, did not improve. Conclusions A brief educational workshop promoting standardized handovers improved the inclusion of essential information during intern handovers, and these improvements were sustained over time. The intervention did not improve key communication behaviors.

APA, Harvard, Vancouver, ISO, and other styles

30

van der Aalst, Wil. "Spreadsheets for business process management." Business Process Management Journal 24, no. 1 (February 2, 2018): 105–27. http://dx.doi.org/10.1108/bpmj-10-2016-0190.

Full text

Abstract:

Purpose Process mining provides a generic collection of techniques to turn event data into valuable insights, improvement ideas, predictions, and recommendations. This paper uses spreadsheets as a metaphor to introduce process mining as an essential tool for data scientists and business analysts. The purpose of this paper is to illustrate that process mining can do with events what spreadsheets can do with numbers. Design/methodology/approach The paper discusses the main concepts in both spreadsheets and process mining. Using a concrete data set as a running example, the different types of process mining are explained. Where spreadsheets work with numbers, process mining starts from event data with the aim to analyze processes. Findings Differences and commonalities between spreadsheets and process mining are described. Unlike process mining tools like ProM, spreadsheets programs cannot be used to discover processes, check compliance, analyze bottlenecks, animate event data, and provide operational process support. Pointers to existing process mining tools and their functionality are given. Practical implications Event logs and operational processes can be found everywhere and process mining techniques are not limited to specific application domains. Comparable to spreadsheet software widely used in finance, production, sales, education, and sports, process mining software can be used in a broad range of organizations. Originality/value The paper provides an original view on process mining by relating it to the spreadsheets. The value of spreadsheet-like technology tailored toward the analysis of behavior rather than numbers is illustrated by the over 20 commercial process mining tools available today and the growing adoption in a variety of application domains.

APA, Harvard, Vancouver, ISO, and other styles

31

Spieß, C. Katharina. "Zentren für Familien: Nationale und internationale Evidenz – ein Resümee aus familienökonomischer Perspektive." Sozialer Fortschritt 69, no. 8-9 (August 1, 2020): 545–60. http://dx.doi.org/10.3790/sfo.69.8-9.545.

Full text

Abstract:

Zusammenfassung Während Kindertageseinrichtungen primär auf Kinder ausgerichtet sind, haben Zentren für Familien die gesamte Familie im Blick. Im Idealfall bilden sie einen Knotenpunkt in einem nachbarschaftlich orientierten Netzwerk. In den letzten Jahren haben entsprechende Ansätze deutschlandweit an Bedeutung gewonnen. Welche empirische Evidenz gibt es für ihre Wirkungen auf Kinder, Eltern und Familien? Dieser Frage widmet sich dieser Beitrag, um der Politik Anhaltspunkte für eine Weiterentwicklung von Angeboten der Kinder- und Jugendhilfe in diese Richtung zu geben. Insbesondere auf der Basis empirischer Studien aus dem anglo-amerikanischen Raum können für Programme, welche Kinder und Eltern adressieren, tatsächlich kurz- bis langfristige Effekte auf Kinder und Eltern nachgewiesen werden. Deutsche Begleitstudien von Zentren für Familien fokussieren dagegen eher auf andere Aspekte der Implementation oder auch der Sozialraumentwicklung. Sie sollten um mehr Wirkungsstudien, welche sich mit den direkten Effekten auf die Entwicklung von Kindern und Familien befassen, ergänzt werden. Abstract: Centres For Families – National And International Evidence While day care centres for children are primarily geared towards children, centres for families focus on the whole family. Ideally, they form a hub in a neighbourhood-oriented network. In recent years, such approaches have gained in importance throughout Germany. What empirical evidence is there for their impact on children, parents and families? This article is dedicated to this question in order to provide policymakers with pointers for the further development of child and youth welfare services. Particularly on the basis of empirical studies from the Anglo-American countries, short to long-term effects on children and parents can be demonstrated when evaluating programs that address children and parents. German evaluation studies on the activities of centres for families tend to focus more on other aspects, such as implementation or social space development. They should be supplemented by studies that are related to the direct effects of these centres on the development of children and families.

APA, Harvard, Vancouver, ISO, and other styles

32

ABDULLA, PAROSH AZIZ, JONATHAN CEDERBERG, and TOMÁŠ VOJNAR. "MONOTONIC ABSTRACTION FOR PROGRAMS WITH MULTIPLY-LINKED STRUCTURES." International Journal of Foundations of Computer Science 24, no. 02 (February 2013): 187–210. http://dx.doi.org/10.1142/s0129054113400078.

Full text

Abstract:

We investigate the use of monotonic abstraction and backward reachability analysis as means of performing shape analysis on programs with multiply pointed structures. By encoding the heap as a vertex- and edge-labeled graph, we can model the low level behaviour exhibited by programs written in the C programming language. Using the notion of signatures, which are predicates that define sets of heaps, we can check properties such as absence of null pointer dereference and shape invariants. We report on the results from running a prototype based on the method on several programs such as insertion into and merging of doubly-linked lists.

APA, Harvard, Vancouver, ISO, and other styles

33

CHEN, Yi-Yun, Zhao-Peng LI, Zhi-Fang WANG, and Bao-Jian HUA. "Pointer Logic for Verification of Pointer Programs." Journal of Software 21, no. 3 (March 12, 2010): 415–26. http://dx.doi.org/10.3724/sp.j.1001.2010.03620.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Silva, Maria Ozanira da Silva e. "PANORAMA GERAL DOS PROGRAMAS DE TRANSFERÊNCIA DE RENDA NA AMÉRICA LATINA E CARIBE." Revista Políticas Públicas 18 (August 5, 2014): 299. http://dx.doi.org/10.18764/2178-2865.v18nep299-306.

Full text

Abstract:

O artigo, referenciado em estudo exploratório, tem como objetivo contextualizar e traçar um panorama geral dos Programas de Transferência de Renda (PTRC) em implementação na América Latina e Caribe. Desenvolvendo uma problematização geral sobre esses programas, procura-se indicar traços fundamentais, destacando contribuições e fragilidades estruturais para o alcance do objetivo central que é o enfrentamento da pobreza e da extrema pobreza. Abusca de informações foi centrada nos sites dos programas e em alguns documentos, permitindo destacar a importância desses programas no campo da proteção social não contributiva no âmbito das políticas sociais no Continente.Palavras-chave: Pobreza, Programas de Transferência de Renda, América Latina e Caribe.OVERVIEW OF INCOME TRANSFER PROGRAMS IN LATIN AMERICA AND CARIBBEANAbstract: The article, based on a survey, has as objective to contextualize and to draft a general view about the Conditioned Income Transfer Programs (PTRC) in implementation in Latin America and Caribbean. In order to develop a general problematization about those programs, it was pointed out its main traces, highlighting its structural contribution andweakness to meet the central objective that is to fight poverty and extreme poverty. The search of information was in the sites and some documents, allowing stand out the importance of those programs in the field of the non contributive social protection in the ambit of the social policies in the Continent.Keywords: Poverty, Income Transfer Programs, Latin America and Caribbean.

APA, Harvard, Vancouver, ISO, and other styles

35

Wang, Zhifang, Yiyun Chen, Zhenming Wang, and Baojian Hua. "Automated verification of pointer programs in pointer logic." Frontiers of Computer Science in China 2, no. 4 (November 5, 2008): 380–97. http://dx.doi.org/10.1007/s11704-008-0033-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Hofmann, Martin, and Ulrich Schöpp. "Pure pointer programs with iteration." ACM Transactions on Computational Logic 11, no. 4 (July 2010): 1–23. http://dx.doi.org/10.1145/1805950.1805956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Rugina, Radu, and Martin Rinard. "Pointer analysis for multithreaded programs." ACM SIGPLAN Notices 34, no. 5 (May 1999): 77–90. http://dx.doi.org/10.1145/301631.301645.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

CHEN, Yi-Yun, Bao-Jian HUA, Lin GE, and Zhi-Fang WANG. "A Pointer Logic for Safety Verification of Pointer Programs." Chinese Journal of Computers 31, no. 3 (September 28, 2009): 372–80. http://dx.doi.org/10.3724/sp.j.1016.2008.00372.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Baranyai, László, and Manuela Zude. "Analysis of laser light migration in apple tissue by Monte Carlo simulation." Progress in Agricultural Engineering Sciences 4, no. 1 (December 1, 2008): 45–59. http://dx.doi.org/10.1556/progress.4.2008.3.

Full text

Abstract:

The distribution of laser light in the tissue of Golden Delicious and Idared apples was measured with backscattering imaging and simulated with Monte Carlo (MC) method. The settings of the vision system (sensitivity and resolution) and the parameters of the laser modules (wavelength, power and beam diameter) were used in a time resolved MC model to optimize the computation. The 1 ns pulse containing 1.42 × 10 7 (at 670 nm) and 2.49 × 10 8 (at 785 nm) photons was selected for the simulation of backscattering on the fruit surface. The statistical effect of the scattering coefficient (µ s ), absorption coefficient (μ a ), and anisotropy factor ( g ) on photon flux and shape of the backscattering profile was evaluated within ±20 % range relative to expected mean values for apple tissue (µ a = 0.63 cm −1 , µ s = 30.0 cm −1 and g = 0.8). The multi-factor ANOVA test pointed out the highest importance (p<0.001) of the anisotropy factor compared to the scattering and absorption coefficients. Decreasing value of anisotropy factor enhanced the maximum intensity and increased the decline of the gradient resulting in a rotation of the intensity profiles. The measured backscattering profiles for Golden Delicious apples responded to bruising (p<0.05) already after one day storage.

APA, Harvard, Vancouver, ISO, and other styles

40

Heinen, Jonathan, Christina Jansen, Joost-Pieter Katoen, and Thomas Noll. "Verifying pointer programs using graph grammars." Science of Computer Programming 97 (January 2015): 157–62. http://dx.doi.org/10.1016/j.scico.2013.11.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Rugina, Radu, and Martin C. Rinard. "Pointer analysis for structured parallel programs." ACM Transactions on Programming Languages and Systems 25, no. 1 (January 2003): 70–116. http://dx.doi.org/10.1145/596980.596982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Zhang, Sean, Barbara G. Ryder, and William Landi. "Program decomposition for pointer aliasing." ACM SIGSOFT Software Engineering Notes 21, no. 6 (November 1996): 81–92. http://dx.doi.org/10.1145/250707.239112.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Salcianu, Alexandru, and Martin Rinard. "Pointer and escape analysis for multithreaded programs." ACM SIGPLAN Notices 36, no. 7 (July 2001): 12–23. http://dx.doi.org/10.1145/568014.379553.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Mehta, Farhad, and Tobias Nipkow. "Proving pointer programs in higher-order logic." Information and Computation 199, no. 1-2 (May 2005): 200–227. http://dx.doi.org/10.1016/j.ic.2004.10.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Hoenicke, Jochen, K. Rustan M. Leino, Andreas Podelski, Martin Schäf, and Thomas Wies. "Doomed program points." Formal Methods in System Design 37, no. 2-3 (November 24, 2010): 171–99. http://dx.doi.org/10.1007/s10703-010-0102-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Temnyalov, Emil. "Points mechanisms and rewards programs." Journal of Economics & Management Strategy 28, no. 3 (November 2, 2018): 436–57. http://dx.doi.org/10.1111/jems.12292.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Luo, Chenguang, Florin Craciun, Shengchao Qin, Guanhua He, and Wei-Ngan Chin. "Verifying pointer safety for programs with unknown calls." Journal of Symbolic Computation 45, no. 11 (November 2010): 1163–83. http://dx.doi.org/10.1016/j.jsc.2010.06.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Venet, A. "Automatic analysis of pointer aliasing for untyped programs." Science of Computer Programming 35, no. 2-3 (November 1999): 223–48. http://dx.doi.org/10.1016/s0167-6423(99)00012-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Whaley, John, and Martin Rinard. "Compositional pointer and escape analysis for Java programs." ACM SIGPLAN Notices 34, no. 10 (October 1999): 187–206. http://dx.doi.org/10.1145/320385.320400.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Yong, Suan Hsi, Susan Horwitz, and Thomas Reps. "Pointer analysis for programs with structures and casting." ACM SIGPLAN Notices 34, no. 5 (May 1999): 91–103. http://dx.doi.org/10.1145/301631.301647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Programs with pointers'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles