5 search results - page 1 / 1 » An effective proof of the well-foundedness of the multiset p... |
AAECC
2006
Springer
13 years 9 months ago
2006
Springer
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
SAS
2010
Springer
13 years 8 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
Although the counterexample returned by a model checker can help in reproducing the symptom related to a defect, a significant amount of effort is often required for the programmer...
ESORICS
2008
Springer
13 years 11 months ago
2008
Springer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...
RTCSA
1999
IEEE
14 years 2 months ago
1999
IEEE
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...