Sciweavers

592 search results - page 39 / 119
» Can Component Service-Based Systems Be Proved Correct
Sort
View
HYBRID
1998
Springer
13 years 11 months ago
Formal Verification of Safety-Critical Hybrid Systems
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
Carolos Livadas, Nancy A. Lynch
HICSS
2007
IEEE
97views Biometrics» more  HICSS 2007»
14 years 1 months ago
Implementation-Oriented Secure Architectures
We propose a framework for constructing secure systems at the architectural level. This framework is composed of an implementation-oriented formalization of a system’s architect...
Daniel Conte de Leon, Jim Alves-Foss, Paul W. Oman
EUROCRYPT
2012
Springer
11 years 10 months ago
Malleable Proof Systems and Applications
sion of an extended abstract published in Proceedings of Eurocrypt 2012, Springer-Verlag, 2012. Available from the IACR Cryptology ePrint Archive as Report 2012/012. Malleability ...
Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya...
BIRTHDAY
2010
Springer
13 years 5 months ago
Termination Graphs for Java Bytecode
To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...
LREC
2010
160views Education» more  LREC 2010»
13 years 9 months ago
Extraction, Merging, and Monitoring of Company Data from Heterogeneous Sources
We describe the implementation of an enterprise monitoring system that builds on an ontology-based information extraction (OBIE) component applied to heterogeneous data sources. T...
Christian Federmann, Thierry Declerck