Sciweavers

1320 search results - page 148 / 264
» Efficient Implementation of a Linear Logic Programming Langu...
Sort
View
130
Voted
AICOM
2010
127views more  AICOM 2010»
15 years 3 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
TOOLS
1998
IEEE
15 years 7 months ago
An Architecture for Unified Dialogue in Distributed Object Systems
In traditional information systems, the user interface is controlled by one single application. In distributed systems, several distributed components may want to influence the ap...
Arve Larsen, Peter D. Holmes
138
Voted
IFIP
2010
Springer
14 years 10 months ago
Efficient Decision Procedures for Message Deducibility and Static Equivalence
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
Bruno Conchinha, David A. Basin, Carlos Caleiro
151
Voted
DAWAK
2000
Springer
15 years 8 months ago
Applying Vertical Fragmentation Techniques in Logical Design of Multidimensional Databases
In the context of multidimensional databases implemented on relational DBMSs through star schemes, the most effective technique to enhance performances consists of materializing re...
Matteo Golfarelli, Dario Maio, Stefano Rizzi
110
Voted
ICFP
2008
ACM
16 years 3 months ago
Efficient nondestructive equality checking for trees and graphs
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
Michael D. Adams, R. Kent Dybvig