156 search results - page 25 / 32 » Proving Failure in Functional Logic Programs |
115
Voted
IGPL
2008
15 years 2 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
119
Voted
FOSSACS
2008
Springer
15 years 4 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
131
Voted
TLDI
2010
ACM
15 years 11 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
154
click to vote
OOPSLA
2007
Springer
15 years 8 months ago
2007
Springer
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
112
Voted
SAS
2007
Springer
15 years 8 months ago
2007
Springer
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...