Sciweavers

249 search results - page 32 / 50
» Principals in Programming Languages: A Syntactic Proof Techn...
Sort
View
FM
2009
Springer
104views Formal Methods» more  FM 2009»
15 years 4 months ago
Verifying Information Flow Control over Unbounded Processes
Abstract. Decentralized Information Flow Control (DIFC) systems enable programmers to express a desired DIFC policy, and to have the policy enforced via a reference monitor that re...
William R. Harris, Nicholas Kidd, Sagar Chaki, Som...
177
Voted
POPL
2009
ACM
15 years 10 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
PASTE
2004
ACM
15 years 3 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas
BIRTHDAY
2006
Springer
15 years 1 months ago
Eliminating Dependent Pattern Matching
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
Healfdene Goguen, Conor McBride, James McKinna
KBSE
2000
IEEE
15 years 2 months ago
Model Checking Programs
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
Willem Visser, Klaus Havelund, Guillaume P. Brat, ...