Sciweavers

249 search results - page 22 / 50
» Principals in Programming Languages: A Syntactic Proof Techn...
Sort
View
POPL
2010
ACM
14 years 6 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
TPHOL
2008
IEEE
14 years 3 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 8 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
ICFP
2002
ACM
14 years 8 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
TPHOL
1998
IEEE
14 years 27 days ago
Program Abstraction in a Higher-Order Logic Framework
Abstraction in a Higher-Order Logic Framework Marco Benini Sara Kalvala Dirk Nowotka Department of Computer Science University of Warwick, Coventry, CV4 7AL, United Kingdom We pres...
Marco Benini, Sara Kalvala, Dirk Nowotka