3713 search results - page 439 / 743 » Constructing a Calculus of Programs |
112
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
152
click to vote
CC
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. This paper presents four extensions to the Interprocedural Finite Distributive Subset (IFDS) algorithm that make it applicable to a wider class of analysis problems. IFDS...
117
click to vote
FMCAD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract—Several successful approaches to software verificabased on the construction and analysis of an abstract reachability tree (ART). The ART represents unwindings of the co...
141
click to vote
SEFM
2008
IEEE
15 years 10 months ago
2008
IEEE
Aspect oriented programming can arbitrarily distort the semantics of programs. In particular, weaving can invalidate crucial safety and liveness properties of the base program. In...
123
click to vote
CAV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...