Sciweavers

544 search results - page 53 / 109
» The Algebra of Equality Proofs
Sort
View
COORDINATION
2009
Springer
14 years 8 months ago
Assume-Guarantee Verification of Concurrent Systems
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
Liliana D'Errico, Michele Loreti
AIML
2008
13 years 9 months ago
Labelled modal tableaux
Labelled tableaux are extensions of semantic tableaux with annotations (labels, indices) whose main function is to enrich the modal object language with semantic elements. This pap...
Guido Governatori
FSS
2006
85views more  FSS 2006»
13 years 8 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...
ICDE
2006
IEEE
193views Database» more  ICDE 2006»
14 years 9 months ago
On Pushing Multilingual Query Operators into Relational Engines
To effectively support today's global economy, database systems need to manage data in multiple languages simultaneously. While current database systems do support the storag...
A. Kumaran, Pavan K. Chowdary, Jayant R. Haritsa
COCOON
2006
Springer
13 years 11 months ago
Varieties Generated by Certain Models of Reversible Finite Automata
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
Marats Golovkins, Jean-Eric Pin