Sciweavers

115 search results - page 9 / 23
» An integrated proof language for imperative programs
Sort
View
POPL
2010
ACM
15 years 7 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
JCS
2007
141views more  JCS 2007»
14 years 9 months ago
Compositional information flow security for concurrent programs
We present a general unwinding framework for the definition of information flow security properties of concurrent programs, described in a simple imperative language enriched wi...
Annalisa Bossi, Carla Piazza, Sabina Rossi
111
Voted
TGC
2010
Springer
14 years 7 months ago
Certified Result Checking for Polyhedral Analysis of Bytecode Programs
Static analysers are becoming so complex that it is crucial to ascertain the soundness of their results in a provable way. In this paper we develop a certified checker in Coq that ...
Frédéric Besson, Thomas P. Jensen, D...
TCS
2008
14 years 9 months ago
Integration of a security type system into a program logic
Type systems and program logics are often conceived to be at opposing ends of the spectrum of formal software analyses. In this paper we show that a flow-sensitive type system ensu...
Reiner Hähnle, Jing Pan, Philipp Rümmer,...
117
Voted
AMAST
2010
Springer
14 years 4 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte