199 search results - page 25 / 40 » A Fully Abstract Model for Graph-Interpreted Temporal Logic |
131
click to vote
DSVIS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The ConcurTaskTrees (CTT) is one of the most widely used notations for task modeling, specifically tailored for user interface model-based design. The integration of CTT ...
126
click to vote
LPAR
2007
Springer
15 years 8 months ago
2007
Springer
Operational models of (security) protocols, on one hand, are readable and conveniently match their implementation (at a certain abstraction level). Epistemic models, on the other h...
102
click to vote
GLVLSI
2009
IEEE
15 years 8 months ago
2009
IEEE
In the context of formal verification Bounded Model Checking (BMC) has shown to be very powerful for large industrial designs. BMC is used to check whether a circuit satisfies a...
115
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
107
click to vote
GI
2007
Springer
15 years 5 months ago
2007
Springer
: Test-case generation with model-checkers is a promising field of research in software testing. Model-checker based approaches offer many advantages: They are fully automated, the...