949 search results - page 156 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
IFL
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that desc...
FORMATS
2003
Springer
14 years 1 months ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
IIWAS
2008
13 years 10 months ago
2008
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
FMOODS
2003
13 years 10 months ago
2003
Abstract. Inheritance is one of the key features for the success of objectoriented languages. Inheritance (or specialisation) supports incremental design and re-use of already writ...