Sciweavers

13383 search results - page 274 / 2677
» Abstractions from proofs
Sort
View
ECEASST
2010
15 years 1 months ago
Parallelism and Concurrency Theorems for Rules with Nested Application Conditions
Abstract. We present Local Church-Rosser, Parallelism, and Concurrency Theorems for rules with nested application conditions in the framework of weak adhesive HLR categories includ...
Hartmut Ehrig, Annegret Habel, Leen Lambers
TOC
2010
155views Management» more  TOC 2010»
15 years 1 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
CADE
2012
Springer
13 years 9 months ago
Rewriting Induction + Linear Arithmetic = Decision Procedure
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
Stephan Falke, Deepak Kapur
RE
2005
Springer
16 years 5 days ago
Reverse Engineering Goal Models from Legacy Code
A reverse engineering process aims at reconstructing el abstractions from source code. This paper presents a novel reverse engineering methodology for recovering stakeholder goal ...
Yijun Yu, Yiqiao Wang, John Mylopoulos, Sotirios L...
ENTCS
2002
125views more  ENTCS 2002»
15 years 6 months ago
Specification of Logic Programming Languages from Reusable Semantic Building Blocks
We present a Language Prototyping System that facilitates the modular development of interpreters from independent semantic buildks. The abstract syntax is modelled as the fixpoint...
José Emilio Labra Gayo, Juan Manuel Cueva L...