797 search results - page 53 / 160 » Eliminating Proofs from Programs |
138
click to vote
ATVA
2008
Springer
15 years 5 months ago
2008
Springer
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
164
click to vote
AMAST
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
120
click to vote
PLDI
1993
ACM
15 years 7 months ago
1993
ACM
This paper describes a new language feature that allows dynamically allocated objects to be saved from deallocation by an automatic storage management system so that clean-up or o...
115
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...
106
Voted
CCS
2009
ACM
15 years 10 months ago
2009
ACM
Many programs operate reactively, patiently waiting for user input, subsequently running for a while producing output, and eventually returning to a state where they are ready to ...