Sciweavers

351 search results - page 27 / 71
» Logics Capturing Local Properties
Sort
View
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
AAAI
1998
13 years 10 months ago
Supermodels and Robustness
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Ro...
ICDT
2010
ACM
163views Database» more  ICDT 2010»
13 years 7 months ago
Composing Local-As-View Mappings
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia Arocena, Ariel Fuxman, Renee Miller
POPL
2008
ACM
14 years 9 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
WWW
2008
ACM
14 years 9 months ago
A differential notion of place for local search
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...
Vlad Tanasescu, John Domingue