نتایج جستجو برای: verified computation

تعداد نتایج: 210263  

2009
S. L. Ho Y. Li Edward W. C. Lo J. Y. Xu X. Lin

In this paper, a three-dimensional eddy current field model to calculate the eddy current losses in an isolated phase bus (IPB) is proposed. The rise in temperature of the conductors and enclosures in the IPB are evaluated using the proposed set of thermal equations. Computation results of a 20-kV/12.5-kA IPB scheme are reported to validate the algorithm. The withstand voltage ability and short...

2008
David H. Landy Michael N. Jones Robert L. Goldstone

Two experiments test predictions of a visual process-driven model of multi-term arithmetic computation. The visual process model predicts that attention should be drawn toward multiplication signs more readily than toward plus signs, and that narrow spaces should draw gaze comparably to multiplication signs. Although both of these predictions are verified by behavioral response measures and eye...

2013
Thomas Eisenbarth Ingo von Maurich Christof Paar Xin Ye

Digital signatures have become a key component of many embedded system solutions and are facing strong security and efficiency requirements. In this work, algorithmic improvements for the authentication path computation decrease the average signature computation time by close to 50% when compared to state-of-the-art algorithms. The proposed scheme is implemented on an Intel Core i7 CPU and an A...

Journal: :CoRR 2015
Michal Hajdusek Carlos A. Pérez-Delgado Joseph Fitzsimons

As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern. Although recent progress has resulted in several protocols which can verify the output of a quantum computation performed by entangled but non-communicating processors, the overhead for such schemes is prohibitive, scaling at least a...

2002
David A. Basin Stefan Friedrich Marek Gawkowski

We have used Isabelle/HOL to formalize and prove correct an approach to bytecode verification based on model checking that we have developed for the Java Virtual Machine. Our work builds on, and extends, the formalization of the Java Virtual Machine and data flow analysis framework of Pusch and Nipkow. By building on their framework, we can reuse their results that relate the run-time behavior ...

Journal: :Theor. Comput. Sci. 2001
Tobias Nipkow

Using the theorem prover Isabelle/HOL we have formalized and proved correct an executable bytecode verifier in the style of Kildall’s algorithm for a significant subset of the Java Virtual Machine. First an abstract framework for proving correctness of data flow based type inference algorithms for assembly languages is formalized. It is shown that under certain conditions Kildall’s algorithm yi...

Journal: :Journal of biomechanics 2002
Olof Calonius Vesa Saikko

In an earlier paper, the authors presented a new method of computation of slide tracks in the relative motion between femoral head and acetabular cup of total hip prostheses. For the first time, computed tracks were verified experimentally and with an alternative method of computation. Besides being an efficient way to illustrate hip kinematics, the shapes of the slide tracks are known to be of...

Journal: :Japan Journal of Industrial and Applied Mathematics 2009

Journal: :Journal of Automated Reasoning 2009

Journal: :Electronic proceedings in theoretical computer science 2021

An invaluable feature of computer algebra systems is their ability to plot the graph functions. Unfortunately, when one trying design a library mathematical functions, this often falls short, producing incorrect and potentially misleading plots, due accuracy issues inherent use case. This paper investigates what it means for be correct how formally verify property. The Coq proof assistant then ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید