Sciweavers

147 search results - page 6 / 30
» A Transformation System for Definite Programs Based on Termi...
Sort
View
RTA
2010
Springer
14 years 14 days ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
FLOPS
2004
Springer
14 years 9 days ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
ENTCS
2002
78views more  ENTCS 2002»
13 years 8 months ago
Slicing Synchronous Reactive Programs
This paper extends the well-known technique of slicing to synchronous reactive programs. Synchronous languages exemplified by Esterel, Lustre, Signal and Argos, novel model of exe...
Vinod Ganapathy, S. Ramesh
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 3 months ago
Distributed scheduling for air traffic throughput maximization during the terminal phase of flight
FAA's NextGen program aims at increasing the capacity of the national airspace, while ensuring the safety of aircraft. This paper provides a distributed merging and spacing al...
Rahul Chipalkatty, Philip Twu, Amir Rahmani, Magnu...
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
14 years 7 days ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider