3713 search results - page 338 / 743 » Constructing a Calculus of Programs |
120
Voted
SAS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resoluti...
108
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
158
click to vote
HASKELL
2007
ACM
15 years 8 months ago
2007
ACM
We propose an extension to list comprehensions that makes it easy to express the kind of queries one would write in SQL using ORDER BY, GROUP BY, and LIMIT. Our extension adds exp...
129
click to vote
APLAS
2010
ACM
15 years 4 months ago
2010
ACM
We extract techniques developed in the Concurrent C minor project to build a framework for constructing logics that contain approximation and/or separation. Approximation occurs wh...
118
click to vote
MP
2010
15 years 3 months ago
2010
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...