Sciweavers

949 search results - page 60 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
FOSSACS
2007
Springer
14 years 1 months ago
The Rewriting Calculus as a Combinatory Reduction System
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
Clara Bertolissi, Claude Kirchner
ICSOC
2005
Springer
14 years 1 months ago
Choreography and Orchestration: A Synergic Approach for System Design
Abstract. Choreography and orchestration languages deal with business processes design and specification. Referring to Web Services technology, the most credited proposals are WS-...
Nadia Busi, Roberto Gorrieri, Claudio Guidi, Rober...
SAC
2010
ACM
14 years 2 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
VSTTE
2010
Springer
13 years 5 months ago
An Approach of Requirements Tracing in Formal Refinement
Formal modeling of computing systems yields models that are intended to be correct with respect to the requirements that have been formalized. The complexity of typical computing s...
Michael Jastram, Stefan Hallerstede, Michael Leusc...
NGITS
1999
Springer
13 years 12 months ago
From Object-Process Diagrams to a Natural Object-Process Language
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
Mor Peleg, Dov Dori