Sciweavers

1000 search results - page 193 / 200
» Nominal rewriting systems
Sort
View
KBSE
2000
IEEE
14 years 5 days 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
ASPLOS
2008
ACM
13 years 10 months ago
The design and implementation of microdrivers
Device drivers commonly execute in the kernel to achieve high performance and easy access to kernel services. However, this comes at the price of decreased reliability and increas...
Vinod Ganapathy, Matthew J. Renzelmann, Arini Bala...
FMSB
2008
129views Formal Methods» more  FMSB 2008»
13 years 10 months ago
Rule-Based Modelling, Symmetries, Refinements
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
Vincent Danos, Jérôme Feret, Walter F...
DYNAMO
2000
87views more  DYNAMO 2000»
13 years 10 months ago
Derive: a tool that automatically reverse-engineers instruction encodings
Many binary tools, such as disassemblers, dynamiccode generation systems, and executable code rewriters, need to understand how machine instructions are encoded. Unfortunately, sp...
Dawson R. Engler, Wilson C. Hsieh
PVLDB
2008
146views more  PVLDB 2008»
13 years 8 months ago
Graceful database schema evolution: the PRISM workbench
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo