Sciweavers

949 search results - page 51 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
FM
2003
Springer
98views Formal Methods» more  FM 2003»
14 years 26 days ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
TIME
1994
IEEE
13 years 11 months ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
FSE
2005
Springer
107views Cryptology» more  FSE 2005»
14 years 1 months ago
Small Scale Variants of the AES
In this paper we define small scale variants of the AES. These variants inherit the design features of the AES and provide a suitable framework for comparing different cryptanaly...
Carlos Cid, Sean Murphy, Matthew J. B. Robshaw
IMR
2004
Springer
14 years 1 months ago
A Generalized Graph-Theoretic Mesh Optimization Model
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...
Andrey A. Mezentsev
JCP
2008
116views more  JCP 2008»
13 years 7 months ago
Formal Verification and Visualization of Security Policies
Verified and validated security policies are essential components of high assurance computer systems. The design and implementation of security policies are fundamental processes i...
Luay A. Wahsheh, Daniel Conte de Leon, Jim Alves-F...