Sciweavers

258 search results - page 37 / 52
» Hybrid Logics on Linear Structures: Expressivity and Complex...
Sort
View
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 8 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
SSDBM
2003
IEEE
83views Database» more  SSDBM 2003»
14 years 1 months ago
PiQA: An Algebra for Querying Protein Data Sets
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
Sandeep Tata, Jignesh M. Patel
ICDT
2009
ACM
125views Database» more  ICDT 2009»
14 years 9 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
ISSTA
2000
ACM
14 years 29 days ago
Verisim: Formal analysis of network simulations
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim...
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
14 years 2 months ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri