151 search results - page 25 / 31 » Predicate Abstraction in a Program Logic Calculus |
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
ICFP
1999
ACM
13 years 11 months ago
1999
ACM
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
CADE
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
PPDP
2009
Springer
14 years 1 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...