Sciweavers

456 search results - page 70 / 92
» A Proof System for Abstract Non-interference
Sort
View
CAV
1998
Springer
103views Hardware» more  CAV 1998»
14 years 29 days ago
You Assume, We Guarantee: Methodology and Case Studies
Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system veri cation. Re nement mappings (homomorphisms) have long bee...
Thomas A. Henzinger, Shaz Qadeer, Sriram K. Rajama...
FUIN
2006
95views more  FUIN 2006»
13 years 8 months ago
Multistrategy Operators for Relational Learning and Their Cooperation
Traditional Machine Learning approaches based on single inference mechanisms have reached their limits. This causes the need for a framework that integrates approaches based on aba...
Floriana Esposito, Nicola Fanizzi, Stefano Ferilli...
BIRTHDAY
2010
Springer
14 years 1 months ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
IFL
2005
Springer
207views Formal Methods» more  IFL 2005»
14 years 2 months ago
A Dependently Typed Framework for Static Analysis of Program Execution Costs
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
Edwin Brady, Kevin Hammond
PPDP
2007
Springer
14 years 2 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana