Sciweavers

33 search results - page 2 / 7
» Determinacy Analysis for Logic Programs Using Mode and Type ...
Sort
View
ICLP
2003
Springer
13 years 11 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
JFP
2007
111views more  JFP 2007»
13 years 5 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
SPC
2005
Springer
13 years 11 months ago
A Theorem Proving Approach to Analysis of Secure Information Flow
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
Ádám Darvas, Reiner Hähnle, Dav...
CORR
2006
Springer
86views Education» more  CORR 2006»
13 years 5 months ago
Improving Precision of Type Analysis Using Non-Discriminative Union
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...
Lunjin Lu
POPL
2006
ACM
14 years 6 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands