Sciweavers

128 search results - page 8 / 26
» Verifying Process Algebra Proofs in Type Theory
Sort
View
POPL
2010
ACM
14 years 5 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...
QSIC
2007
IEEE
14 years 1 months ago
Verifying Noninterference in a Cyber-Physical System The Advanced Electric Power Grid
The advanced electric power grid is a complex real-time system having both Cyber and Physical components. While each component may function correctly, independently, their composi...
Yan Sun, Bruce M. McMillin, Xiaoqing Frank Liu, Da...
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
14 years 28 days ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka
ANSOFT
2002
126views more  ANSOFT 2002»
13 years 7 months ago
The Real-Time Process Algebra (RTPA)
Abstract. The real-time process algebra (RTPA) is a set of new mathematical notations for formally describing system architectures, and static and dynamic behaviors. It is recogniz...
Yingxu Wang
ENTCS
2007
100views more  ENTCS 2007»
13 years 7 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier