theorem
RSS theoremSort by: Relevance | Date
Test-Sequence Generation With Hol-TestGen With an Application to Firewall Testing
White Paper HOL-TestGen is a specification and test case generation environment extending the interactive theorem prover Isabelle/HOL. Its method is two-staged: first, the original formula is partitioned into test cases by... [12 Nov 2009]
Automated Verification of Practical Garbage Collectors
White Paper The paper used the Boogie verification generator and the Z3 automated theorem prover to verify this assembly language code mechanically. Garbage collectors are notoriously hard to verify, due to their low-level... [16 Sep 2009]
Maximizing Unavailability Interval for Energy Saving in IEEE 802.16e Wireless MANs
White Paper By applying the Chinese Remainder Theorem, the proposed MUI is guaranteed to find the maximum Unavailability Interval, during which the transceiver can be powered down. The paper also proposes new mathematical techniques... [15 Apr 2009]
Programming With Proofs: Language-Based Approaches to Totally Correct Software
White Paper Theorem proving approaches to program verification have continued to make advances, but indeed, they still are generally applied only to the most critical applications. Tremendous progress has been made in automated and... [09 Jan 2009]
Reformulation of XML Queries and Constraints
White Paper The authors prove a completeness theorem which guarantees that under certain conditions, the algorithm will find a minimal reformulation if one exists. The authors state and solve the query reformulation problem for XML... [24 Dec 2008]
An Universal GUI for Theorem Provers
White Paper This paper describes architecture of an universal Graphical User Interface (GUI) for any theorem prover. The implemented solution is tested on a GUI for description logics. The solution is implemented using Eclipse... [11 Dec 2008]
Writing Literate Proofs With XML Tools
White Paper Designed to be an industrial-strength theorem prover, ACL2 provides powerful support for both of these. The paper needs a way to communicate proof scripts to a future human reader, not just to a mechanical... [04 Dec 2008]
Deductive Verification of UML Models in TLPVS
White Paper This paper presents an approach for the deductive verification of such systems using the PVS interactive theorem prover. In recent years, UML has been applied to the development of reactive safety-critical systems, in... [03 Dec 2008]
WSEmail: Secure Internet Messaging Based on Web Services
White Paper In particular, the paper demonstrates an automated proof using TulaFale and ProVerif of a correspondence theorem for an application called on-demand attachments. Web services offer an opportunity to redesign a variety of... [03 Dec 2008]
Inverse Visualization in Data Mining
White Paper Design of data preprocessing transformations is based on a transformation theorem proved in the paper. Visualization is used in data mining for visual presentation of already discovered patterns and for discovering new... [19 Sep 2008]
An Application of Central Limit Theorem to Wide Area Network Service Level Agreement Analyses
White Paper Managed Network Service Providers (NSP) supply the bandwidth, transport, equipment, and management services to connect disparate locations across the corporate enterprise. To ensure levels of quality for traffic transiting these... [11 Sep 2008]
On the Safety and Efficiency of Firewall Policy Deployment
White Paper The paper defines safe and most-efficient deployments, and introduces the shuffling theorem as a formal basis for constructing deployment algorithms and proving their safety. Firewall policy management is challenging and... [23 Apr 2008]
A Geometric Theorem for Wireless Network Design Optimization
White Paper Consider an infinite square grid G. How many discs of given radius r, centered at the vertices of G, are required, in the worst case, to completely cover an arbitrary disc of radius r placed on the plane? [09 Jan 2008]
Peter Cochrane's Blog: The last CD
Comment And, of course, we walk around with the existence theorem between our ears. Ask yourself this simple question: when was the last time you burned a CD and can you even remember the floppy disk? The old 1.44MB floppies... [25 Oct 2007]
Authenticity by Typing for Security Protocols
White Paper The main theorem guarantees that any well-typed protocol is robustly safe, that is, its correspondence assertions are true in the presence of any opponent expressible in spi. This paper proposes a new method to check... [09 Dec 2006]
