Results 1 - 10
of
194
Reconstructing paths for reachable code.
- In ICFEM,
, 2013
"... Abstract. Infeasible code has proved to be an interesting target for static analysis. It allows modular and scalable analysis, and at the same time, can be implemented with a close-to-zero rate of false warnings. The challenge for an infeasible code detection algorithm is to find executions that co ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
that cover all statements with feasible executions as fast as possible. The remaining statements are infeasible code. In this paper we propose a new encoding of programs into first-order logic formulas that allows us to query the non-existence of feasible executions of a program, and, to reconstruct a
Answering reachability questions
, 2011
"... Software developers understanding and exploring code spend much of their time asking questions and searching for answers. Yet little has been known about the questions devel-‐ opers ask, the strategies used to answer them, and the challenges developers face. Through interviews, surveys, and observat ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
of developers ’ work to design more useful tools for developers. These studies reveal that reachability questions are a central part of understanding and ex-‐ ploring code. A reachability question is a search along paths through code. Developers ask reachability questions when reasoning about causality
Termination proofs for systems code
- In PLDI ’06: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
, 2006
"... Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and context-sensitive program analysis and provides capacity for large program fragments (i.e. more than 20,000 lines of code) tog ..."
Abstract
-
Cited by 177 (40 self)
- Add to MetaCart
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and context-sensitive program analysis and provides capacity for large program fragments (i.e. more than 20,000 lines of code
An algebraic approach to IP traceback
- ACM Transactions on Information and System Security
, 2002
"... We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. This paper reframes the traceback problem as a polynomial reconstruction problem and uses algebraic techniques from coding theory an ..."
Abstract
-
Cited by 227 (0 self)
- Add to MetaCart
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. This paper reframes the traceback problem as a polynomial reconstruction problem and uses algebraic techniques from coding theory
Dappled photography: Mask enhanced cameras for heterodyned light fields and coded aperture refocusing
- in Proc. ACM SIGGRAPH
, 2007
"... Figure 1: Our heterodyne light field camera provides 4D light field and full-resolution focused image simultaneously. (First Column) Raw sensor image. (Second Column) Scene parts which are in-focus can be recovered at full resolution. (Third Column) Inset shows fine-scale light field encoding (top) ..."
Abstract
-
Cited by 139 (32 self)
- Add to MetaCart
) and the corresponding part of the recovered full resolution image (bottom). (Last Column) Far focused and near focused images obtained from the light field. We describe a theoretical framework for reversibly modulating 4D light fields using an attenuating mask in the optical path of a lens based camera. Based
Statement-Coverage Testing for Concurrent Programs in Reachability Testing
"... In this paper we propose a scheme for reachability testing to achieve statement cov-erage in the dynamic testing of concurrent programs. Previous studies on reachability testing have only enumerated the feasible interleavings of a concurrent program for a given input. The proposed scheme derives inp ..."
Abstract
- Add to MetaCart
inputs from SYN-sequences obtained in reachability testing and uses these inputs to perform reachability testing multiple times in order to achieve statement-coverage testing for a concurrent program. We prove formally that the proposed method can achieve statement-coverage testing if all the path condi
An incremental points-to analysis with CFL-reachability
- In CC’13
"... Abstract. Developing scalable and precise points-to analyses is increasingly important for analysing and optimising object-oriented programs where pointers are used pervasively. An incremental analysis for a program updates the existing analysis information after program changes to avoid reanalysing ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
reanalysing it from scratch. This can be efficiently deployed in software development environments where code changes are often small and frequent. This paper presents an incremental approach for demand-driven context-sensitive points-to analyses based on Context-Free Language (CFL) reachability. By tracing
WORK IN PROGRESS: AN ARCHITECTURE FOR NETWORK PATH RECONSTRUCTION VIA BACKTRACED
"... There has been extensive work in crime scene reconstruction of physical locations, and much is known in terms of digital forensics of computing devices. However, the network has remained a nebulous combination of entities that are largely ignored during an investigation due to the transient nature o ..."
Abstract
- Add to MetaCart
of the data that flows through the networks. This paper introduces an architecture for network path reconstruction using the network layer reachability information shared via OSPF Link State Advertisements and the routines and functions of OSPF::rt_sched() as applied to the construction of identical Link
TO CODE OR NOT TO CODE
, 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract
- Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:
Reconstructing Control Flow from Predicated Assembly Code
, 2003
"... Predicated instructions are a feature more and more common in contemporary instruction set architectures. Machine instructions are only executed if an individual guard register associated with the instruction evaluates to true. This enhances execution efficiency, but comes at a price: the control fl ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
flow of a program is not explicit any more. Instead instructions from the same basic block may belong to different execution paths if they are subject to disjoint guard predicates. Postpass tools processing machine code with the purpose of program analyses or optimizations require the control flow
Results 1 - 10
of
194