Sciweavers

1054 search results - page 154 / 211
» A Logic Language of Granular Computing
Sort
View
FORTE
2009
13 years 5 months ago
A Model-Checking Approach for Service Component Architectures
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
João Abreu, Franco Mazzanti, José Lu...
ESOP
2012
Springer
12 years 3 months ago
The Call-by-Need Lambda Calculus, Revisited
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
Stephen Chang, Matthias Felleisen
PEPM
2004
ACM
14 years 1 months ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
AISC
2004
Springer
14 years 1 months ago
Algorithm-Supported Mathematical Theory Exploration: A Personal View and Strategy
Abstract. We present a personal view and strategy for algorithm-supported mathematical theory exploration and draw some conclusions for the desirable functionality of future mathem...
Bruno Buchberger
KBSE
2000
IEEE
13 years 11 months 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