Sciweavers

429 search results - page 43 / 86
» Theorem Proving Languages for Verification
Sort
View
KBSE
1999
IEEE
14 years 28 days ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
ENTCS
2008
139views more  ENTCS 2008»
13 years 8 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
TIC
2000
Springer
137views System Software» more  TIC 2000»
14 years 6 days ago
Scalable Certification for Typed Assembly Language
Abstract. A type-based certifying compiler maps source code to machine code and target-level type annotations. The target-level annotations make it possible to prove easily that th...
Dan Grossman, J. Gregory Morrisett
ATVA
2008
Springer
139views Hardware» more  ATVA 2008»
13 years 10 months ago
Compositional Verification for Component-Based Systems and Application
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...
POPL
2005
ACM
14 years 9 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...