Sciweavers

4716 search results - page 135 / 944
» Iterative-free program analysis
Sort
View
ACSD
2004
IEEE
102views Hardware» more  ACSD 2004»
15 years 1 months ago
Arrays and Contracts for the Specification and Analysis of Regular Systems
We explore a structuring mechanism for reactive systems, based on two ideas: array iterators allow the description of regular systems; logical-time contracts allow local or global...
Florence Maraninchi, Lionel Morel
IFIP
2010
Springer
14 years 4 months ago
Analysis of a Receipt-Free Auction Protocol in the Applied Pi Calculus
Abstract. We formally study two privacy-type properties in online auction protocols, bidding-price-secrecy and receipt-freeness. These properties are formalised as observational eq...
Naipeng Dong, Hugo L. Jonker, Jun Pang
VMCAI
2009
Springer
15 years 4 months ago
Thread-Modular Shape Analysis
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sa...
SAS
2007
Springer
124views Formal Methods» more  SAS 2007»
15 years 4 months ago
Arithmetic Strengthening for Shape Analysis
Abstract. Shape analyses are often imprecise in their numerical reasoning, whereas numerical static analyses are often largely unaware of the shape of a program’s heap. In this p...
Stephen Magill, Josh Berdine, Edmund M. Clarke, By...
ISSTA
2012
ACM
13 years 13 days ago
Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
Devin Coughlin, Bor-Yuh Evan Chang, Amer Diwan, Je...