Sciweavers

160 search results - page 2 / 32
» Structuring the verification of heap-manipulating programs
Sort
View
POPL
2010
ACM
14 years 2 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
HASE
1998
IEEE
13 years 9 months ago
Verification in Concurrent Programming with Petri Nets Structural Techniques
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
Kamel Barkaoui, Jean-François Pradat-Peyre
POPL
2010
ACM
14 years 2 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...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 3 months ago
Automatic Verification of Determinism for Structured Parallel Programs
Martin T. Vechev, Eran Yahav, Raghavan Raman, Vive...
IEE
2008
115views more  IEE 2008»
13 years 4 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller