Filters








7,550 Hits in 4.2 sec

Widening Integer Arithmetic [chapter]

Kevin Redwine, Norman Ramsey
2004 Lecture Notes in Computer Science  
Acknowledgements This work has been funded in part by NSF grants CCR-0311482 and CCR-0096069.  ...  João Dias, Paul Govereau, Glenn Holloway, Reuben Olinsky, Sukyoung Ryu, and Chung-chieh Shan provided helpful comments on the paper.  ...  Widenability and fill types of integer and logical operators the mathematical facts we need to know to widen expressions involving that operator.  ... 
doi:10.1007/978-3-540-24723-4_16 fatcat:tqmnsnlrobdxhgyn7jlaugokya

How to Transform an Analyzer into a Verifier [chapter]

Marco Comini, Roberta Gori, Giorgio Levi
2001 Lecture Notes in Computer Science  
The verifier for functional programs is obtained from a static analyzer which implements one of the polymorphic type domains introduced by Cousot [8].  ...  We prove that the approach is general and flexible by showing three different verification tools based on different domains of types for functional, logic and CLP programming.  ...  Widening operators [12] give an upper approximation of the least fixpoint and guarantee termination by introducing further approximation. We apply the same widening operator after k iterations.  ... 
doi:10.1007/3-540-45653-8_41 fatcat:tpwahaktwnbltcmdaxvikg3qne

Predicting resource consumption of higher-order workflows

Markus Klinik, Jurriaan Hage, Jan Martin Jansen, Rinus Plasmeijer
2017 Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM 2017  
We present a type and effect system for the static analysis of programs written in a simplified version of iTasks. iTasks is a workflow specification language embedded in Clean, a generalpurpose functional  ...  The analysis has to deal with the domain-specific features of iTasks, in particular parallel and sequential composition of tasks, as well as the general-purpose features of Clean, in particular let-polymorphism  ...  This research is funded by the Royal Netherlands Navy and TNO.  ... 
doi:10.1145/3018882.3018885 fatcat:if7hmqfrrvcu7oij57s2rerpzu

A Polynomial-Cost Non-determinism Analysis [chapter]

Ricardo Pena, Clara Segura
2002 Lecture Notes in Computer Science  
The improvement in efficiency is obtained by speeding up the fixpoint calculation by means of a widening operator, and the representation of functions through easily comparable signatures.  ...  Also details about the implementation and its cost are given. ⋆  ...  In Proposition 4 Let W ′ t : D 2t → D 2t be a widening operator for each type t.  ... 
doi:10.1007/3-540-46028-4_8 fatcat:sddnluqslfc7vhzuvzoscshkq4

PRIMARY TUMOUR OF THE OPTIC NERVE (Glioblastoma Multiforme)

J. Saebo
1949 British Journal of Ophthalmology  
Conclusion: In the pathological examination of the thickened fasciculus opticus an expansively growing and polymorphic tumour is found, with numerous primitive cell-forms of gliomatous types, continuing  ...  If widening of the optic foramen, suggesting intra-cranial extension of the tumour, is found, or if it is evident that the tumour has been incompletely removed, an intra-cranial operation is advisable  ... 
doi:10.1136/bjo.33.11.701 pmid:15406720 pmcid:PMC510970 fatcat:xdq5jujhqnbs3jsi6lh2myvjy4

Widening the representation bottleneck

Dave Cattrall, Colin Runciman
1993 Proceedings of the conference on Functional programming languages and computer architecture - FPCA '93  
However a complex implementation, using a combination of polymorphic type inference and automatic program transformation to select appropriate representations, is needed to support this language.  ...  We describe a relational language, Drusilla, that retains the lazy, polymorphic and higher-order aspects of functional languages and the exible handling of non-determinism and search based computation  ...  Thanks also to the referrees and David Wakeling for comments on preliminary versions of this paper.  ... 
doi:10.1145/165180.165206 dblp:conf/fpca/CattrallR93 fatcat:bgwasa2nl5belbnu55zjnnzaay

Termination Analysis with Types Is More Accurate [chapter]

Vitaly Lagoon, Fred Mesnard, Peter J. Stuckey
2003 Lecture Notes in Computer Science  
In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination of (type correct) programs.  ...  We show that our typed termination analysis is uniformly more accurate than untyped termination analysis for regularly typed programs, and demonstrate how it is able to prove termination of programs which  ...  In practice the widening operation and the possible inaccuracy resulting from the handling of polymorphic calls do not seem to occur for real programs.  ... 
doi:10.1007/978-3-540-24599-5_18 fatcat:yc33hvf7zrhb7kzxuefjm227ry

Type Systems for Distributed Data Sharing [chapter]

