Sciweavers

374 search results - page 26 / 75
» Using Language Inference to Verify Omega-Regular Properties
Sort
View
TPHOL
2000
IEEE
15 years 2 months ago
Proving ML Type Soundness Within Coq
We verify within the Coq proof assistant that ML typing is sound with respect to the dynamic semantics. We prove this property in the framework of a big step semantics and also in ...
Catherine Dubois
NECO
2008
116views more  NECO 2008»
14 years 9 months ago
A (Somewhat) New Solution to the Variable Binding Problem
To perform automatic, unconscious inference, the human brain must solve the "binding problem" by correctly grouping properties with objects. Temporal binding models like...
Leon Barrett, Jerome Feldman, Liam Mac Dermed
ECOOP
2010
Springer
15 years 2 months ago
Recency Types for Analyzing Scripting Languages
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
Phillip Heidegger, Peter Thiemann
170
Voted
POPL
2006
ACM
15 years 10 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
POPL
2008
ACM
15 years 10 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan