2398 search results - page 274 / 480 » Constraint Programming and Graph Algorithms |
155
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
We present a new approach to information flow control (IFC), ploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existi...
199
click to vote
POPL
2010
ACM
15 years 8 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
204
click to vote
TRIER
2002
15 years 6 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
150
click to vote
PPDP
2005
Springer
15 years 12 months ago
2005
Springer
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
168
Voted
JFP
2000
15 years 6 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...