Sciweavers

2409 search results - page 289 / 482
» Logical systems for structured specifications
Sort
View
LFCS
2009
Springer
15 years 10 months ago
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
Canonical propositional Gentzen-type calculi are a natural class of systems which in addition to the standard axioms and structural rules have only logical rules where exactly one ...
Arnon Avron, Anna Zamansky
APN
2004
Springer
15 years 9 months ago
Reachability Set Generation for Petri Nets: Can Brute Force Be Smart?
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
Gianfranco Ciardo
TACAS
1999
Springer
88views Algorithms» more  TACAS 1999»
15 years 8 months ago
A Theorem Prover-Based Analysis Tool for Object-Oriented Databases
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
David Spelt, Susan Even
CSL
1995
Springer
15 years 7 months ago
Deduction by Combining Semantic Tableaux and Integer Programming
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
Bernhard Beckert, Reiner Hähnle
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 4 months ago
Paths to stardom: calibrating the potential of a peer-based data management system
As peer-to-peer (P2P) networks become more familiar to the database community, intense interest has built up in using their scalability and resilience properties to scale database...
Mihai Lupu, Beng Chin Ooi, Y. C. Tay