Sciweavers

3044 search results - page 282 / 609
» Linear logical approximations
Sort
View
ICALP
2009
Springer
16 years 7 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin
ICSE
2004
IEEE-ACM
16 years 6 months ago
Runtime Verification of Statechart Implementations
Our paper introduces a runtime verification framework for concurrent monitoring of applications specified by UML statecharts. The approach offers a considerable degree of granulari...
Gergely Pintér, István Majzik
TPHOL
2005
IEEE
16 years 8 days ago
From PSL to LTL: A Formal Validation in HOL
Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
Thomas Tuerk, Klaus Schneider
VLDB
1995
ACM
66views Database» more  VLDB 1995»
15 years 10 months ago
A Performance Evaluation of OID Mapping Techniques
In this paper, three techniques to implement logical OIDs are thoroughly evaluated: hashing, B-trees and a technique called direct mapping. Among these three techniques, direct ma...
André Eickler, Carsten Andreas Gerlhof, Don...
ATAL
2008
Springer
15 years 8 months ago
Verifying Social Expectations by Model Checking Truncated Paths
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectation...
Stephen Cranefield, Michael Winikoff