578 search results - page 32 / 116 » Analysis of Programs with Exception-Handling Constructs |
115
Voted
APLAS
2005
ACM
15 years 8 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
132
Voted
ENTCS
2007
15 years 2 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
144
Voted
FUIN
2006
15 years 2 months ago
2006
In recent years light-weighted formal methods are of growing interest in construction and analysis of complex concurrent software system. A new rule-action based term rewriting fr...
129
Voted
PLILP
1992
Springer
15 years 6 months ago
1992
Springer
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
102
Voted
SAS
1999
Springer
15 years 7 months ago
1999
Springer
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...