Sciweavers

641 search results - page 28 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
DOCENG
2008
ACM
15 years 4 months ago
Merging changes in XML documents using reliable context fingerprints
Different dialects of XML have emerged as ubiquitous document exchange formats. For effective collaboration based on such documents, the capability to propagate edit operations pe...
Sebastian Rönnau, Christian Pauli, Uwe M. Bor...
FM
1999
Springer
107views Formal Methods» more  FM 1999»
15 years 6 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
FAC
2010
106views more  FAC 2010»
14 years 11 months ago
Automatic verification of Java programs with dynamic frames
Framing in the presence of data abstraction is a challenging and important problem in the verification of object-oriented programs [LLM07]. The dynamic frames approach is a promisi...
Jan Smans, Bart Jacobs, Frank Piessens, Wolfram Sc...
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 2 months ago
When is there a representer theorem? Vector versus matrix regularizers
We consider a general class of regularization methods which learn a vector of parameters on the basis of linear measurements. It is well known that if the regularizer is a nondecr...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
213
Voted
POPL
2005
ACM
16 years 2 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier