Sciweavers

1154 search results - page 22 / 231
» Mathematizing C concurrency
Sort
View
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
14 years 2 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
IJCSA
2006
95views more  IJCSA 2006»
13 years 9 months ago
Modeling and Formal Verification of DHCP Using SPIN
The Dynamic Host Configuration Protocol (DHCP) is a widely used communication protocol. In this paper, a portion of the protocol is chosen for modeling and verification, namely th...
Syed M. S. Islam, Mohammed H. Sqalli, Sohel Khan
STACS
2010
Springer
14 years 4 months ago
Mathematics, Cryptology, Security
Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and H...
Jacques Stern
COMPSAC
2002
IEEE
14 years 1 months ago
A Simple Mathematically Based Framework for Rule Extraction from an Arbitrary Programming Language
Programs use rules to dictate or constrain specific decisions or actions. These rules have typically been tested, revised, and updated continuously; therefore, they represent a su...
Frederick V. Ramsey, James J. Alpigini
ECCV
2004
Springer
14 years 11 months ago
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
Emmanuel Prados, Olivier D. Faugeras