213 search results - page 25 / 43 » A framework for checking proofs naturally |
213
click to vote
ICFP
1997
ACM
15 years 10 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
177
click to vote
COMPSAC
2009
IEEE
15 years 7 months ago
2009
IEEE
Modular certification of low-level intermediate representation (IR) programs is one of the key steps of proof-transforming compilation. The major challenges are lexity of abstract ...
278
click to vote
POPL
2004
ACM
16 years 6 months ago
2004
ACM
We present a framework for the certification of compilation and of compiled programs. Our approach uses a symbolic transfer functions-based representation of programs, so as to ch...
138
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
164
click to vote
SEKE
2005
Springer
15 years 11 months ago
2005
Springer
The paper presents an approach to support run-time verification of software systems that combines two existing tools, Prospec and Java-MaC, into a single framework. Prospec can be...