949 search results - page 57 / 190 » Lightweight Formal Methods for Computer Algebra Systems |
NSPW
1998
ACM
13 years 12 months ago
1998
ACM
Object-based programming is becoming more and more popular and is currently conquering the world of distributed programming models. In object-based systems access control is often...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
FORTE
1994
13 years 9 months ago
1994
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
ICCS
2003
Springer
14 years 26 days ago
2003
Springer
Because botanical taxonomies are prototypical classifications it would seem that it should be easy to formalize them as concept lattices or type hierarchies. On closer inspection,...
IFM
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a formal language for the design of component-based enterprise system. The language (StAC) allows the usual parallel and sequential behaviours, but most signifi...