136 search results - page 20 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
PPDP
2009
Springer
14 years 5 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...
COCO
2011
Springer
12 years 10 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
NJC
2006
13 years 11 months ago
2006
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
POPL
2012
ACM
12 years 6 months ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
LATA
2009
Springer
14 years 5 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...