Ben Liblit, Alex Aiken, Katherine Yelick
2003 Lecture Notes in Computer Science  
This paper develops a basis for understanding the design space of these sharing formalisms, and codifies that understanding in a suite of type checking/inference systems that illustrate the trade-offs  ...  Understanding a language's support for data sharing behavior is critical to understanding how the language can be used, and is also a component for numerous program analysis, optimization, and runtime  ...  In both cases, the code is clearly polymorphic with respect to sharing, and without a polymorphic type system significantly more data would be forced to be shared.  ... 
doi:10.1007/3-540-44898-5_15 fatcat:gj3v3dvw4bbyznfbasfwxouzcu

Wide Classes [chapter]

Manuel Serrano
1999 Lecture Notes in Computer Science  
This paper introduces the concepts of wide classes and widening as extensions to the object model of class-based languages such as Java and Smalltalk.  ...  Widening allows an object to be temporarily widened, that is transformed into an instance of a subclass, a wide class, and, later on, to be shrunk, that is reshaped to its original class.  ...  Acknowledgments Many thanks to Christian Queinnec, Jan Vitek and to Céline for their helpful feedbacks on this work.  ... 
doi:10.1007/3-540-48743-3_18 fatcat:kq4yfmorhfc2hpjc5oywdleh44

Extending sized type with collection analysis

Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
2003 Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation - PEPM '03  
We shall show how a mixed constraint system could support the enhanced size type, and highlight examples where collection analysis are useful.  ...  Many program optimizations and analyses, such as arraybounds checking, termination analysis, depend on knowing the size of a function's input and output.  ...  In order for the fix-point computation to converge, both hulling and widening operations may be required.  ... 
doi:10.1145/777388.777397 dblp:conf/pepm/ChinKX03 fatcat:jvgbngfdqng4lagykogxaarnra

Extending sized type with collection analysis

Wei-Ngan Chin, Siau-Cheng Khoo, Dana N. Xu
2003 SIGPLAN notices  
We shall show how a mixed constraint system could support the enhanced size type, and highlight examples where collection analysis are useful.  ...  Many program optimizations and analyses, such as arraybounds checking, termination analysis, depend on knowing the size of a function's input and output.  ...  In order for the fix-point computation to converge, both hulling and widening operations may be required.  ... 
doi:10.1145/966049.777397 fatcat:ejrfmcuepjalte2vrbbwjfh2ru

JavaScript AOT compilation

Manuel Serrano
2018 Proceedings of the 14th ACM SIGPLAN International Symposium on Dynamic Languages - DLS 2018  
are imposed by some devices and some operating systems.  ...  ., ahead-of-time (AOT) compilation, is an alternative approach to JIT compilation that can combine good speed and lightweight memory footprint, and that can accommodate read-only memory constraints that  ...  Widening and Stepping e range analysis relies on a widening operator to ensure its convergence in an acceptable compilation time.  ... 
doi:10.1145/3276945.3276950 dblp:conf/dls/Serrano18 fatcat:gkenbc4j5ng2zlqmg7hcnwpsxy

Efficient Implementation of Run-time Generic Types for Java [chapter]

Eric Allen, Robert Cartwright, Brian Stoler
2003 IFIP Advances in Information and Communication Technology  
The compiler relies on the implementation strategy proposed by Cartwright and Steele with one major exception: to support polymorphic recursion in the definition of generic classes, the compiler generates  ...  We describe an efficient compiler and run-time system for NextGen, a compatible extension of the Java programming language supporting run-time generic types designed by Cartwright and Steele.  ...  The prohibited operations include: ß parametric casts, ß parametric instanceof tests 1 , ß parametric catch operations, and ß new operations of "naked" parametric type such as new T( ) and new T[ ].  ... 
doi:10.1007/978-0-387-35672-3_11 fatcat:6pjorfo3ozd5pgvssyr4c4mypy

Efficient first-class generics on stock Java virtual machines

James Sasitorn, Robert Cartwright
2006 Proceedings of the 2006 ACM symposium on Applied computing - SAC '06  
support (parametric) type-dependent operations.  ...  The NextGen Generic Java compiler eliminates these pathologies by retaining parametric type information at runtime and customizing the code in generic classes and polymorphic methods where necessary to  ...  The unsupported operations include parametric casts, parametric instanceof operations, and new operations on "naked" parametric types, e.g., new T().  ... 
doi:10.1145/1141277.1141656 dblp:conf/sac/SasitornC06 fatcat:jpknuf2lpzgtfoyq2r46snrmim

Pizza into Java

Martin Odersky, Philip Wadler
1997 Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97  
Pizza is a strict superset of Java that incorporates three ideas from the academic community: parametric polymorphism, higher-order functions, and algebraic data types.  ...  Pizza is defined by translation into Java and compiles into the Java Virtual Machine, requirements which strongly constrain the design space.  ...  Acknowledgments We'd like to thank the anonymous referees for their thorough and helpful comments.  ... 
doi:10.1145/263699.263715 dblp:conf/popl/OderskyW97 fatcat:oblajhv3g5dqlouvh3ieb2sfjq
« Previous Showing results 1 — 15 out of 7,550 results