1226 search results - page 51 / 246 » Proofs, Programs and Abstract Complexity |
139
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...
157
click to vote
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Concurrency, as a useful feature of many modern programming languages and systems, is generally hard to reason about. Although existing work has explored the verification of concu...
107
click to vote
DAGSTUHL
2003
15 years 4 months ago
2003
Abstract. There are a range of abstractions used for both modelling and proof modern computational systems. While these abstractions may have been devised for specific purposes, t...
230
click to vote
POPL
2007
ACM
16 years 3 months ago
2007
ACM
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
113
click to vote
ICFP
2002
ACM
16 years 3 months ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...