作  者
期刊 & 会议
年  份
Ming Kawaguchi 的引文(110) 排序方式:
Manifest Contracts for Datatypes  
We study algebraic data types in a manifest contract system, a software contract system where contract information occurs as refinement types. We first compare two simple approaches: refinements on ty......
Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages  2015
0次引用 0 0
Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy  
Mechanism design is the study of algorithm design where the inputs to the algorithm are controlled by strategic agents, who must be incentivized to faithfully report them. Unlike typical programmatic ......
Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages  2015
0次引用 0 0
Verifying Relational Properties of Functional Programs by First-Order Refinement  
Much progress has been made recently on fully automated verification of higher-order functional programs, based on refinement types and higher-order model checking. Most of those verification techniqu......
Partial Evaluation and Program Manipulation  2015
0次引用 0 0
Manifest Contracts for Datatypes  
We study algebraic data types in a manifest contract system, a software contract system where contract information occurs as refinement types. We first compare two simple approaches: refinements on ty......
Proceedings of the 42Nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages  2015
0次引用 0 0
Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics  
Most statically typed functional programming languages allow programmers to write partial functions: functions that are not defined on all the elements of their domain as specified by their type. Appl......
Partial Evaluation and Program Manipulation  2015
0次引用 0 0
Abstract Refinement Types  
We presentabstract refinement typeswhich enable quantification over the refinements of data- and function-types. Our key insight is that we can avail of quantification while preserving SMT-based decid......
European Symposium on Programming  2013
1次引用 0 0
Towards a scalable software model checker for higher-order programs  
In our recent paper, we have shown how to construct a fully-automated program verification tool (so called a "software model checker") for a tiny subset of functional language ML, by combining higher-......
Partial Evaluation and Semantic-Based Program Manipulation  2013
1次引用 0 0
Verifying higher-order programs with the dijkstra monad  
Modern programming languages, ranging from Haskell and ML, to JavaScript, C# and Java, all make extensive use of higher-order state. This paper advocates a new verification methodology for higher-orde......
Sigplan Notices  2013
2次引用 0 0
HALO: haskell to logic through denotational semantics  
Even well-typed programs can go wrong in modern functional languages, by encountering a pattern-match failure, or simply returning the wrong answer. An increasingly-popular response is to allow progra......
Sigplan Notices  2013
1次引用 0 0
Rely-guarantee references for refinement types over aliased mutable data  
Reasoning about side effects and aliasing is the heart of verifying imperative programs. Unrestricted side effects through one reference can invalidate assumptions about an alias. We present a new typ......
Sigplan Notices  2013
0次引用 0 0

1/11 第一页 上一页 1 2 3 4 5 6 7 下一页
Feedback
Feedback
Feedback
我想反馈:
排行榜