22 search results - page 2 / 5 » Static Analysis using Parameterised Boolean Equation Systems |
KBSE
1998
IEEE
13 years 9 months ago
1998
IEEE
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
ASAP
1996
IEEE
13 years 9 months ago
1996
IEEE
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures ...
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
We give a new practical algorithm to compute, in finite time, a fixpoint (and often the least fixpoint) of a system of equations in the abstract numerical domains of zones and t...
MICAI
2000
Springer
13 years 9 months ago
2000
Springer
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
TAPSOFT
1995
Springer
13 years 9 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...