Sciweavers

46 search results - page 2 / 10
» Combining Algebraic and Set-Theoretic Specifications
Sort
View
LPNMR
1990
Springer
13 years 9 months ago
The meaning of Negative Premises in Transition System Specifications
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
Roland N. Bol, Jan Friso Groote
AISC
1998
Springer
13 years 9 months ago
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
Clemens Ballarin, Lawrence C. Paulson
CUZA
2002
132views more  CUZA 2002»
13 years 5 months ago
A Process Algebra for Predictible Control Systems
This paper presents Process Algebra for Predictible Control Systems (PAPCS) as a model for specifying and analysis of concurrent, time and resource dependent, distributed control s...
Nicolae Marian
DS
2001
118views Database» more  DS 2001»
13 years 6 months ago
Constraints as Mobile Specifications in E-Commerce Applications
We show how quantified constraints expressed in a sub-language of first-order logic, againstashareddatamodelthatisfreetoevolve, provideanexcellentwayof transporting domain-specific...
Kit-ying Hui, Peter M. D. Gray, Graham J. L. Kemp,...
TLCA
2007
Springer
13 years 11 months ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani