35 search results - page 3 / 7 » Formal Language, Grammar and Set-Constraint-Based Program An... |
SAS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...
PLDI
2012
ACM
11 years 8 months ago
2012
ACM
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
KBSE
2000
IEEE
13 years 10 months ago
2000
IEEE
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
SAS
1991
Springer
13 years 9 months ago
1991
Springer
Specializing programs by partial evaluation is well defined extensionally, but in practice no intensional properties, such as what the specialized programs will look like or how ...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...