949 search results - page 130 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
SAS
2000
Springer
14 years 11 days ago
2000
Springer
Computing invariants is the key issue in the analysis of infinite-state systems whether analysis means testing, verification or parameter synthesis. In particular, methods that all...
TOCL
2012
11 years 11 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
SAC
2003
ACM
14 years 2 months ago
2003
ACM
Matchmaking is the problem of matching offers and requests, such as supply and demand in a marketplace, services and customers in a service agency, etc., where both partners are ...
FM
2003
Springer
14 years 2 months ago
2003
Springer
: Real computer-based systems fail, and hence are often far less dependable than their owners and users need and desire. Individuals, organisations and indeed the world at large ar...
DOCENG
2003
ACM
14 years 2 months ago
2003
ACM
This paper describes an implementation for syntax-directed transformation of XML documents from one structure to another. The system is based on the method which we have introduce...