Sciweavers

882 search results - page 160 / 177
» A Taste of Rewrite Systems
Sort
View
FSEN
2009
Springer
14 years 15 days ago
Executable Interface Specifications for Testing Asynchronous Creol Components
We propose and explore a formal approach for black-box testing asynchronously communicating components in open environments. Asynchronicity poses a challenge for validating and tes...
Immo Grabe, Marcel Kyas, Martin Steffen, Arild B. ...
CSL
2006
Springer
14 years 9 days ago
A Sequent Calculus for Type Theory
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
FASE
2006
Springer
14 years 8 days ago
Formal Simulation and Analysis of the CASH Scheduling Algorithm in Real-Time Maude
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...
Peter Csaba Ölveczky, Marco Caccamo
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
14 years 5 days ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
CSCLP
2008
Springer
13 years 10 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin