Sciweavers

4966 search results - page 287 / 994
» its 2010
Sort
View
ENTCS
2006
153views more  ENTCS 2006»
15 years 6 months ago
Automatic Complexity Analysis for Programs Extracted from Coq Proof
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
Jean-Pierre Jouannaud, Weiwen Xu
ENTCS
2006
142views more  ENTCS 2006»
15 years 6 months ago
Predicate Diagrams for the Verification of Real-Time Systems
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
Eun-Young Kang, Stephan Merz
ENTCS
2006
80views more  ENTCS 2006»
15 years 6 months ago
Synchronisation in Trust Management Using Push Authorisation
Traditional trust management authorisation decisions for distributed technologies, are, in general, based on the history of the authorisations/computation to date. We consider thi...
Thomas B. Quillinan, Simon N. Foley
ENTCS
2006
90views more  ENTCS 2006»
15 years 6 months ago
Runtime Verification for High-Confidence Systems: A Monte Carlo Approach
We present a new approach to runtime verification that utilizes classical statistical techniques such as Monte Carlo simulation, hypothesis testing, and confidence interval estima...
Sean Callanan, Radu Grosu, Abhishek Rai, Scott A. ...
ENTCS
2006
138views more  ENTCS 2006»
15 years 6 months ago
Propositional Games with Explicit Strategies
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
Bryan Renne