Sciweavers

1636 search results - page 98 / 328
» Reasoning About Quantum Systems
Sort
View
CSL
2010
Springer
15 years 6 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
ENTCS
2008
97views more  ENTCS 2008»
15 years 6 months ago
Meta-programming With Built-in Type Equality
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
Tim Sheard, Emir Pasalic
JSA
2008
116views more  JSA 2008»
15 years 6 months ago
Analyzing composability of applications on MPSoC platforms
Modern day applications require use of multi-processor systems for reasons of performance, scalability and power efficiency. As more and more applications are integrated in a sing...
Akash Kumar, Bart Mesman, Bart D. Theelen, Henk Co...
FAABS
2000
Springer
15 years 9 months ago
Formal Agent Development: Framework to System
Much work in the field of agent-based systems has tended to focus on either the development of practical applications of agent systems on the one hand, or the development of sophis...
Mark d'Inverno, Michael Luck
DSN
2008
IEEE
15 years 8 months ago
Experiences with formal specification of fault-tolerant file systems
Fault-tolerant, replicated file systems are a crucial component of today's data centers. Despite their huge complexity, these systems are typically specified only in brief pr...
Roxana Geambasu, Andrew Birrell, John MacCormick