2000 search results - page 281 / 400 » Program Transformation and Proof Transformation |
234
Voted
POPL
2004
ACM
16 years 4 months ago
2004
ACM
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
145
Voted
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
113
Voted
ATAL
2003
Springer
15 years 9 months ago
2003
Springer
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...
109
Voted
PLDI
1999
ACM
15 years 8 months ago
1999
ACM
Load-reuse analysis finds instructions that repeatedly access the same memory location. This location can be promoted to a register, eliminating redundant loads by reusing the re...
113
Voted
APLAS
2008
ACM
15 years 5 months ago
2008
ACM
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...