Sciweavers

613 search results - page 52 / 123
» An analysis framework for network-code programs
Sort
View
PLDI
2012
ACM
13 years 5 days ago
Parallelizing top-down interprocedural analyses
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
Aws Albarghouthi, Rahul Kumar, Aditya V. Nori, Sri...
ESOP
2010
Springer
15 years 7 months ago
Weighted Dynamic Pushdown Networks
We develop a generic framework for the analysis of programs with recursive procedures and dynamic process creation. To this end we combine the approach of weighted pushdown systems...
Alexander Wenner
ECSQARU
2005
Springer
15 years 3 months ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
TSE
2010
151views more  TSE 2010»
14 years 8 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
ICSE
1995
IEEE-ACM
15 years 1 months ago
A Compact Petri Net Representation for Concurrent Programs
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
Matthew B. Dwyer, Lori A. Clarke, Kari A. Nies