Sciweavers

4211 search results - page 97 / 843
» Types as Abstract Interpretations
Sort
View
105
Voted
CAV
2006
Springer
143views Hardware» more  CAV 2006»
15 years 7 months ago
Automatic Termination Proofs for Programs with Shape-Shifting Heaps
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....
119
Voted
CONCUR
2005
Springer
15 years 9 months ago
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
Abstract. In this paper we show how to compress efficiently the statespace of a concurrent system (here applied to a simple shared memory model, but this is no way limited to that ...
Eric Goubault, Emmanuel Haucourt
163
Voted
SAS
2012
Springer
226views Formal Methods» more  SAS 2012»
13 years 6 months ago
A Structural Soundness Proof for Shivers's Escape Technique - A Case for Galois Connections
Abstract. Shivers’s escape technique enables one to analyse the control flow of higher-order program fragments. It is widely used, but its soundness has never been proven. In th...
Jan Midtgaard, Michael D. Adams 0001, Matthew Migh...
113
Voted
TACAS
2005
Springer
106views Algorithms» more  TACAS 2005»
15 years 9 months ago
Dependent Types for Program Understanding
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...
Raghavan Komondoor, Ganesan Ramalingam, Satish Cha...
135
Voted
ICSE
1997
IEEE-ACM
15 years 7 months ago
Lackwit: A Program Understanding Tool Based on Type Inference
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
Robert O'Callahan, Daniel Jackson