Sciweavers

279 search results - page 17 / 56
» Invariant Patterns for Program Reasoning
Sort
View
CADE
2000
Springer
13 years 11 months ago
Machine Instruction Syntax and Semantics in Higher Order Logic
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
Neophytos G. Michael, Andrew W. Appel
FLOPS
2010
Springer
14 years 2 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
PLDI
2009
ACM
14 years 8 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
TLDI
2009
ACM
122views Formal Methods» more  TLDI 2009»
14 years 4 months ago
Towards type-theoretic semantics for transactional concurrency
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
13 years 5 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall