Sciweavers

218 search results - page 24 / 44
» Verifying Safety Properties with the TLA Proof System
Sort
View
TPHOL
2000
IEEE
15 years 4 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
POPL
2010
ACM
15 years 9 months ago
Dependent types and program equivalence
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
Jianzhou Zhao, Limin Jia, Stephanie Weirich, Vilhe...
POPL
2008
ACM
16 years 2 days ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
ECOOP
2006
Springer
15 years 3 months ago
A Semantic Analysis of C++ Templates
Templates are a powerful but poorly understood feature of the C++ language. Their syntax resembles the parameterized classes of other languages (e.g., of Java). But because C++ sup...
Jeremy G. Siek, Walid Taha
ENTCS
2006
123views more  ENTCS 2006»
14 years 11 months ago
Steering of Discrete Event Systems: Control Theory Approach
Runtime verification involves monitoring the system at runtime to check for conformance of the execution trace to user defined safety properties. Typically, run-time verifiers do ...
Arvind Easwaran, Sampath Kannan, Oleg Sokolsky