Sciweavers

17 search results - page 3 / 4
» Certified Size-Change Termination
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
13 years 7 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
FROCOS
2007
Springer
13 years 11 months ago
Certification of Automated Termination Proofs
Abstract. Nowadays, formal methods rely on tools of different kinds: proof assistants with which the user interacts to discover a proof step by step; and fully automated tools whic...
Evelyne Contejean, Pierre Courtieu, Julien Forest,...
ICFP
2005
ACM
14 years 7 months ago
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proof-carrying code (PCC) is a general framework that can, in principle, verify safety properties of arbitrary machine-language programs. Existing PCC systems and typed assembly l...
Xinyu Feng, Zhong Shao
TPHOL
2003
IEEE
14 years 20 days ago
A Coverage Checking Algorithm for LF
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
Carsten Schürmann, Frank Pfenning
APLAS
2007
ACM
13 years 11 months ago
More Typed Assembly Languages for Confidentiality
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...
Dachuan Yu