Sciweavers

238 search results - page 26 / 48
» Program Abstraction in a Higher-Order Logic Framework
Sort
View
ESOP
2004
Springer
14 years 28 days ago
Extracting a Data Flow Analyser in Constructive Logic
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
David Cachera, Thomas P. Jensen, David Pichardie, ...
ACTAC
2002
75views more  ACTAC 2002»
13 years 7 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
SSR
2001
134views more  SSR 2001»
13 years 9 months ago
Generation of visitor components that implement program transformations
The visitor pattern is appealing to developers of program-analysis tools because it separates the design of the data structures that represent a program from the design of softwar...
Kurt Stirewalt, Laura K. Dillon
IGPL
2006
130views more  IGPL 2006»
13 years 7 months ago
Verifying Temporal Heap Properties Specified via Evolution Logic
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
Eran Yahav, Thomas W. Reps, Shmuel Sagiv, Reinhard...
AAAI
2008
13 years 10 months ago
A Formalization of Program Debugging in the Situation Calculus
Program debugging is one of the most time-consuming parts of the software development cycle. In recent years, automatic debugging has been an active research area in software engi...
Yongmei Liu