Sciweavers

213 search results - page 25 / 43
» A framework for checking proofs naturally
Sort
View
ICFP
1997
ACM
13 years 11 months ago
Foundations for the Implementation of Higher-Order Subtyping
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...
Karl Crary
COMPSAC
2009
IEEE
13 years 8 months ago
Modular Certification of Low-Level Intermediate Representation Programs
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 ...
Yuan Dong, Shengyuan Wang, Liwei Zhang, Ping Yang
POPL
2004
ACM
14 years 7 months ago
Symbolic transfer function-based approaches to certified compilation
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...
Xavier Rival
KR
2010
Springer
14 years 9 days ago
Modelling Combinatorial Auctions in Linear Logic
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...
Daniele Porello, Ulle Endriss
SEKE
2005
Springer
14 years 1 months ago
Generating Properties for Runtime Monitoring from Software Specification Patterns
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...
Oscar Mondragon, Ann Q. Gates, Humberto Mendoza, O...