Diego Garbervetsky
Diego Garbervetsky

homepage
diegogatdc.uba.ar

Professional ACM Member badge
  Affiliation history
Bibliometrics: publication history
Average citations per article3.54
Citation Count124
Publication count35
Publication years2002-2017
Available for download21
Average downloads per article110.43
Downloads (cumulative)2,319
Downloads (12 Months)270
Downloads (6 Weeks)35
SEARCH
ROLE
Arrow RightAuthor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


34 results found Export Results: bibtexendnoteacmrefcsv

Result 21 – 34 of 34
Result page: 1 2

Sort by:

21 published by ACM
May 2011 TOPI '11: Proceedings of the 1st Workshop on Developing Tools as Plug-ins
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 57

Full text available: PDFPDF
Automated software verification is an active field of research which has made enormous progress both in theoretical and practical aspects. In recent years, an important effort has been put into applying these techniques on top of mainstream programming languages. These languages typically provide powerful features such as reflection, aliasing and ...
Keywords: eclipse plug-in, verifiability, language design, teaching

22 published by ACM
May 2011 TOPI '11: Proceedings of the 1st Workshop on Developing Tools as Plug-ins
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 37

Full text available: PDFPDF
Code Contracts [2] is a tool that allows the specification and verification of contracts (pre, post-condition, invariants) in all .NET based programming languages. Resource Contracts is an extension of this language to specify resource usage in .NET programs. The new annotations, initially focussed on dynamic memory, enable modular analysis of ...
Keywords: resource usage annotations, static verification

23 published by ACM
May 2011 ICSE '11: Proceedings of the 33rd International Conference on Software Engineering
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 0,   Downloads (12 Months): 7,   Downloads (Overall): 241

Full text available: PDFPDF
Code artefacts that have non-trivial requirements with respect to the ordering in which their methods or procedures ought to be called are common and appear, for instance, in the form of API implementations and objects. This work addresses the problem of validating if API implementations provide their intended behaviour when ...
Keywords: source code validation, automated abstraction, behaviour model synthesis

24
March 2011 TACAS'11/ETAPS'11: Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

The theory of dynamic frames is a promising approach to handle the so-called framing problem, that is, giving a precise characterizations of the locations in the heap that a procedure may modify. In this paper, we show that the machinery used for dynamic frames may be exploited even further. In ...

25 published by ACM
September 2009 JTRES '09: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 108

Full text available: PDFPDF
The ScopedMemory class of the RTSJ enables the organization of objects into regions. This ensures time-predictable management of dynamic memory. Using scopes forces the programmer to reason in terms of locality , to comply with RTSJ restrictions. The programmer is also faced with the problem of providing upper-bounds for regions. ...

26
September 2009 FORMATS '09: Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

The common practice for verifying properties described as event occurrence patterns is to translate them into observer state machines. The resulting observer is then composed with (the components of) the system under analysis in order to verify a reachability property. Live Component Analysis is a "cone of influence" abstraction technique ...

27
August 2009 IEEE Transactions on Very Large Scale Integration (VLSI) Systems: Volume 17 Issue 8, August 2009
Publisher: IEEE Educational Activities Department
Bibliometrics:
Citation Count: 7

Memory requirement estimation is an important issue in the development of embedded systems, since memory directly influences performance, cost and power consumption. It is therefore crucial to have tools that automatically compute accurate estimates of the memory requirements of programs to better control the development process and avoid some catastrophic ...
Keywords: Bernstein expansion, memory requirement, program optimization, static program analysis, convex polytopes

28
May 2009 ICSE '09: Proceedings of the 31st International Conference on Software Engineering
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 228

Full text available: PDFPDF
Pre/post condition-based specifications are common-place in a variety of software engineering activities that range from requirements through to design and implementation. The fragmented nature of these specifications can hinder validation as it is difficult to understand if the specifications for the various operations fit together well. In this paper we ...

29 published by ACM
June 2008 ISMM '08: Proceedings of the 7th international symposium on Memory management
Publisher: ACM
Bibliometrics:
Citation Count: 31
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 238

Full text available: PDFPDF
This work presents a technique to compute symbolic polynomial approximations of the amount of dynamic memory required to safely execute a method without running out of memory, for Javalike imperative programs. We consider object allocations and deallocations made by the method and the methods it transitively calls. More precisely, given ...
Keywords: heap consumption, heap space analysis, java, memory regions

30 published by ACM
October 2006 eclipse '06: Proceedings of the 2006 OOPSLA workshop on eclipse technology eXchange
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 166

Full text available: PDFPDF
In this work we present an Eclipse plug-in for the VINTIME (Verifier of INtegrated TImed ModEls) suite of tools that combines high-level expressive power, unassisted property-preserving model reduction and distributed model checking to describe and verify complex real-time system designs and their properties.
Keywords: Eclipse plug-in, LAPSUS, VTS, ZEUS, verification, OBSSLICE, timed model checking, timed automata

31 published by ACM
October 2005 eclipse '05: Proceedings of the 2005 OOPSLA workshop on Eclipse technology eXchange
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 2,   Downloads (Overall): 129

Full text available: PDFPDF
We present JScoper, an Eclipse plug-in which will help developers, researchers and students, to generate, understand, and manipulate memory regions in scoped-memory management setting. The main goal of the plug-in is to provide a tool that will transparently assist the translation of Java applications into Real-time Specification for Java (RTSJ) ...
Keywords: memory management, Eclipse plug-in, real-time java

32
May 2005 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 131, May, 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 4

We present an algorithm for escape analysis inspired by, but more precise than, the one proposed by Gay and Steensgaard [D. Gay and B. Steensgaard. Fast escape analysis and stack allocation for object-based programs. In CC'00. Springer-Verlag, 2000]. The primary purpose of our algorithm is to produce useful information to ...
Keywords: Dynamic memory management, Escape analysis

33
January 2005 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 113 Issue C, January 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

We present a method to analyze, monitor and control dynamic memory allocation in Java. It first consists in performing pointer and escape analysis to detect memory scopes. This information is used to automatically instrument Java programs in such a way memory is allocated and freed by a region-based memory manager. ...
Keywords: Run-time analysis, Java, Real-time and embedded systems, Memory management

34
April 2002 TACAS '02: Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

The parallel composition with observers is a well-known approach to check or test properties over formal models of concurrent and real-time systems. We present a newtec hnique to reduce the size of the resulting model. Our approach has been developed for a formalism based on Timed Automata. Firstly, it discovers ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us