MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Jorge Navas" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 7 documents found, showing 1 through 7.
ATOM RSS
  • RESEARCH STATEMENT  
  • by Jorge Navas
  • …Static program analysis is the process of inferring information at compile-time on the runtime behavior of the program. Static program analysis has many important applications. It has traditionally been used primarily for optimizing programs so that they will run faster. More recently, program analy…
  • Add To MetaCart
  • User-definable resource bounds analysis for logic programs  
  • by Jorge Navas, Manuel V. Hermenegildo — 2007 — In ICLP’07
  • …Abstract. We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in general be functions of input data sizes. A resource in our approach is a quite general, user-defined notion which …
  • Cited by 5 (2 self) – Add To MetaCart
  • Efficient top-down set-sharing analysis using cliques  
  • by Jorge Navas, Francisco Bueno, Manuel Hermenegildo — 2006 — In Eight International Symposium on Practical Aspects of Declarative Languages, number 2819 in LNCS
  • …Abstract. We study the problem of efficient, scalable set-sharing analysis of logic programs. We use the idea of representing sharing information as a pair of abstract substitutions, one of which is a worst-case sharing representation called a clique set, which was previously proposed for the case o…
  • Cited by 2 (2 self) – Add To MetaCart
  • An Efficient, Parametric Fixpoint Algorithm for Analysis of Java Bytecode  
  • by Mario Méndez, Jorge Navas, Manuel V. Hermenegildo — 2007 — In ETAPS Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE’07), Electronic
  • …Abstract interpretation has been widely used for the analysis of object-oriented languages and, more precisely, Java source and bytecode. However, while most of the existing work deals with the problem of finding expressive abstract domains that track accurately the characteristics of a particular c…
  • Cited by 7 (4 self) – Add To MetaCart
  • A Flexible (C)LP-Based Approach to the Analysis of Object-Oriented Programs  
  • by Mario Méndez-lojo, Jorge Navas, Manuel V. Hermenegildo — 2007 — In 17th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR’07
  • …Abstract. Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of the work involving object-oriented languages and abstract interpretation usually omits the description of that …
  • Cited by 3 (3 self) – Add To MetaCart
  • Customizable Resource Usage Analysis for Java Bytecode  
  • by Jorge Navas, Mario Méndez-lojo, Manuel V. Hermenegildo — 2008
  • …Abstract. Automatic cost analysis of programs has been traditionally studied in terms of a number of concrete, predefined resources such as execution steps, time, or memory. However, the increasing relevance of analysis applications such as static debugging and/or certification of user-level propert…
  • Cited by 1 (1 self) – Add To MetaCart
  • Two Efficient Representations for Set-Sharing Analysis in Logic Programs  
  • by Eric Trias, Jorge Navas, Elena S. Ackley, Stephanie Forrest, Manuel V. Hermenegildo
  • …Set-Sharing analysis, the classic Jacobs and Langen’s domain, has been widely used to infer several interesting properties of programs at compile-time such as occurs-check reduction, automatic parallelization, finite-tree analysis, etc. However, performing abstract unification over this domain impli…
  • Add To MetaCart
Help! Showing 1 through 7.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB