类 型
34 篇文献
 
Model-Checking Higher-Order Programs with Recursive Types  
Model checking of higher-order recursion schemes (HORS, for short) has been recently studied as a new promising technique for automated verification of higher-order programs. The previous HORS model c......
European Symposium on Programming  2013
0次引用 0 0
Modular verification of security protocol code by typing  
We propose a method for verifying the security of protocol implementations. Our method is based on declaring and enforcing invariants on the usage of cryptography. We develop cryptographic libraries t......
Sigplan Notices  2010
8次引用 0 0
Ur: statically-typed metaprogramming with type-level record computation  
Dependent typesprovide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which allows types to menti......
Sigplan Notices  2010
15次引用 0 0
Automating relatively complete verification of higher-order functional programs  
We present an automated approach to relatively completely verifying safety (i.e., reachability) property of higher-order functional programs. Our contribution is two-fold. First, we extend the refinem......
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages  2013
1次引用 0 0
CSolve: Verifying C with Liquid Types  
We present CSolve, an automated verifier for C programs based on Liquid Type inference. We show how CSolve verifies memory safety through an example and describe its architecture and interface.......
Computer Aided Verification  2012
0次引用 0 0
Decision procedures for algebraic data types with abstractions  
We describe a family of decision procedures that extend the decision procedure for quantifier-free constraints on recursive algebraic data types (term algebras) to support recursive abstraction functi......
Sigplan Notices  2010
13次引用 0 0
Software model checking  
We survey recent progress in software model checking.......
ACM Computing Surveys  2009
38次引用 0 0
Hybrid type checking  
Traditional static type systems are effective for verifying basic interface specifications. Dynamically checked contracts support more precise specifications, but these are not checked until runtime, ......
ACM Transactions on Programming Languages and Systems  2010
8次引用 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
Synthesizing software verifiers from proof rules  
Automatically generated tools can significantly improve programmer productivity. For example, parsers and dataflow analyzers can be automatically generated from declarative specifications in the form ......
Sigplan Notices  2012
7次引用 0 0

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