Sciweavers

271 search results - page 43 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
FUIN
2008
103views more  FUIN 2008»
13 years 8 months ago
Implementing Sorting Networks with Spiking Neural P Systems
Spiking neural P systems simulate the behavior of neurons sending signals through axons. Recently, some applications concerning Boolean circuits and sorting algorithms have been pr...
Rodica Ceterchi, Alexandru Ioan Tomescu
ATAL
2009
Springer
14 years 2 months ago
Of robot ants and elephants
Investigations of multi-robot systems often make implicit assumptions concerning the computational capabilities of the robots. Despite the lack of explicit attention to the comput...
Asaf Shiloni, Noa Agmon, Gal A. Kaminka
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 2 months ago
Privacy in GLAV Information Integration
Abstract. We define and study formal privacy guarantees for information integration systems, where sources are related to a public schema by mappings given by source-to-target dep...
Alan Nash, Alin Deutsch
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
13 years 6 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard