Sciweavers

1894 search results - page 168 / 379
» A TLA Proof System
Sort
View
JSC
2006
122views more  JSC 2006»
15 years 4 months ago
An automated prover for Zermelo-Fraenkel set theory in Theorema
This paper presents some fundamental aspects of the design and the implementation of an automated prover for Zermelo-Fraenkel set theory within the well-known Theorema system. The...
Wolfgang Windsteiger
SCL
2008
254views more  SCL 2008»
15 years 4 months ago
The Hybrid Maximum Principle is a consequence of Pontryagin Maximum Principle
We give a simple proof of the Maximum Principle for smooth hybrid control systems by reducing the hybrid problem to an optimal control problem of Pontryagin type and then by using...
A. V. Dmitruk, A. M. Kaganovich
149
Voted
ENTCS
2002
66views more  ENTCS 2002»
15 years 3 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
15 years 2 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas
CODASPY
2012
13 years 11 months ago
Identifying native applications with high assurance
Main stream operating system kernels lack a strong and reliable mechanism for identifying the running processes and binding them to the corresponding executable applications. In t...
Hussain M. J. Almohri, Danfeng (Daphne) Yao, Denni...