id
stringlengths 9
14
| submitter
stringlengths 1
64
⌀ | authors
stringlengths 4
9.62k
| title
stringlengths 4
343
| comments
stringlengths 1
609
⌀ | journal-ref
stringlengths 4
404
⌀ | doi
stringlengths 12
153
⌀ | report-no
stringlengths 2
254
⌀ | categories
stringlengths 5
112
| license
stringclasses 9
values | orig_abstract
stringlengths 14
3.76k
| versions
listlengths 1
60
| update_date
stringlengths 10
10
| authors_parsed
listlengths 1
535
| abstract
stringlengths 11
3.75k
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
cs/0703116
|
Roberto Bagnara
|
Roberto Bagnara, Patricia M. Hill, Andrea Pescetti, Enea Zaffanella
|
On the Design of Generic Static Analyzers for Modern Imperative
Languages
|
72 pages
| null | null | null |
cs.PL cs.LO
| null |
The design and implementation of precise static analyzers for significant
fragments of modern imperative languages like C, C++, Java and Python is a
challenging problem. In this paper, we consider a core imperative language that
has several features found in mainstream languages such as those including
recursive functions, run-time system and user-defined exceptions, and a
realistic data and memory model. For this language we provide a concrete
semantics --characterizing both finite and infinite computations-- and a
generic abstract semantics that we prove sound with respect to the concrete
one. We say the abstract semantics is generic since it is designed to be
completely parametric on the analysis domains: in particular, it provides
support for \emph{relational} domains (i.e., abstract domains that can capture
the relationships between different data objects). We also sketch how the
proposed methodology can be extended to accommodate a larger language that
includes pointers, compound data objects and non-structured control flow
mechanisms. The approach, which is based on structured, big-step
$\mathrm{G}^\infty\mathrm{SOS}$ operational semantics and on abstract
interpretation, is modular in that the overall static analyzer is naturally
partitioned into components with clearly identified responsibilities and
interfaces, something that greatly simplifies both the proof of correctness and
the implementation.
|
[
{
"created": "Fri, 23 Mar 2007 09:47:15 GMT",
"version": "v1"
},
{
"created": "Thu, 28 Jun 2007 10:56:42 GMT",
"version": "v2"
}
] |
2007-06-28
|
[
[
"Bagnara",
"Roberto",
""
],
[
"Hill",
"Patricia M.",
""
],
[
"Pescetti",
"Andrea",
""
],
[
"Zaffanella",
"Enea",
""
]
] |
The design and implementation of precise static analyzers for significant fragments of modern imperative languages like C, C++, Java and Python is a challenging problem. In this paper, we consider a core imperative language that has several features found in mainstream languages such as those including recursive functions, run-time system and user-defined exceptions, and a realistic data and memory model. For this language we provide a concrete semantics --characterizing both finite and infinite computations-- and a generic abstract semantics that we prove sound with respect to the concrete one. We say the abstract semantics is generic since it is designed to be completely parametric on the analysis domains: in particular, it provides support for \emph{relational} domains (i.e., abstract domains that can capture the relationships between different data objects). We also sketch how the proposed methodology can be extended to accommodate a larger language that includes pointers, compound data objects and non-structured control flow mechanisms. The approach, which is based on structured, big-step $\mathrm{G}^\infty\mathrm{SOS}$ operational semantics and on abstract interpretation, is modular in that the overall static analyzer is naturally partitioned into components with clearly identified responsibilities and interfaces, something that greatly simplifies both the proof of correctness and the implementation.
|
1311.3322
|
Thanh Do
|
Thanh Do and Haryadi S. Gunawi
|
Impact of Limpware on HDFS: A Probabilistic Estimation
|
9 pages, 6 figures, detailed probability calculation for SOCC 13
limplock paper
| null | null | null |
cs.OS cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
With the advent of cloud computing, thousands of machines are connected and
managed collectively. This era is confronted with a new challenge: performance
variability, primarily caused by large-scale management issues such as hardware
failures, software bugs, and configuration mistakes. In our previous work we
highlighted one overlooked cause: limpware - hardware whose performance
degrades significantly compared to its specification. We showed that limpware
can cause severe impact in current scale-out systems. In this report, we
quantify how often these scenarios happen in Hadoop Distributed File System.
|
[
{
"created": "Wed, 13 Nov 2013 22:05:58 GMT",
"version": "v1"
}
] |
2013-11-15
|
[
[
"Do",
"Thanh",
""
],
[
"Gunawi",
"Haryadi S.",
""
]
] |
With the advent of cloud computing, thousands of machines are connected and managed collectively. This era is confronted with a new challenge: performance variability, primarily caused by large-scale management issues such as hardware failures, software bugs, and configuration mistakes. In our previous work we highlighted one overlooked cause: limpware - hardware whose performance degrades significantly compared to its specification. We showed that limpware can cause severe impact in current scale-out systems. In this report, we quantify how often these scenarios happen in Hadoop Distributed File System.
|
2012.03766
|
Xiaowei Wu
|
Xiaowei Wu, Bo Li and Jiarui Gan
|
Budget-feasible Maximum Nash Social Welfare Allocation is Almost
Envy-free
|
16 pages, 2 figures
| null | null | null |
cs.GT cs.MA
|
http://creativecommons.org/licenses/by/4.0/
|
The Nash social welfare (NSW) is a well-known social welfare measurement that
balances individual utilities and the overall efficiency. In the context of
fair allocation of indivisible goods, it has been shown by Caragiannis et al.
(EC 2016 and TEAC 2019) that an allocation maximizing the NSW is envy-free up
to one good (EF1). In this paper, we are interested in the fairness of the NSW
in a budget-feasible allocation problem, in which each item has a cost that
will be incurred to the agent it is allocated to, and each agent has a budget
constraint on the total cost of items she receives. We show that a
budget-feasible allocation that maximizes the NSW achieves a 1/4-approximation
of EF1 and the approximation ratio is tight. The approximation ratio improves
gracefully when the items have small costs compared with the agents' budgets;
it converges to 1/2 when the budget-cost ratio approaches infinity.
|
[
{
"created": "Mon, 7 Dec 2020 15:07:40 GMT",
"version": "v1"
}
] |
2020-12-08
|
[
[
"Wu",
"Xiaowei",
""
],
[
"Li",
"Bo",
""
],
[
"Gan",
"Jiarui",
""
]
] |
The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016 and TEAC 2019) that an allocation maximizing the NSW is envy-free up to one good (EF1). In this paper, we are interested in the fairness of the NSW in a budget-feasible allocation problem, in which each item has a cost that will be incurred to the agent it is allocated to, and each agent has a budget constraint on the total cost of items she receives. We show that a budget-feasible allocation that maximizes the NSW achieves a 1/4-approximation of EF1 and the approximation ratio is tight. The approximation ratio improves gracefully when the items have small costs compared with the agents' budgets; it converges to 1/2 when the budget-cost ratio approaches infinity.
|
1803.04363
|
Jingyi Zheng
|
Jingyi Zheng, Fushing Hsieh
|
Information of Epileptic Mechanism and its Systemic Change-points in a
Zebrafish's Brain-wide Calcium Imaging Video Data
|
8 Pages, 11 figures
| null | null | null |
q-bio.NC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The epileptic mechanism is postulated as that an animal's neurons gradually
diminish their inhibition function coupled with enhanced excitation when an
epileptic event is approaching. Calcium imaging technique is designed to
directly record brain-wide neurons activity in order to discover the underlying
epileptic mechanism. In this paper, using one brain-wide calcium imaging video
of Zebrafish, we compute dynamic pattern information of the epileptic
mechanism, and devise three graphical displays to show the visible functional
aspect of epileptic mechanism over five inter-ictal periods. The foundation of
our data-driven computations for such dynamic patterns relies on one universal
phenomenon discovered across 696 informative pixels. This universality is that
each pixel's progressive 5-percentile process oscillates in an irregular
fashion at first, but, after the middle point of inter-ictal period, the
oscillation is replaced by a steady increasing trend. Such dynamic patterns are
collectively transformed into a visible systemic change-point as an early
warning signal (EWS) of an incoming epileptic event. We conclude through the
graphic displays that pattern information extracted from the calcium imaging
video realistically reveals the Zebrafish's authentic epileptic mechanism.
|
[
{
"created": "Wed, 14 Feb 2018 01:27:03 GMT",
"version": "v1"
}
] |
2018-03-13
|
[
[
"Zheng",
"Jingyi",
""
],
[
"Hsieh",
"Fushing",
""
]
] |
The epileptic mechanism is postulated as that an animal's neurons gradually diminish their inhibition function coupled with enhanced excitation when an epileptic event is approaching. Calcium imaging technique is designed to directly record brain-wide neurons activity in order to discover the underlying epileptic mechanism. In this paper, using one brain-wide calcium imaging video of Zebrafish, we compute dynamic pattern information of the epileptic mechanism, and devise three graphical displays to show the visible functional aspect of epileptic mechanism over five inter-ictal periods. The foundation of our data-driven computations for such dynamic patterns relies on one universal phenomenon discovered across 696 informative pixels. This universality is that each pixel's progressive 5-percentile process oscillates in an irregular fashion at first, but, after the middle point of inter-ictal period, the oscillation is replaced by a steady increasing trend. Such dynamic patterns are collectively transformed into a visible systemic change-point as an early warning signal (EWS) of an incoming epileptic event. We conclude through the graphic displays that pattern information extracted from the calcium imaging video realistically reveals the Zebrafish's authentic epileptic mechanism.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.