Extended Weighted Pushdown Systems

Lal, Akash; Reps, Thomas; Balakrishnan, Gogul

doi:10.1007/11513988_44

Cited by 53 publications

(65 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We used EWPDS merge functions [15] to preserve caller-save and callee-save registers across call sites. The post * query used the FWPDS algorithm [14].…”

Section: Methodsmentioning

confidence: 99%

“…This section describes how to use the KS domain in interprocedural-analysis algorithms in the style of Sharir and Pnueli [24], Knoop and Steffen [13], Müller-Olm and Seidl [18], and Lal et al [15].…”

Section: Using Ks For Interprocedural Analysismentioning

confidence: 99%

“…Because the contents of P 's locals cannot be affected by the call to Q, a merge function is used to combine them with the value returned by Q to create the state after Q returns. Other work using merge functions includes Müller-Olm and Seidl [18] and Lal et al [15].…”

Section: Using Ks For Interprocedural Analysismentioning

confidence: 99%

See 2 more Smart Citations

Abstract Domains of Affine Relations

et al. 2011

Self Cite

View full text Add to dashboard Cite

Abstract. This paper considers some known abstract domains for affine-relation analysis (ARA), along with several variants, and studies how they relate to each other. We show that the abstract domains of Müller-Olm/Seidl (MOS) and King/Søndergaard (KS) are, in general, incomparable, but give sound interconversion methods. We also show that the methods of King and Søndergaard can be applied without bitblasting-while still using a bit-precise concrete semantics.

show abstract

“…We used EWPDS merge functions [15] to preserve caller-save and callee-save registers across call sites. The post * query used the FWPDS algorithm [14].…”

Section: Methodsmentioning

confidence: 99%

Section: Using Ks For Interprocedural Analysismentioning

confidence: 99%

See 1 more Smart Citation

Abstract Domains of Affine Relations

et al. 2011

Self Cite

View full text Add to dashboard Cite

show abstract

“…PDSs are a natural model for abstractly interpreted programs used in key applications like dataflow analysis [15]. A PDS has a finite control part corresponding to the valuation of the variables of a thread and a stack which provides a means to model recursion.…”

Section: System Modelmentioning

confidence: 99%

“…For sequential programs, Pushdown Systems (PDSs) have emerged as a powerful, unifying framework for efficiently encoding many inter-procedural dataflow analyses [15,5]. Given a sequential program, abstract interpretation is first used to get a finite representation of the control part of the program while recursion is modeled using a stack.…”

Section: Introductionmentioning

confidence: 99%

Reasoning about Threads with Bounded Lock Chains

Kahlon¹

2011

CONCUR 2011 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. Unfortunately, it is undecidable even for the most commonly used synchronization primitive, i.e., mutex locks. Lock usage in concurrent programs can be characterized in terms of lock chains, where a sequence of mutex locks is said to be chained if the scopes of adjacent (non-nested) mutexes overlap. Although the model checking problem for fragments of Linear Temporal Logic (LTL) is known to be decidable for threads interacting via nested locks, i.e., chains of length one, these techniques don't extend to programs with non-nested locks used in crucial applications like databases. We exploit the fact that lock usage patterns in real life programs do not produce unbounded lock chains. For such a framework, we show, by using the new concept of Lock Causality Automata (LCA), that pre * -closures of regular sets of states can be computed efficiently. Leveraging this new technique then allows us to formulate decision procedures for model checking threads communicating via bounded lock chains for fragments of LTL. Our new results narrow the decidability gap for LTL model checking of threads communicating via locks by providing a more refined characterization for it in terms of boundedness of lock chains rather than the current state-of-the-art, i.e., nestedness of locks (chains of length one).

show abstract

Model Checking x86 Executables with CodeSurfer/x86 and WPDS++

Balakrishnan

Reps

Kidd

et al. 2005

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. This paper presents a toolset for model checking x86 executables. The members of the toolset are CodeSurfer/x86, WPDS++, and the Path Inspector. CodeSurfer/x86 is used to extract a model from an executable in the form of a weighted pushdown system. WPDS++ is a library for answering generalized reachability queries on weighted pushdown systems. The Path Inspector is a software model checker built on top of CodeSurfer and WPDS++ that supports safety queries about the program's possible control configurations.

show abstract

Extended Weighted Pushdown Systems

Cited by 53 publications

References 21 publications

Abstract Domains of Affine Relations

Abstract Domains of Affine Relations

Reasoning about Threads with Bounded Lock Chains

Model Checking x86 Executables with CodeSurfer/x86 and WPDS++

Contact Info

Product

Resources

About