Sciweavers

3624 search results - page 346 / 725
» Abstract Algebraic Logic
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
16 years 1 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
DBPL
1999
Springer
122views Database» more  DBPL 1999»
15 years 11 months ago
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
Linear constraint databases and query languages are appropriate for spatial database applications. Not only the data model is natural to represent a large portion of spatial data s...
Gabriel M. Kuper, Jianwen Su
ENTCS
2006
112views more  ENTCS 2006»
15 years 6 months ago
Modeling Web Applications by the Multiple Levels of Integrity Policy
We propose a formal method to validate the reliability of a web application, by modeling interactions among its constituent objects. Modeling exploits the recent "Multiple Le...
Gianluca Amato, Massimo Coppola, Stefania Gnesi, F...
JLP
2006
81views more  JLP 2006»
15 years 6 months ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
LICS
2010
IEEE
15 years 5 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...