Sciweavers

378 search results - page 33 / 76
» Information Flow Analysis for VHDL
Sort
View
ENTCS
2010
133views more  ENTCS 2010»
13 years 3 months ago
Inference of Session Types From Control Flow
This is a study of a technique for deriving the session type of a program written in a statically typed imperative language from its control flow. We impose on our unlabelled sess...
Peter Collingbourne, Paul H. J. Kelly
CC
2007
Springer
14 years 2 months ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
FORTE
2007
13 years 10 months ago
A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows i...
Sami Evangelista, Christophe Pajault, Jean-Fran&cc...
APVIS
2011
12 years 8 months ago
Edge maps: Representing flow with bounded error
Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Many analysis techniques rely on co...
Harsh Bhatia, Shreeraj Jadhav, Peer-Timo Bremer, G...
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 3 months ago
Quantifying Information Leakage in Finite Order Deterministic Programs
Information flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. While past work has proposed information...
Ji Zhu, Mudhakar Srivatsa