Sciweavers

367 search results - page 69 / 74
» A Rewriting Logic Sampler
Sort
View
FORTE
2011
12 years 11 months ago
Analyzing BGP Instances in Maude
Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Resea...
Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Th...
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 5 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
ICDE
2009
IEEE
195views Database» more  ICDE 2009»
14 years 2 months ago
The PRISM Workwench: Database Schema Evolution without Tears
— Information Systems are subject to a perpetual evolution, which is particularly pressing in Web Information Systems, due to their distributed and often collaborative nature. Su...
Carlo Curino, Hyun J. Moon, MyungWon Ham, Carlo Za...
LFCS
2007
Springer
14 years 2 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula