Sciweavers

2905 search results - page 136 / 581
» Formal Memetic Algorithms
Sort
View
ZUM
1998
Springer
105views Formal Methods» more  ZUM 1998»
14 years 2 months ago
Comparing Extended Z with a Heterogeneous Notation for Reasoning about Time and Space
We contrast using a notation extension with using a combination of notations. Specifically, we compare the use of an extended dialect of Z [10] with a combination of Z and predicat...
Richard F. Paige
ACISP
1997
Springer
14 years 2 months ago
A Method to Implement a Denial of Service Protection Base
Denial of service attack is an attempt from any authorized or unauthorized entity to allocate resources excessively to prevent normal operation of the system. A method will be pres...
Jussipekka Leiwo, Yuliang Zheng
AMAST
2006
Springer
14 years 1 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura
FMCAD
2000
Springer
14 years 1 months ago
Checking Safety Properties Using Induction and a SAT-Solver
We take a fresh look at the problem of how to check safety properties of finite state machines. We are particularly interested in checking safety properties with the help of a SAT-...
Mary Sheeran, Satnam Singh, Gunnar Stålmarck
MPC
1995
Springer
93views Mathematics» more  MPC 1995»
14 years 1 months ago
Extracting Programs with Exceptions in an Impredicative Type System
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
Jean-François Monin